Abstract
AbstractThis paper presents an algorithm for finding a matching between two point patterns given in m‐dimensional Euclidean space. The point pattern matching algorithm here is formulated as a tree search procedure, and the search tree is pruned by a specified tolerance measure for matching. The proposed method is based on the locations of points and is invariant to rotation, translation, and scaling. Moreover, to guide the search, it is easy to use global geometric constraints, such as rotation or scaling parameters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
