Show simple item record Liu, Yonghuai 2008-01-23T16:21:07Z 2008-01-23T16:21:07Z 2005-10-01
dc.identifier.citation Liu , Y 2005 , ' Automatic 3d free form shape matching using the graduated assignment algorithm. ' Pattern Recognition , vol 38 , no. 10 , pp. 1615-1631 . DOI: 10.1016/j.patcog.2005.01.008 en
dc.identifier.issn 0031-3203
dc.identifier.other PURE: 75196
dc.identifier.other PURE UUID: 9a41cb9e-3ce0-4989-85e2-d5e903a73248
dc.identifier.other dspace: 2160/470
dc.identifier.other DSpace_20121128.csv: row: 359
dc.identifier.other Scopus: 22844439630
dc.description Liu, Yonghuai. Automatic 3d free form shape matching using the graduated assignment algorithm. Pattern Recognition, vol. 38, no. 10, pp. 1615-1631, 2005. en
dc.description.abstract Three-dimensional free form shape matching is a fundamental problem in both the machine vision and pattern recognition literatures. However, the automatic approach to 3D free form shape matching still remains open. In this paper, we propose using k closest points in the second view for the automatic 3D free form shape matching. For the sake of computational efficiency, the optimised k-D tree is employed for the search of the k closest points. Since occlusion and appearance and disappearance of points almost always occur, slack variables have to be employed, explicitly modelling outliers in the process of matching. Then the relative quality of each possible point match is estimated using the graduated assignment algorithm, leading the camera motion parameters to be estimated by the quaternion method in the weighted least-squares sense. The experimental results based on both synthetic data and real images without any pre-processing show the effectiveness and efficiency of the proposed algorithm for the automatic matching of overlapping 3D free form shapes with either sparse or dense points. en
dc.format.extent 17 en
dc.language.iso eng
dc.relation.ispartof Pattern Recognition en
dc.rights en
dc.subject 3D free form shape en
dc.subject automatic matching en
dc.subject k closest points en
dc.subject graduated assignment en
dc.subject optimised k-D tree en
dc.subject time complexity en
dc.subject space complexity en
dc.title Automatic 3d free form shape matching using the graduated assignment algorithm. en
dc.type /dk/atira/pure/researchoutput/researchoutputtypes/contributiontojournal/article en
dc.contributor.institution Department of Computer Science en
dc.contributor.institution Vision, Graphics and Visualisation Group en
dc.description.status Peer reviewed en

Files in this item

Aside from theses and in the absence of a specific licence document on an item page, all works in Cadair are accessible under the CC BY-NC-ND Licence. AU theses and dissertations held on Cadair are made available for the purposes of private study and non-commercial research and brief extracts may be reproduced under fair dealing for the purpose of criticism or review. If you have any queries in relation to the re-use of material on Cadair, contact

This item appears in the following Collection(s)

Show simple item record

Search Cadair

Advanced Search