By Topic

3D shape matching using collinearity constraint

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)
Yonghuai Liu ; Dept. Comput. Sci., Wales Univ., Aberystwyth, UK ; Longzhuang Li ; Baogang Wei

In this paper, a novel algorithm is proposed to carry out automatic 3D shape matching with 3D shapes represented as sets of points. After the possible matches between the 3D shapes have been determined by the tradition ICP criterion, the novel approach employs the collinearity constraint to eliminate false matches based on a statistical model. A comparative study based on real range images has shown that the proposed algorithm is accurate, robust and efficient for the automatic matching of overlapping 3D shapes.

Published in:

Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 IEEE International Conference on  (Volume:3 )

Date of Conference:

26 April-1 May 2004