×

Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation. (English) Zbl 1045.68142

Summary: An extension of the iterative closest point matching by M-estimation is proposed for realization of robustness to non-overlapping data or outlying data in two sets of contour data or depth images for rigid bodies. An objective function which includes independent residual components for each of \(x\), \(y\) and \(z\) coordinates is originally defined and proposed to evaluate the fitness, simultaneously dealing with a distribution of outlying gross noise. The proposed procedure is based on modified M-estimation iterations with bi-weighting coefficients for selecting corresponding points for optimization of estimating the transforms for matching. The transforms can be represented by ‘quaternions’ in the procedure to eliminate redundancy in representation of rotational degree of freedom by linear matrices. Optimization steps are performed by the simplex method because it does not need computation of differentiation. Some fundamental experiments utilizing real data of 2D and 3D measurement show effectiveness of the proposed method. When reasonable initial positions are given, the unique solution of position could be provided in spite of surplus point data in the objects. And then the outlying data could be filtered out from the normal ones by the proposed method.

MSC:

68U10 Computing methodologies for image processing
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Stein, F.; Medioni, G., Structural indexingefficient 3-D object recognition, IEEE Trans. PAMI, 14, 2, 125-145 (1992)
[2] Ikawa, N., Rapid Product Development (1997), Chapman & Hall: Chapman & Hall London
[3] Ikeuchi, K.; Sato, Y., Modeling From Reality (2001), Kluwer Academic Publishers: Kluwer Academic Publishers Norwell · Zbl 0976.68592
[4] Kehtarnavaz, N.; Mohan, S., A framework for estimation of motion parameters from range images, CVGIP, 45, 88-105 (1989)
[5] A. Johnson, S. Kang, Registration and integration of textured 3-D data, Proceedings of 3DIM ’97, 1997, pp. 234-241.; A. Johnson, S. Kang, Registration and integration of textured 3-D data, Proceedings of 3DIM ’97, 1997, pp. 234-241.
[6] Zhang, Z., Iterative point matching for registration of free-form curves and surfaces, IJCV, 13, 2, 119-152 (1994)
[7] Masuda, T.; Yokoya, N., A robust method for registration and segmentation of multiple range images, CVIU, 61, 3, 295-307 (1995)
[8] Rousseeuw, P. J.; Leroy, A. M., Robust Regression and Outlier Detection (1987), Wiley: Wiley New York
[9] Besl, P. J.; McKay, N. D., A Method for Registration of 3-D Shapes, IEEE Trans. PAMI, 14, 2, 239-256 (1992)
[10] S. Kaneko, T. Kondo, A. Miyamoto, Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation, Proceedings of the third China-Japan Symposium on Mechatronics, 2002, pp. 37-42.; S. Kaneko, T. Kondo, A. Miyamoto, Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation, Proceedings of the third China-Japan Symposium on Mechatronics, 2002, pp. 37-42. · Zbl 1045.68142
[11] Hampel, F. R., Robust Statistics—The Approach based on Influence Functions (1986), Wiley: Wiley New York
[12] Holland, P. W.; Welsch, R. E., Robust regression using iteratively reweighted least-squares, Commun. Statist. Theor. Meth. A, 6, 9, 813-827 (1977) · Zbl 0376.62035
[13] R. Fletcher, Practical Methods of Optimization, Wiley, New York, 1997.; R. Fletcher, Practical Methods of Optimization, Wiley, New York, 1997. · Zbl 0905.65002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.