An Optimal Matching Algorithm Based on Rough Localization and Exact Adjustment

Abstract:

Article Preview

Aiming at the problems on estimate of the initial transformation, matching precision and global optimization in matching, this paper presents a matching method, which is based on rough localization and exact adjustment. By means of rotation, translation and coincidence of the minimum bounding boxes of surface and measured points, rough localization is realized, which produces a good estimate for the follow-up iterative algorithm. The closest points that were calculated via the normal projection of the sample points then establish the correspondence between two objects. An iterative process is used in the exact adjustment to ensure the global optimization of match. For reducing the effect of bad points or local distortion, a maximum distance criterion is adopted to refine the transformation between objects. A computer simulation is given to demonstrate that the algorithm is steady and effective.

Info:

Periodical:

Key Engineering Materials (Volumes 291-292)

Edited by:

Yury M. Baron, Jun'ichi Tamaki and Tsunemoto Kuriyagawa

Pages:

661-666

DOI:

10.4028/www.scientific.net/KEM.291-292.661

Citation:

Y.W. Sun and J.T. Xu, "An Optimal Matching Algorithm Based on Rough Localization and Exact Adjustment", Key Engineering Materials, Vols. 291-292, pp. 661-666, 2005

Online since:

August 2005

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.