An Optimal Matching Algorithm Based on Rough Localization and Exact Adjustment

Abstract:

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.

• Periodical: Key Engineering Materials (Volumes 291-292)
• Pages: 661-666
• DOI: https://doi.org/10.4028/www.scientific.net/KEM.291-292.661
• Online since: August 2005
• Authors: Y.W. Sun, J.T. Xu
• Keywords: Matching, Maximum Distance Criterion, Minimum Bounding Box

References

[1] P. J. Besl and N. D. McKay: IEEE Trans Pattern Analysis Machine Intelligence, Vol. 14 (1992), No. 2, pp.239-256.

[2] G. C. Sharp, S. W. Lee and D. K. Wehe: IEEE Trans Pattern Analysis Machine Intelligence, Vol. 24 (2002), No. 1, pp.90-102.

DOI: 10.1109/34.982886

[3] K. H. Ko, T. Maekawa and N. M. Patrikalakis: Computer-Aided Design, Vol. 35 (2003), No. 10, pp.913-923.

DOI: 10.1016/s0010-4485(02)00205-1

[4] B. Shen, G.Q. Huang, K.L. Mak and X.C. Wang: Journal of Materials Processing Technology, Vol. 139 (2003), pp.310-314.

[5] C.H. Menq, H. T. Yau and G. Y. Lai: IEEE Transaction on Robotics and Automation, Vol. 8(1992), No. 2, pp.268-178.

[6] K. H. Ko, T. Maekawa, N. M. Patrikalakis, H. Masuda and F. -E. Wolter: Journal of Computing and Information Science in Engineering, Vol. 3(2003), No. 4, pp.325-333.

[7] K. S. Arun, T. S. Huang and S. D. Blostein: IEEE Trans Pattern Analysis Machine Intelligence, Vol. 9 (1987), No. 5, pp.698-700.

[8] G. Barequet and S. Har-Peled: The 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January, 1999, pp.82-91.

[9] C. K. Chan and S. T. Tan: Computers and Structures, Vol. 79(2001), No. 15, pp.1433-1499.

[10] N.M. Patrikalakis and T. Maekawa: Shape interrogation for computer aided design and manufacturing (Springer, Heidelberg 2002).

DOI: 10.1007/978-3-642-04074-0

[11] E. C. Sherbrooke and N. M. Patrikalakis: Computer Aided Geometry Design, Vol. 10(1993), No. 5, pp.379-405.

[12] D. P. Huttenlocher, G. A. Klanderman and W. J. Rucklidge: IEEE Trans Pattern Analysis Machine Intelligence, Vol. 15(1993), No. 9, pp.850-863.

DOI: 10.1109/34.232073

[13] Z. X. Li, J. B. Gou and Y. X. Chu: IEEE Trans on Robotic and Automation, Vol. 14(1998), No. 6, pp.864-878.