By Topic

Three-dimensional point-based shape registration algorithm based on adaptive distance function

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
$33 $33
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

4 Author(s)
W. L. Li ; State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan430074, People's Republic of China ; Z. P. Yin ; Y. A. Huang ; Y. L. Xiong

In this study, the authors propose an iterative registration algorithm with point-based representation. The task is to geometrically transform a mobile object to a stationary object. Without a good initial position for two shapes with high-curvature features, traditional point-based algorithms have many challenges, such as suffering from slow convergence or divergence. For these problems, the authors define a new distance function to describe the point-surface distance, where the point-surface shortest distance is considered. Then, a non-linear optimisation model is established to calculate the optimal transformation. Moreover, the convergence of the proposed algorithm is derived and analysed from the viewpoint of geometrical optimisation. The proposed method does not require surface representation, feature extraction, curvature computation and is more applicable when initial position is rough. Its efficiency and robustness are verified by a series of experiments.

Published in:

IET Computer Vision  (Volume:5 ,  Issue: 1 )