DocumentCode
2699122
Title
Fast and accurate computation of surface normals from range images
Author
Badino, H. ; Huber, D. ; Park, Y. ; Kanade, T.
Author_Institution
Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear
2011
fDate
9-13 May 2011
Firstpage
3084
Lastpage
3091
Abstract
The fast and accurate computation of surface normals from a point cloud is a critical step for many 3D robotics and automotive problems, including terrain estimation, mapping, navigation, object segmentation, and object recognition. To obtain the tangent plane to the surface at a point, the traditional approach applies total least squares to its small neighborhood. However, least squares becomes computationally very expensive when applied to the millions of measurements per second that current range sensors can generate. We reformulate the traditional least squares solution to allow the fast computation of surface normals, and propose a new approach that obtains the normals by calculating the derivatives of the surface from a spherical range image. Furthermore, we show that the traditional least squares problem is very sensitive to range noise and must be normalized to obtain accurate results. Experimental results with synthetic and real data demonstrate that our proposed method is not only more efficienThe fast and accurate computation of surface normals from a point cloud is a critical step for many 3D robotics and automotive problems, including terrain estimation, mapping, navigation, object segmentation, and object recognition. To obtain the tangent plane to the surface at a point, the traditional approach applies total least squares to its small neighborhood. However, least squares becomes computationally very expensive when applied to the millions of measurements per second that current range sensors can generate. We reformulate the traditional least squares solution to allow the fast computation of surface normals, and propose a new approach that obtains the normals by calculating the derivatives of the surface from a spherical range image. Furthermore, we show that the traditional least squares problem is very sensitive to range noise and must be normalized to obtain accurate results. Experimental results with synthetic and real data demonstrate that our pro- - posed method is not only more efficient by up to two orders of magnitude, but provides better accuracy than the traditional least squares for practical neighborhood sizes.t by up to two orders of magnitude, but provides better accuracy than the traditional least squares for practical neighborhood sizes.
Keywords
computer vision; distance measurement; least squares approximations; 3D robotics; accurate computation; automotive problems; fast computation; least squares solution; navigation; object recognition; object segmentation; point cloud; range images; range noise; range sensors; spherical range image; surface normals; tangent plane; terrain estimation; terrain mapping; Accuracy; Equations; Least squares approximation; Mathematical model; Noise; Sensors; Three dimensional displays;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation (ICRA), 2011 IEEE International Conference on
Conference_Location
Shanghai
ISSN
1050-4729
Print_ISBN
978-1-61284-386-5
Type
conf
DOI
10.1109/ICRA.2011.5980275
Filename
5980275
Link To Document