Abstract
Point sets matching method is very important in computer vision, feature extraction, fingerprint matching, motion estimation and so on. This paper proposes a robust point sets matching method. We present an iterative algorithm that is robust to noise case. Firstly, we calculate all transformations between two points. Then similarity matrix are computed to measure the possibility that two transformation are both true. We iteratively update the matching score matrix by using the similarity matrix. By using matching algorithm on graph, we obtain the matching result. Experimental results obtained by our approach show robustness to outlier and jitter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mikolajczyk, K., Schmid, C.: An affine invariant interest point detector. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002, Part I. LNCS, vol. 2350, pp. 128–142. Springer, Heidelberg (2002)
Chui, H., Rangarajan, A.: A new point matching algorithm for non-rigid registration. Computer Vision and Image Understanding 89(2), 114–141 (2003)
Suesse, H., Ortmann, W., Voss, K.: A novel approach for affine point pattern matching. In: Campilho, A., Kamel, M. (eds.) ICIAR 2006. LNCS, vol. 4142, pp. 434–444. Springer, Heidelberg (2006)
Zhang, L., Xu, W., Chang, C.: Genetic algorithm for affine point pattern matching. Pattern Recognition Letters, 9–19(2003)
Caetano, T.S., Caelli, T., Schuurmans, D., et al.: Graphical models and point pattern matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1646–1663 (2006)
Aiger, D., Kedem, K.: Approximate input sensitive algorithms for point pattern matching. Pattern Recognition, 153–159 (2010)
Fischer, B., Modersitzki, J.: Intensity based image registration with a guaranteed one-to-one point match. Methods of information in medicine, 327–330 (2004)
Modersitzki, J., Fischer, B.: Optimal image registration with a guaranteed one-to-one point match. In: Bildverarbeitung fr die Medizin, pp. 1–5. Springer, Heidelberg (2003)
Wang, H., Fei, B.: A robust B-Splines-based point match method for non-rigid surface registration. The 2nd International Conference on Bioinformatics and Biomedical Engineering, ICBBE 2008, pp. 2353–2356. IEEE (2008)
Dubuisson, M.P., Jain, A.K.: A modified hausdorff distance for object matching. In: Proceedings of the 12th IAPR International Conference on Pattern Recognition. -Conference A: Computer Vision and Image Processing, pp. 566–568. IEEE (1994)
Choi, O., Kweon, I.S.: Robust feature point matching by preserving local geometric consistency. Computer Vision and Image Understanding, 726–742 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, X., Han, C., Guo, T. (2015). A Robust Point Sets Matching Method. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9142. Springer, Cham. https://doi.org/10.1007/978-3-319-20469-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-20469-7_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20468-0
Online ISBN: 978-3-319-20469-7
eBook Packages: Computer ScienceComputer Science (R0)