A Triangle Division Based Point Matching for Image Registration

Jian Chen; Dan  Zeng; Chen Kang; Zhi Jiang Zhang

doi:10.4028/www.scientific.net/AMR.765-767.726

Paper Titles

On the Partial Stochastic Stability of Stochastic Differential Delay Equations with Markovian Switching
p.709

Credibility Evaluation of Simulation Models
p.713

A Research on Improving of Adaptive Binary Arithmetic Coding Algorithm in H.264
p.717

Object Tracking Based on Corrected Background-Weighted Histogram Mean Shift and Kalman Filter
p.720

A Triangle Division Based Point Matching for Image Registration
p.726

Cheeger Cut Model for the Balanced Data Classification Problem
p.730

Improved Term Selection Algorithm Based on Variance in Text Categorization
p.735

Existence of High Energy Solutions for Kirchhoff-Type Equations
p.739

The Lower Bound of Density Estimation for Biased Data in Sobolev Spaces
p.744

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 765-767A Triangle Division Based Point Matching for Image...

A Triangle Division Based Point Matching for Image Registration

Abstract:

One basic requirement of image registration is the high precision of point matching. In this paper, we present a simple and robust method to get more accurate matching points by using the structural information of divided triangles. The method initially construct triangles using Delaunay Triangulation which considering rough matched points as vertices, and then iteratively removes outliers until obtain the consensus topology structure. An algorithm called K-Nearest Neighbor Dis-ratio is also presented to avoiding mismatches. Compared with RANSAC and GTM, Our proposed method acquires more inliers and demonstrates higher matching accuracy.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

726-729

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.765-767.726

Citation:

Cite this paper

Online since:

September 2013

Authors:

Jian Chen, Dan Zeng, Chen Kang, Zhi Jiang Zhang

Keywords:

Delaunay Based Triangulation, Feature Matching, Image Registration, Topology Based Matching

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10(5), pp.695-703, (1988).

DOI: 10.1109/34.6778

Google Scholar

[2] W. Aguilar, Y. Frauel, F. Escolano, M. E. Martinez-Perez, A. Espinosa-Romero, and M. A. Lozano. A robust Graph Transformation Matching for non-rigid registration. Image and Vision Computing, vol. 27(7), pp.897-910, (2009).

DOI: 10.1016/j.imavis.2008.05.004

Google Scholar

[3] Z. Liu and Z. Liu. A robust point matching algorithm for image registration. In Proc. 3rd Int. Conf. Mach. Vis., pp.66-70, (2010).

Google Scholar

[4] K. Mikolajczyk, C. Schmid. A performance evaluation of local descriptors, IEEE Trans. Pattern Anal. Mach. Intell. Vol. 27(10), pp.1615-1630, (2005).

DOI: 10.1109/tpami.2005.188

Google Scholar

[5] D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, vol. 60(2), pp.91-110, (2004).

DOI: 10.1023/b:visi.0000029664.99615.94

Google Scholar