A robust point sets matching method

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Liu, X., Han, C., & Guo, T. (2015). A robust point sets matching method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9142, pp. 383–390). Springer Verlag. https://doi.org/10.1007/978-3-319-20469-7_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free