Open Access
Translator Disclaimer
2012 Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform
Xiaoyun Wang, Xianquan Zhang
J. Appl. Math. 2012: 1-12 (2012). DOI: 10.1155/2012/139014

Abstract

Point pattern matching is an important topic of computer vision and pattern recognition. In this paper, we propose a point pattern matching algorithm for two planar point sets under Euclidean transform. We view a point set as a complete graph, establish the relation between the point set and the complete graph, and solve the point pattern matching problem by finding congruent complete graphs. Experiments are conducted to show the effectiveness and robustness of the proposed algorithm.

Citation

Download Citation

Xiaoyun Wang. Xianquan Zhang. "Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform." J. Appl. Math. 2012 1 - 12, 2012. https://doi.org/10.1155/2012/139014

Information

Published: 2012
First available in Project Euclid: 14 December 2012

zbMATH: 1244.68068
MathSciNet: MR2923348
Digital Object Identifier: 10.1155/2012/139014

Rights: Copyright © 2012 Hindawi

JOURNAL ARTICLE
12 PAGES


SHARE
Vol.2012 • 2012
Back to Top