Learning graph matching

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2007, Pages

  Caetano, Tibério S ^a   Cheng, Li ^a   Le, Quoc V ^a   Smola, Alex J ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL GEOMETRY; COMPUTER NETWORKS; COMPUTER VISION; EDGE DETECTION; EDUCATION; FEATURE EXTRACTION; IMAGE PROCESSING; NUCLEAR PROPULSION; PATTERN MATCHING; PATTERN RECOGNITION; QUADRATIC PROGRAMMING; TRAVELING SALESMAN PROBLEM;

GRAPH MATCHING;

LEARNING ALGORITHMS;

EID: 50649124855     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2007.4408838     Document Type: Conference Paper

References (19)

1. CMU 'house' data dataset: set: http://vasc.ri.cmu.edu/idb/html/motion/ house/index.html.
2. CMU 'hotel' dataset: http://vasc.ri.cmu.edu/idb/html/motion/hotel/index. html.
3. K. Anstreicher Anstreicher. Recent advances in the solution of quadratic assignment problems. Math. Program., Ser. B, 2003.
4. S. Belongie, J. Malik, and J. Puzicha. Shape matching and object recognition using shape contexts. PAMI, 2002.
5. T. S. Caetano, T. Caelli, and D. A. C. Barone. Graphical models for graph matching. In CVPR, 2004.
6. T. S. Caetano, T. Caelli, D. Schuurmans, and D. A. C. Barone. Graphical models and point pattern matching. PAMI, 2006.
7. W. J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. PAMI, 1994.
8. T. Cour, P. Srinivasan, and J. Shi. Balanced graph matching. In NIPS, 2006.
9. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. PAMI, 1996.
10. E. Hancock and R. C. Wilson. Graph-based methods for vision: sion: A yorkist manifesto. SSPR & SPR 2002, 2002.
11. R. Jonker and A. Volgenant. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 1987.
12. S. Lacoste-Julien, B. Taskar, D. Klein, and M. Jordan. Word alignment via quadratic assignment. In HLT-NAACL06, 2006.
13. M. Leordeanu and M. Hebert. A spectral technique for correspondence problems using pairwise constraints. In ICCV, 2005.
14. D. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 2004.
15. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, New Jersey, 1982.
16. M. Pelillo and M. Refice. Learning compatibility coefficients for relaxation labeling processes. PAMI, 1994.
17. C. Schellewald. Convex mathematical programs for relational matching of object views. PhD thesis, University of Mannhein, 2004.
18. L. Shapiro and J. Brady. Feature-based correspondence - an eigenvector approach. IVC, 1992.
19. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. JMLR, 2005.