A Robust Point Sets Matching Method

11/04/2014
by   Xiao Liu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2017

Path-following based Point Matching using Similarity Transformation

To address the problem of 3D point matching where the poses of two point...
research
10/22/2019

Deep Set-to-Set Matching and Learning

Matching two sets of items, called set-to-set matching problem, is being...
research
05/13/2019

FPGA-based Binocular Image Feature Extraction and Matching System

Image feature extraction and matching is a fundamental but computation i...
research
04/14/2015

Clustering Assisted Fundamental Matrix Estimation

In computer vision, the estimation of the fundamental matrix is a basic ...
research
05/03/2000

Robustness of Regional Matching Scheme over Global Matching Scheme

The paper has established and verified the theory prevailing widely amon...
research
07/05/2020

Aligning Partially Overlapping Point Sets: an Inner Approximation Algorithm

Aligning partially overlapping point sets where there is no prior inform...
research
01/19/2021

Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets

Alignment methods which can handle partially overlapping point sets and ...

Please sign up or login with your details

Forgot password? Click here to reset