Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform
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 com...
Saved in:
Main Authors: | Xiaoyun Wang, Xianquan Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/139014 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Approximation of planar point sets by point configurations
by: V. Yu. Yurkov
Published: (2023-06-01) -
A Boundary Construction Algorithm for a Complex Planar Point Set
by: Zhenxiu Liao, et al.
Published: (2021-01-01) -
On the Set of Fixed Points and Periodic Points of Continuously Differentiable Functions
by: Aliasghar Alikhani-Koopaei
Published: (2013-01-01) -
Magnifying Elements in Semigroups of Fixed Point Set Transformations Restricted by an Equivalence Relation
by: Thananya Kaewnoi, et al.
Published: (2021-01-01) -
Point-valued mappings of sets
by: Matt Insall
Published: (1995-01-01)