pith. machine review for the scientific record. sign in

arxiv: 1411.0791 · v1 · submitted 2014-11-04 · 💻 cs.CV

Recognition: unknown

A Robust Point Sets Matching Method

Authors on Pith no claims yet
classification 💻 cs.CV
keywords matchingmatrixmethodpointrobustsetsalgorithmsimilarity
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.