An unsupervised iterative N-dimensional point-set registration algorithm for unlabeled data (i.e., the correspondence between points is unknown) based on linear least squares is proposed. The algorithm considers all possible point pairings and iteratively aligns the two sets until the number of point pairs does not exceed the maximum number of allowable one-to-one pairings.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. S. Arun, T. S. Huang, and S. D. Blostein, “Least-squares fitting of two 3-D point sets,” IEEE Trans. Pattern Anal. Machine Intell., 9, 698–700 (1987).
S. Chang, F. Cheng, W. Hsu, and G. Wu, “Fast algorithm for point pattern matching: Invariant to translations, rotations and scale changes,” Pattern Recognit., 30, 311–320 (1997).
S. Gold, A. Rangarajan, C. P. Lu, S. Pappu, and E. Mjolsness, “New algorithms for 2d and 3d point matching: pose estimation and correspondence,” Pattern Recognit., 31, 1019–1031 (1998).
A. P. Hosseinbor, R. Zhdanov, and A. Ushveridze, “An unsupervised 2d point-set registration algorithm for unlabeled feature points: Application to fingerprint matching,” Pattern Recognit. Lett., 100, 137–143 (2017).
B. Jian and B. C. Vemuri, “Robust point set registration using Gaussian mixture models,” IEEE PAMI, 33, 1633–1645 (2010).
W. Kabsch, “A solution for the best rotation to relate two sets of vectors,” Acta Crystallogr., 32, 922–923 (1976).
S. Lan, Z. Guo, and J. You, “A non-rigid registration method with application to distorted fingerprint matching,” Pattern Recognit., 95, 48–57 (2019).
A. Rangarajan, H. Chui, and F. L. Bookstein, “The softassign procrustes matching algorithm,” Inf. Process. Med. Imag., 29–42 (1997).
A. Rangarajan, H. Chui, E. Mjolsness, S. Pappu, L. Davachi, P. S. Goldman-Rakic, and J. S. Duncan, “A robust point matching algorithm for autoradiograph alignment,” Med. Image Anal., 1, 379–398 (1997).
Y. Tsin and T. Kanade, “A correlation-based approach to robust point set registration,” Europ. Conf. Comput. Vis., 558–569 (2004).
S. Umeyama, “Least-squares estimation of transformation parameters between two point sets,” IEEE Trans. Pattern Anal. Mach. Intell., 13, 376–380 (1991).
Author information
Authors and Affiliations
Corresponding author
Additional information
Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 74, No. 3, pp. 427–436, March, 2022. Ukrainian DOI: https://doi.org/10.37863/umzh.v74i3.6969.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Hosseinbor, P., Zhdanov, R. & Ushveridze, A. An Unsupervised Iterative N-Dimensional Point-Set Registration Algorithm. Ukr Math J 74, 484–495 (2022). https://doi.org/10.1007/s11253-022-02077-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11253-022-02077-3