 |
| Research article summary (published 29 Apr 2009): |
Approximate matching of digital point sets using a novel angular tree.
Full Abstract
Matching and analysis of patterns or shapes in the digital plane are of utmost importance in various problems of computer vision and pattern recognition. A digital point set is such a pattern that corresponds to an object in the digital plane. Although there exist several data structures that can be employed for Approximate Point Set Pattern Matching (APSPM) in the real domain, they require substantial modification to support algorithms in the digital domain. To bridge this gap, a novel data structure called "angular tree" is proposed, targeting an efficient and error-controllable circular range query in the digital plane. The farthest pair of points may be used as the starting correspondence between the pattern set and the background set. Several classical discrete structures and methodologies of computational geometry, as well as some topological features of circles/discs in digital geometry, have been used in tandem, for successful realization of the proposed APSPM algorithm in the digital plane. The APSPM algorithm based on the angular tree has been implemented and tested on various point sets and the reported results demonstrate the efficiency and versatility of the new data structure for supporting APSPM algorithms.
Author information
Author/s: Bhowmick, Partha (P); Bhattacharya, Bhargab (B);
Affiliation: Computer Science and Engineering Department, Indian Institute of Technology, Kharagpur, India 721302, USA. bhowmick(-atsign-)gmail.com
Journal and publication information
Publication Type: Journal Article
Journal: IEEE transactions on pattern analysis and machine intelligence (IEEE Trans Pattern Anal Mach Intell), published in United States. (Language: eng)
Reference: 2009-May; vol 31 (issue 5) : pp 769-82
Dates: Created 2009/03/20; Completed 2009/06/10;
PMID: 19299854, status: MEDLINE (last retrieval date: 6/10/2009, IMS Date: 10 Jun 2009 00:00:00)
Sourced from the National Library of Medicine. Abstract text and other information may be subject to copyright.
External Links for this article
(including full text providers, if available):
Click Electronic Full-text Provider Links to see options for finding the electronic full text links to this article. Note there may be a subscription or fee required for access to the full text. See our FAQ for information on finding FREE full text articles.
This article may also be located in paper journal collections available in many libraries. Use the Journal and Publication Information above to find the full article.
MeSH headings (categories)
This article was linked to the MESH Headings shown below.
Related articles
This article has not been indexed for related articles as yet, however you can still use the live related article search links below.
See a large map of 100+ related articles.