Feature correspondence via graph matching: Models and global optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5303 LNCS, Issue PART 2, 2008, Pages 596-609

  Torresani, Lorenzo ^a   Kolmogorov, Vladimir ^b   Rother, Carsten ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; GRAPH ALGORITHMS; NP-HARD; PATTERN MATCHING;

DUAL DECOMPOSITION; ENERGY MINIMIZATION PROBLEM; FEATURE CORRESPONDENCE; GRAPH-MATCHING ALGORITHMS; OBJECTIVE FUNCTIONS; SPATIAL ARRANGEMENTS; STATE-OF-THE-ART METHODS; TRAINING EXAMPLE;

GLOBAL OPTIMIZATION;

EID: 57149135436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88688-4_44     Document Type: Conference Paper

References (35)

1. Belhumeur, P.N.: A binocular stereo algorithm for reconstructing sloping, creased, and broken surfaces in the presence of half-occlusion. In: ICCV (May 1993)
2. Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: ICCV (2001)
3. Dorko, G., Schmid, C.: Selection of scale-invariant parts for object class recognition. In: ICCV (2003)
4. Sivic, J., Russell, B., Efros, A., Zisserman, A.: Discovering object categories in image collections. In: ICCV (2005)
5. Caetano, T.S., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. In: ICCV (2007)
6. Bertsekas, D.: Nonlinear Programming. Athena Scientific (1999)
7. Chardaire, P., Sutter, A.: A decomposition method for quadratic zero-one programming. Management Science 41(4), 704-712 (1995)
8. Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: MAP estimation via agreement on trees: Message-passing and linear-programming approaches. IEEE Trans. Information Theory 51(11) (2005)
9. Schlesinger, M.I., Giginyak, V.V.: Solution to structural recognition (MAX,+)-problems by their equivalent transformations. Part 1. Control Systems and Computers (1), 3-15 (2007)
10. Schlesinger, M.I., Giginyak, V.V.: Solution to structural recognition (MAX,+)-problems by their equivalent transformations. Part 2. Control Systems and Computers (2), 3-18 (2007)
11. Komodakis, N., Paragios, N., Tziritas, G.: MRF optimization via dual decomposition: Message-passing revisited. In: ICCV (2007)
12. Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS (2007)
13. Duchi, J., Tarlow, D., Elidan, G., Koller, D.: Using combinatorial optimization within maxproduct belief propagation. In: NIPS (2007)
14. Belongie, S.J., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. PAMI 24(4), 509-522 (2002)
15. Torr, P.H.S.: Geometric motion segmentation and model selection. Philosophical Transactions of the Royal Society, 1321-1340 (1998)
16. Sclaroff, S., Pentland, A.:Modal matching for correspondence and recognition. PAMI 17(6), 545-561 (1997)
17. Berg, A., Berg, T., Malik, J.: Shape matching and object recognition using low distortion correspondence. In: CVPR (2005)
18. Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV (2005)
19. Torr, P.H.S.: Solving Markov random fields using semi definite programming. In: AISTATS (2003)
20. Liu, C.K., Hertzmann, A., Popovíc, Z.: Learning physics-based motion style with nonlinear inverse optimization. ACM Trans. on Gr. 24(3), 1071-1081 (2005)
21. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. of Pattern Recognition and Artificial Intelligence 18(3), 265-298
22. Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. PAMI 18(4), 377-388 (1996)
23. Maciel, J., Costeira, J.: A global solution to sparse correspondence problems. PAMI 25(2), 187-199 (2002)
24. Cabot, A., Francis, R.: Solving certain nonconvex quadratic minimization problems by ranking the extreme points. Operations Research 18(1), 82-86 (1970)
25. Schellewald, C., Schnörr, C.: Probabilistic subgraph matching based on convex relaxation. In: EMMCVPR (2005)
26. Shor, N.Z.: Minimization methods for nondifferentiable functions. Springer, Heidelberg (1985)
27. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
28. Boros, E., Hammer, P.: Pseudo-boolean optimization. Discr. Appl. Math. 123(1-3) (2002)
29. Hammer, P.L., Hansen, P., Simeone, B.: Roof duality, complementation and persistency in quadratic 0-1 optimization. Mathematicl Programming 28, 121-155 (1984)
30. Torresani, L., Kolmogorov, V., Rother, C.: Feature correspondence via graph matching: Models and global optimization. Technical Report MSR-TR-2008-101 (2008)
31. Boros, E., Hammer, P.L., Sun, X.: Network flows and minimization of quadratic pseudoBoolean functions. Technical Report RRR 17-1991, RUTCOR (May 1991)
32. Lempitsky, V., Rother, C., Blake, A.: LogCut - efficient graph cut optimization for Markov random fields. In: ICCV (2007)
33. Rother, C., Kolmogorov, V., Lempitsky, V., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: CVPR (2007)
34. Elidan, G., McGraw, I., Koller, D.: Residual belief propagation: Informed scheduling for asynchronous message passing. In: UAI (2006)
35. LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proceedings of the IEEE 86(11), 2278-2324 (1998)