CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2009 vol.31 Issue No.05 - May

Subscribe

Issue No.05 - May (2009 vol.31)

pp: 769-782

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.

INDEX TERMS

Approximate matching, circular range query, digital geometry, point set pattern matching, polygonal range query.

CITATION

Partha Bhowmick, Bhargab Bhattacharya, "Approximate Matching of Digital Point Sets Using a Novel Angular Tree",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol.31, no. 5, pp. 769-782, May 2009, doi:10.1109/TPAMI.2007.70812REFERENCES

- [1] P.K. Agarwal and J. Erickson, “Geometric Range Searching and Its Relatives,”
Advances in Discrete and Computational Geometry, B.Chazelle, J. Goodman, and R. Pollack, eds., pp. 1-56, Am. Math. Soc., 1998.- [2] H. Alt and L.J. Guibas, “Discrete Geometric Shapes: Matching, Interpolation, and Approximation—A Survey,”
Report B 96-11, Freie Universität, 1996.- [6] E.M. Arkin, K. Kedmen, J.S.B. Mitchell, J. Sprinzak, and Werman, “Matching Points into Pair-Wise Disjoint Noise Regions: Combinatorials Bounds and Algorithms,”
ORSA J. Computing, vol. 4, no. 4, pp. 375-386, 1992.- [7] M.D. Atkinson, “An Optional Algorithm for Geometric Congruence,”
J. Algorithms, vol. 8, pp. 159-172, 1998.- [9] H.S. Baird, “Model-Based Image Matching Using Location,” MIT Press, 1985.
- [12] M.D. Berg, M.V. Kreveld, M. Overmars, and O. Schwarzkopf,
Computational Geometry Algorithms and Applications. Springer, 2000.- [14] P. Bhowmick and B.B. Bhattacharya, “Approximation of Digital Circles by Regular Polygons,”
Proc. Int'l Conf. Advances in Pattern Recognition, pp. 257-267, 2005.- [15] P. Bhowmick, A. Bishnu, B.B. Bhattacharya, M.K. Kundu, C.A. Murthy, and T. Acharya, “Determination of Minutiae Scores for Fingerprint Image Applications,”
Int'l J. Image and Graphics, vol. 5, pp. 1-35, 2005.- [16] A. Bishnu, S. Das, S.C. Nandy, and B.B. Bhattacharya, “An Improved Algorithm for Point Set Pattern Matching Under Rigid Motion,”
Proc. Fifth Italian Conf. Algorithms and Complexity, pp. 36-45, 2003.- [19] T.H. Cormen, C.E. Leiserson, and R.L. Rivest,
Introduction to Algorithms. Prentice Hall of India, 2000.- [22] A. Erafat and A. Itai, “Improvements on Bottleneck Matching and Related Problems Using Geometry,”
Proc. 12th Ann. ACM Symp. Computational Geometry, pp. 301-310, 1996.- [23] P.W. Finn, L.E. Kavraki, J. Latombe, R. Motwani, C.R. Shelton, S. Venkatasubramanian, and A. Yao, “RAPID: Randomized Pharmacophore Identification for Drug Design,”
Proc. Symp. Computational Geometry, pp. 324-333, 1997.- [24] J.D. Foley, A. van Dam, S.K. Feiner, and J.F. Hughes,
Computer Graphics—Principles and Practice. Addison-Wesley, 1993.- [25] M. Gleicher, “Animation from Observation: Motion Capture and Motion Editing,”
Computer Graphics, vol. 33, no. 4, pp. 51-55, 1999.- [26] M.T. Goodrich, J.B. Mitchel, and M.W. Orletsky, “Practical Methods for Approximate Geometric Pattern Matching Under Rigid Motion,”
Proc. 10th Ann. ACM Symp. Computational Geometry, pp. 103-113, 1994.- [27] M. Hagedoorn and R.C. Veltkamp, “Reliable and Efficient Pattern Matching Using an Affine Invariant Metric,”
Int'l J. Computer Vision, vol. 31, nos. 2/3, pp. 203-225, 1999.- [28] R.M. Haralick, “A Measure for Circularity of Digital Figures,”
IEEE Trans. Systems, Man, and Cybernetics, vol. 4, pp. 394-396, 1974.- [36] P. Indyk, R. Motwani, and S. Venkatasubramanian, “Geometric Matching under Noise: Combinatorial Bounds and Algorithm,”
Proc. 10th Ann. SIAM-ACM Symp. Discrete Algorithms, 1999.- [37] A. Jobbágy, E. Furnée, B. Romhányi, L. Gyöngy, and G. Soós, “Resolution and Accuracy of Passive Marker-Based Motion Analysis,”
Automatika, vol. 40, pp. 25-29, 1999.- [38] R. Klette and A. Rosenfeld,
Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, 2004.- [39] B. Li and H. Holstein, “Using k-d Trees for Robust 3D Point Pattern Matching,”
Proc. Fourth Int'l Conf. 3-D Digital Imaging and Modeling, 2003.- [42] D. Maltoni, D. Maio, A.K. Jain, and S. Prabhakar,
Handbook of Fingerprint Recognition. Springer, 2003.- [44] D. Mount, N. Netanyahu, and J. Lemoigne, “Improved Algorithms for Robust Point Pattern Matching and Applications to Image Registration,”
Proc. 14th Ann. ACM Symp. Computational Geometry, pp. 155-164, 1998.- [48] B. Soifman, D. Beymer, P. McLauchlan, and J. Malik,
A Real-Time Computer Vision System for Vehicle Tracking and Traffic Surveillance, http://www.cs.berkeley.edu/pmRoadWatch, 2004.- [49] I. Szekely, “Crossing Numbers and Hard Erdös Problems in Discrete Geometry,”
Combinatorics, Probability, and Computing, vol. 6, pp. 36-47, 1997.- [51] G. Tian, D. Gledhill, and D. Taylor, “Comprehensive Interest Points Based Imaging Mosaic,”
Pattern Recognition Letters, vol. 24, pp. 1171-1179, 2003. |