Solving multilabel graph cut problems with multilabel swap

DICTA 2009 - Digital Image Computing: Techniques and Applications

Volumn , Issue , 2009, Pages 532-539

  Carr, Peter ^a   Hartley, Richard ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Graph cuts; Labelling; Markov random field; Optimization

Indexed keywords

APPROXIMATE SOLUTION; DE-NOISING; ENERGY FUNCTIONS; EXACT SOLUTION; GRAPH CONSTRUCTION; GRAPH CUT; MARKOV RANDOM FIELDS; MEMORY REQUIREMENTS; MULTI-LABEL; TRIANGLE INEQUALITY;

IMAGE SEGMENTATION;

EID: 77950316448     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DICTA.2009.90     Document Type: Conference Paper

References (19)

1. Y. Boykov, O. Veksler, and R. Zabih, "Fast approximate energy minimization via graph cuts," PAMI, vol.23, no.11, pp. 1222-1239, 2001.
2. E. Boros and P. L. Hammer, "Pseudo-boolean optimization," Discrete Applied Mathematics, vol.123, no.1-3, pp. 155-225, 2002.
3. C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer, "Optimizing binary MRFs via extended roof duality," in CVPR, 2007.
4. P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, and P. H. S. Torr, "On partial optimality in multi-label MRFs," in ICML, 2008.
5. H. Ishikawa, "Exact optimization for markov random fields with convex priors," PAMI, vol.25, no.10, pp. 1333-1336, 2003.
6. D. Schlesinger and B. Flach, "Transforming an arbitrary minsum problem into a binary one," Dresden University of Technology, Tech. Rep. TUD-FI06-01, 2006.
7. J. Darbon, "Global optimization for first order markov random fields with submodular priors," in International Workshop on Combinatorial Image Analysis, 2008.
8. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother, "A comparitive study of energy minimization methods for markov random fields with smoothness-based priors," PAMI, vol.30, no.6, pp. 1068-1080, 2008.
9. S. Z. Li, Markov Random Field Modeling in Image Analysis. Springer-Verlag, 2001.
10. V. Kolmogorov and R. Zabih, "What energy functions can be minimized via graph cuts?" PAMI, vol.26, no.2, pp. 147-159, 2004.
11. P. Kohli, M. P. Kumar, and P. H. S. Torr, "P3 & beyond: Solving energies with higher order cliques," in CVPR, 2007.
12. O. Veksler, "Graph cut based optimization for MRFs with truncated convex priors," in CVPR, 2007.
13. A. Zureiki, M. Devy, and R. Chatila, "Stereo matcing using reduced graph cuts," in ICIP, 2007.
14. V. Lempitsky, C. Rother, and A. Blake, "Logcut - efficient graph cut optimization for markov random fields," in ICCV, 2007.
15. S. Gould, F. Amat, and D. Koller, "Alphabet soup: A framework for approximate energy minimization," in CVPR, 2009.
16. P. Kohli and P. H. S. Torr, "Dynamic graph cuts for efficient inference in markov random fields," PAMI, vol.29, no.12, pp. 2079-2088, 2007.
17. R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision (Second Edition). Cambridge University Press, 2003.
18. M. Brown, D. Burschka, and G. D. Hager, "Advances in computational stereo," PAMI, vol.25, no.8, pp. 993-1008, 2003.
19. D. Scharstein and R. Szeliski, "A taxonomy and evaluation of dense two-frame stereo correspondence algorithms," IJCV, 2002.