Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012, Article ID 139014, 12 pages
http://dx.doi.org/10.1155/2012/139014
Research Article

Point Pattern Matching Algorithm for Planar Point Sets under Euclidean Transform

1College of Mathematics and Computer Science, Yangtze Normal University, Fuling, Chongqing 408100, China
2Department of Computer Science, Guangxi Normal University, Guilin 541004, China

Received 21 December 2011; Revised 2 March 2012; Accepted 3 March 2012

Academic Editor: Tak-Wah Lam

Copyright © 2012 Xiaoyun Wang and Xianquan Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. M. Griffin and C. Alexopoulos, “Point pattern matching using centroid bounding,” IEEE Transactions on Systems, Man and Cybernetics, vol. 19, no. 5, pp. 1274–1275, 1989. View at Publisher · View at Google Scholar · View at Scopus
  2. V. V. Vinod and S. Ghose, “Point matching using asymmetric neural networks,” Pattern Recognition, vol. 26, no. 8, pp. 1207–1214, 1993. View at Publisher · View at Google Scholar · View at Scopus
  3. S. D. Morgera and P. L. C. Cheong, “Rigid body constrained noisy point pattern matching,” IEEE Transactions on Image Processing, vol. 4, no. 5, pp. 630–641, 1995. View at Publisher · View at Google Scholar · View at Scopus
  4. W. H. Wang and Y. C. Chen, “Point pattern matching by line segments and labels,” Electronics Letters, vol. 33, no. 6, pp. 478–479, 1997. View at Google Scholar · View at Scopus
  5. S. H. Chang, F. H. Cheng, W. H. Hsu, and G. Z. Wu, “Fast algorithm for point pattern matching: invariant to translations, rotations and scale changes,” Pattern Recognition, vol. 30, no. 2, pp. 311–320, 1997. View at Google Scholar · View at Scopus
  6. H. Chui and A. Rangarajan, “New algorithm for non-rigid point matching,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '00), vol. 2, pp. 44–51, June 2000. View at Scopus
  7. M. Carcassoni and E. R. Hancock, “Spectral correspondence for point pattern matching,” Pattern Recognition, vol. 36, no. 1, pp. 193–204, 2003. View at Publisher · View at Google Scholar · View at Scopus
  8. L. Zhang, W. Xu, and C. Chang, “Genetic algorithm for affine point pattern matching,” Pattern Recognition Letters, vol. 24, no. 1–3, pp. 9–19, 2003. View at Publisher · View at Google Scholar · View at Scopus
  9. P. B. Van Wamelen, Z. Li, and S. S. Iyengar, “A fast expected time algorithm for the 2-D point pattern matching problem,” Pattern Recognition, vol. 37, no. 8, pp. 1699–1711, 2004. View at Publisher · View at Google Scholar · View at Scopus
  10. B. Li, Q. Meng, and H. Holstein, “Similarity K-d tree method for sparse point pattern matching with underlying non-rigidity,” Pattern Recognition, vol. 38, no. 12, pp. 2391–2399, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Y. Yin, “Particle swarm optimization for point pattern matching,” Journal of Visual Communication and Image Representation, vol. 17, no. 1, pp. 143–162, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Bishnu, S. Das, S. C. Nandy, and B. B. Bhattacharya, “Simple algorithms for partial point set pattern matching under rigid motion,” Pattern Recognition, vol. 39, no. 9, pp. 1662–1671, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. T. S. Caetano, T. Caelli, D. Schuurmans, and D. A. C. Barone, “Graphical models and point pattern matching,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp. 1646–1662, 2006. View at Publisher · View at Google Scholar · View at Scopus
  14. J. J. McAuley, T. S. Caetano, and M. S. Barbosa, “Graph rigidity, cyclic belief propagation, and point pattern matching,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 11, pp. 2047–2054, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. B. Li, Q. Meng, and H. Holstein, “Articulated motion reconstruction from feature points,” Pattern Recognition, vol. 41, no. 1, pp. 418–431, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Bhowmick, R. K. Pradhan, and B. B. Bhattacharya, “Approximate matching of digital point sets using a novel angular tree,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no. 5, pp. 769–782, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. D. Aiger and K. Kedem, “Geometric pattern matching for point sets in the plane under similarity transformations,” Information Processing Letters, vol. 109, no. 16, pp. 935–940, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. D. Aiger and K. Kedem, “Approximate input sensitive algorithms for point pattern matching,” Pattern Recognition, vol. 43, no. 1, pp. 153–159, 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. A. G. Percus and O. C. Martin, “Scaling universalities of kth-nearest neighbor distances on closed manifolds,” Advances in Applied Mathematics, vol. 21, no. 3, pp. 424–436, 1998. View at Publisher · View at Google Scholar · View at Scopus