 Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scaleZhenjun Tang, Xianquan Zhang, Chunqiang Yu and Dan He Applied Mathematics and Computation, 2014, vol. 232, issue C, 624-631 Abstract: Point pattern matching is an important topic in computer vision and pattern recognition, and finds many applications such as image registration, motion detection, object tracking and pose estimation. In this paper, we propose an efficient algorithm for determining correspondence between two planar point sets under transform of translation, rotation and scale. This algorithm randomly selects some points of a set and extracts their neighbor points. It views the selected points and their neighbor points as local point patterns, and finds the local matched patterns in the other set. Point pattern matching is finally achieved by counting the unique point number of those local matched point patterns with the same transform parameters. Many experiments are conducted to validate efficiency of the proposed algorithm. Running time comparisons with a well-known point pattern matching algorithm are also done and the results show that the proposed algorithm is faster than the compared algorithm. Keywords: Point pattern matching; Point set matching; Matched points; Rotation; Included angle (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:232:y:2014:i:c:p:624-631 DOI: 10.1016/j.amc.2014.01.087 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.