Point pattern matching algorithm for planar point sets under Euclidean transform (Q442791): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2012/139014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092145631 / rank | |||
Normal rank | |||
Revision as of 18:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Point pattern matching algorithm for planar point sets under Euclidean transform |
scientific article |
Statements
Point pattern matching algorithm for planar point sets under Euclidean transform (English)
0 references
6 August 2012
0 references
Summary: 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.
0 references
