Fast matching of large point sets under occlusions

Pattern Recognition

Volumn 45, Issue 1, 2012, Pages 563-569

  McAuley, Julian J ^a,b   Caetano, Tibério S ^a,b  

^a CSIRO   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Global rigidity; Graphical models; Point pattern matching

Indexed keywords

EMBEDDINGS; EXACT SOLUTION; GLOBAL RIGIDITY; GRAPHICAL MODEL; POINT PATTERN MATCHING; POINT SET; TREE-WIDTH;

GEOMETRY; PATTERN MATCHING; RIGIDITY; SPEECH RECOGNITION;

GRAPHIC METHODS;

EID: 80052717416     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2011.05.008     Document Type: Article

References (26)

1. P.F. Felzenszwalb Representation and detection of deformable shapes IEEE Transactions on Pattern Analysis and Machine Intelligence 27 2 2005 208 220 (Pubitemid 40377314)
2. S. Belongie, J. Malik, and J. Puzicha Shape matching and object recognition using shape contexts IEEE Transactions on Pattern Analysis and Machine Intelligence 24 4 2002 509 522 (Pubitemid 34448769)
3. R.I. Hartley, and A. Zisserman Multiple View Geometry in Computer Vision 2004 Cambridge University Press
4. P. van Wamelen, Z. Li, and S. Iyengar A fast expected time algorithm for the 2-D point pattern matching problem Pattern Recognition 37 8 2004 1699 1711 (Pubitemid 38728583)
5. H. Chui, A. Rangarajan, A new algorithm for non-rigid point matching, in: CVPR, 2000, pp. 4451.
6. T. Akutsu, K. Kanaya, A. Ohyama, and A. Fujiyama Point matching under non-uniform distortions Discrete Applied Mathematics 127 1 2003 5 21
7. R. Nussinov, and H.J. Wolfson Efficient detection of three-dimensional structural motifs in biological macromolecules by computer vision techniques Proceedings of the National Academy of Sciences 88 1991 10495 10499 (Pubitemid 21915862)
8. Y. Martin, M. Bures, E. Danaher, J. DeLazzer, and I. Lico A fast new approach to pharmacophore mapping and its application to dopaminergic and bezodiazepine agonists Journal of Computer-Aided Molecular Design 7 1993 83 102
9. P.W. Finn, L.E. Lavraki, J.-C. Latombe, R. Motwani, C. Shelton, S. Venkatasubramanian, A. Yao, RAPID: Randomized pharmacophore indentification for drug design, in: Symposium on Computational Geometry.
10. F. Murtagh A new approach to point-pattern matching Astronomical Society of the Pacific 104 674 1992 301 307
11. H. Alt, L.J. Guibas, Discrete geometric shapes: matching, interpolation, and approximation: a survey, Technical Report, Handbook of Computational Geometry, 1996.
12. P.J. de Rezende, and D.T. Lee Point set pattern matching in d-dimensions Algorithmica 13 1995 387 404
13. H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl Congruence, similarity and symmetries of geometric objects Discrete Computational Geometry 3 3 1998 237 256
14. M.T. Goodrich, and J.S.B. Mitchell Approximate geometric pattern matching under rigid motions IEEE Transactions on Pattern Analysis and Machine Intelligence 21 4 1999 371 379
15. 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 28 10 2006 1646 1663
16. 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 30 11 2008 2047 2054
17. T.S. Caetano, and J.J. McAuley Faster graphical models for point-pattern matching Spatial Vision 22 5 2009 443 453
18. K. Anstreicher Recent advances in the solution of quadratic assignment problems Mathematical Programming 97 2003 27 42
19. S.M. Aji, and R.J. McEliece The generalized distributive law IEEE Transactions on Information Theory 46 2 2000 325 343
20. J.L. Bentley Multidimensional binary search trees used for associative searching Communications of the ACM 18 9 1975 509 517
21. T. Jordán, and Z. Szabadka Operations preserving the global rigidity of graphs and frameworks in the plane Computational Geometry 42 67 2009 511 521
22. M. Leordeanu, and M. Hebert A spectral technique for correspondence problems using pairwise constraints ICCV vol. 2 2005 1482 1489 (Pubitemid 44042353)
23. CMU 'house' dataset. [link]. URL 〈 http://vasc.ri.cmu.edu/idb/html/ motion/house/ 〉.
24. J. Yarkony, C. Fowlkes, A. Ihler, Covering trees and lower-bounds on quadratic assignment, in: CVPR, 2010, pp. 887894.
25. O. Duchenne, F. Bach, I. Kweon, J. Ponce, A tensor-based algorithm for high-order graph matching, in: CVPR, 2009, pp. 19801987.
26. M. Leordeanu, M. Hebert, Unsupervised learning for graph matching, in: CVPR, 2009, pp. 864871.