A Tensor-based algorithm for high-order graph matching

2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009

Volumn , Issue , 2009, Pages 1980-1987

  Duchenne, Olivier ^a,d   Bach, Francis ^a,b,d   Kweon, Inso ^c   Ponce, Jean ^a,d  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b INRIA   (France)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^d CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; PATTERN MATCHING; TENSORS;

CLASSICAL METHODS; MATCHING PROBLEMS; MULTI DIMENSIONAL; OBJECTIVE FUNCTIONS; RELAXED PROBLEM; SPECTRAL TECHNIQUES; SYNTHETIC AND REAL DATA; VISUAL FEATURE;

GRAPH ALGORITHMS;

EID: 70450161264     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2009.5206619     Document Type: Conference Paper

References (28)

1. P-A Absil, R. Mahony, and R. Sepulchre. Optimization Algorithms on Matrix Manifolds. Princeton Univ. Press, 2008.
2. H. A. Almohamad and S. O. Duffuaa. A linear programming approach for the weighted graph matching problem. IEEE PAMI, 15, 1993.
3. D.H. Ballard and C.M. Brown. Computer Vision. Prentice-Hall, Englewood Cliffs, NJ, 1982.
4. A. C. Berg, T. L. Berg, and J. Malik. In Shape Matching and Object Recognition Using Low Distortion Correspondences, 2005.
5. S. Birchfield. KLT: An implementation ofthe KanadeLucas- Tomasi feature tracker, 1998.
6. T. Caetano, L. Cheng, Q. V. Le, and A J. Smola. Learning graph matching. In ICCV, 2007.
7. T. Cour, P Srinivasan, and J. Shi. Balanced graph matching. In NIPS 19.2007.
8. M. Fischler and R. Bolles. Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography. Comm. of the ACM, 24(6):381-395, 1981.
9. G. H. Golub and C. F. Van Loan. Matrix computations (3rd ed.). Johns Hopkins University Press, 1996.
10. G. Griffin, A Holub, and P Perona. Caltech-256 object category dataset. Technical Report 7694, California Institute of Technology, 2007.
11. W.E.L. Grimson and T. Lozano-Perez. Localizing overlapping parts by searching the interpretation tree. PAMI, 9(4):469-482, 1987.
12. D.P. Huttenlocher and S. Ullman. Object recognition using alignment. In ICCV, 1987.
13. 3 and beyond: Solving energies with higher order cliques. CVPR, 2007.
14. L. De Lathauwer, B. De Moor, and J. Vandewalle. On the best rank-I and rank-(rl, r2, ., rn) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl., 21(4):1324-1342, 2000.
15. S. Lazebnik, C. Schmid, and J. Ponce. Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories. In CVPR, 2006.
16. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, 2005.
17. M. Leordeanu, M. Hebert, and R. Sukthankar. Beyond local appearance: Category recognition from pairwise interactions of simple features. In CVPR, 2007.
18. D. Lowe. Distinctive image features from scaleinvariant keypoints. IJCV, 60(4):91-110, 2004.
19. J. Maciel and J. Costeira. A global solution to sparse correspondence problems. PAMI, 25(2), 2003.
20. R. Oliveira, R. Ferreira, and J. Costeira. Optimal multi-frame correspondence with assignment tensors. In Proc. European Con! Compo Vision, 2006.
21. P. Pritchett and A. Zisserman. Wide baseline stereo matching. In ICCV, 1998.
22. P. A Regalia and E. Kofidis. The higher-order power method revisited: convergence proofs and effective initialization. ICASSP, 2000.
23. C. Schmid and R. Mohr. Local grayvalue invariants for image retrieval. PAMI, 19(5):530-535, 1997.
24. S. Umeyama. An eigendecomposition approach to weighted graph matching problems. PAMI, 10(5):695-703, 1988.
25. Ron Zass and Amnon Shashua. Probabilistic graph and hypergraph matching. CVPR, 2008.
26. H. Zhang, AC. Berg, M. Maire, and J. Malik. SVMKNN: Discriminative nearest neighbor classification for visual category recognition. In CVPR, 2006.
27. J. Zhang, M. Marszalek, S. Lazebnik, and C. Schmid. Local features and kernels for classifcation of texture and object categories: An in-depth study. Int. J. of Compo Vision, 73(2):213-238, 2007.
28. Y. Zheng and D. Doermann. Robust point matching for nonrigid shapes by preserving local neighborhood structures. PAMI, 28(4):643, 2006.