By Topic

Research on a novel 3D point cloud robust registration algorithm

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

2 Author(s)
Lin Hongbin ; Inst. of Electr. Eng., Yanshan Univ., Qinhuangdao, China ; Liu Bin

This paper present a novel algorithm for robust registration of 3D point cloud. It significantly increases the robustness against outliers by using the multivariate Epanechnikov kernel, which changes the registration procedure from exponential minimization procedure to polynomial minimization procedure. It reduces the computation complexity by using a new cost function. Because the analytical expression of the cost function is available, the registration procedure can converge in very little iteration. It also improves the flexibility of the algorithm by using the new parameterized cost function, which allows us to adjust the performance of the algorithm between robustness and efficiency.

Published in:

Computer Design and Applications (ICCDA), 2010 International Conference on  (Volume:5 )

Date of Conference:

25-27 June 2010