By Topic

Laplacian Operators for Direct Processing of Range Data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Coleman, S. ; Ulster Univ., Magee ; Suganthan, S. ; Scotney, B.

The use of range data has become prominent in the field of computer vision. Due to the irregular nature of range data that occurs with a number of sensors, feature extraction is a complex and challenging problem. Feature extraction techniques for range images are often based on scan line data approximations and hence do not employ exact data locations. We present a finite element based approach to the development of Laplacian operators that can be applied to both regularly or irregularly distributed range data. We demonstrate that the feature maps generated using our approach on range data are much less susceptible to noise than the traditional use of Laplacian operators on intensity images.

Published in:

Image Processing, 2007. ICIP 2007. IEEE International Conference on  (Volume:5 )

Date of Conference:

Sept. 16 2007-Oct. 19 2007