Automatic 3d free form shape matching using the graduated assignment algorithm.


Autoria(s): Liu, Yonghuai
Contribuinte(s)

Department of Computer Science

Vision, Graphics and Visualisation Group

Data(s)

23/01/2008

23/01/2008

01/10/2005

Resumo

Liu, Yonghuai. Automatic 3d free form shape matching using the graduated assignment algorithm. Pattern Recognition, vol. 38, no. 10, pp. 1615-1631, 2005.

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.

Peer reviewed

Formato

17

Identificador

Liu , Y 2005 , ' Automatic 3d free form shape matching using the graduated assignment algorithm. ' Pattern Recognition , pp. 1615-1631 . DOI: 10.1016/j.patcog.2005.01.008

0031-3203

PURE: 75196

PURE UUID: 9a41cb9e-3ce0-4989-85e2-d5e903a73248

dspace: 2160/470

http://hdl.handle.net/2160/470

http://dx.doi.org/10.1016/j.patcog.2005.01.008

Idioma(s)

eng

Relação

Pattern Recognition

Tipo

/dk/atira/pure/researchoutput/researchoutputtypes/contributiontojournal/article

Direitos