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: | , |
|---|---|
| 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!
|
| _version_ | 1832552223226200064 |
|---|---|
| author | Xiaoyun Wang Xianquan Zhang |
| author_facet | Xiaoyun Wang Xianquan Zhang |
| author_sort | Xiaoyun Wang |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-4eb8d76170c74e778c5964ca58bc4232 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-4eb8d76170c74e778c5964ca58bc42322025-02-03T05:59:18ZengWileyJournal of Applied Mathematics1110-757X1687-00422012-01-01201210.1155/2012/139014139014Point Pattern Matching Algorithm for Planar Point Sets under Euclidean TransformXiaoyun Wang0Xianquan Zhang1College of Mathematics and Computer Science, Yangtze Normal University, Fuling, Chongqing 408100, ChinaDepartment of Computer Science, Guangxi Normal University, Guilin 541004, ChinaPoint 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.http://dx.doi.org/10.1155/2012/139014 |
| spellingShingle | Xiaoyun Wang Xianquan Zhang Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform Journal of Applied Mathematics |
| title | Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform |
| title_full | Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform |
| title_fullStr | Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform |
| title_full_unstemmed | Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform |
| title_short | Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform |
| title_sort | point pattern matching algorithm for planar point sets under euclidean transform |
| url | http://dx.doi.org/10.1155/2012/139014 |
| work_keys_str_mv | AT xiaoyunwang pointpatternmatchingalgorithmforplanarpointsetsundereuclideantransform AT xianquanzhang pointpatternmatchingalgorithmforplanarpointsetsundereuclideantransform |