Optimizing binary MRFs via extended roof duality

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2007, Pages

  Rother, Carsten ^a   Kolmogorov, Vladimir ^b   Lempitsky, Victor ^c   Szummer, Martin ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

^c MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

DECONVOLUTION; GLOBAL OPTIMIZATION; GRAPH THEORY; IMAGE SEGMENTATION; LEARNING SYSTEMS; PARAMETER ESTIMATION; SIMULATED ANNEALING;

DIAGRAM RECOGNITION; EXTENDED ROOF DUALITY; THEORETICAL CHARACTERIZATIONS;

COMPUTER VISION;

EID: 34948910691     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2007.383203     Document Type: Conference Paper

References (23)

1. J. E. Beasley. Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical report, Management School, Imperial College, London, UK, 1998.
2. E. Boros and P. L. Hammer. Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1-3):155 -225, 2002.
3. E. Boros, P. L. Hammer, and X. Sun. Network flows and minimization of quadratic pseudo-Boolean functions. Technical Report RRR 17-1991, RUTCOR, May 1991.
4. E. Boros, P. L. Hammer, and G. Tavares. Local search heuristics for unconstrained quadratic binary optimization. Technical Report RRR 9-2005, RUTCOR, Feb. 2005.
5. E. Boros, P. L. Hammer, and G. Tavares. Preprocessing of unconstrained quadratic binary optimization. Technical Report RRR 10-2006, RUTCOR, Apr. 2006.
6. Y Boykov and M.-P. Jolly. Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In ICCV, 2001.
7. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. PAMI, 26(9), Sept. 2004.
8. Y Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, 23(11), Nov. 2001.
9. D. Cremers and L. Grady. Learning statistical priors for efficient combinatorial optimization via graph cuts, ECCV 06.
10. A. W. Fitzgibbon, Y. Wexler, and A. Zisserman. Image-based rendering using image-based priors. In ICCV, 2003.
11. W. Freeman, E. Pasztor, and O. Carmichael. Learning lowlevel vision. IJCV, 40(1):24-57, 2000.
12. P. L. Hammer, P. Hansen, and B. Simeone. Roof duality, complementation and persistency in quadratic 0-1 optimization. Mathematicl Programming, 28:121-155, 1984.
13. P. Kohli and P. H. S. Torr. Efficiently solving dynamic Markov random fields using graph cuts. In ICCV, Oct. 2005.
14. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. RAMI, 28(10), Oct. 2006.
15. V. Kolmogorov and C. Rother. Minimizing non-submodular functions with graph cuts - a review. PAMI, 2007. To appear. Online version at http://research.microsoft.com/~carrot.
16. V.Kolmogorov and M. Wainwright. On the optimality of treereweighted max-product message passing. In UAI, 2005.
17. E. Mortensen and W. Barrett. Intelligent scissors for image composition. SIGGRAPH, 1995.
18. A. Raj, G. Singh, and R. Zabih. MRF's for MRI's: Bayesian reconstruction of MR images via graph cuts. In CVPR, 2006.
19. A. Raj and R. Zabih. A graph cut algorithm for generalized image deconvolution. In ICCV, 2005.
20. C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer. Optimizing binary MRFs via extended roof duality. Technical Report MSR-TR-2007-46, Microsoft Research, 2007.
21. C. Rother, S. Kumar, V. Kolmogorov, and A. Blake. Digital tapestry. In CVPR, 2005.
22. R. Szeliski et al. A comparative study of energy minimization methods for Markov random fields. In ECCV, 2006.
23. M. Szummer and Y. Qi. Contextual recognition of handdrawn diagrams with conditional random fields. In 9th Intl. Wkshp. Frontiers in Handwriting Recognition, 2004.