Half-integrality based algorithms for cosegmentation of images

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

Volumn , Issue , 2009, Pages 2028-2035

  Mukherjee, Lopamudra ^c   Singh, Vikas ^a,b   Dyer, Charles R ^a,b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b University of Wisconsin Madison   (United States)

^c UNIVERSITY OF WISCONSIN WHITEWATER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; GRAPHIC METHODS; MAGNETORHEOLOGICAL FLUIDS; MARKOV PROCESSES; TEXTURES;

CO SEGMENTATIONS; COMBINATORIAL PROPERTIES; CONSISTENCY REQUIREMENTS; MARKOV RANDOM FIELDS; OPTIMIZATION MODELING; RELAXATION STRATEGIES; SEGMENTED REGIONS; TEXTURE FEATURES;

IMAGE SEGMENTATION;

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

References (26)

1. C. Rother, T. Minka, A. Blake, and V. Kolmogorov. Cosegmentation of image pairs by histogram matching - incorporating a global constraint into MRFs. In Proc. of Conf. on Computer Vision and Pattern Recognition, 2006.
2. D. S. Cheng and Mario A. T. Figueiredo. Cosegmentation for image sequences. In Proc. of International Conf. on Image Anal. and Processing, 2007.
3. L. Cao and L. Fei-Fei. Spatially coherent latent topic model for concurrent object segmentation and classification. In Proc. of International Conf. on Computer Vision, 2007.
4. J. Sun, S.B. Kang, Z.B. Xu, X. Tang, and H.Y. Shum. Flash Cut: Foreground Extraction with Flash and No-flash Image Pairs. In Proc. of Conf. on Computer Vision and Pattern Recognition, 2008.
5. T. Cootes, C. Taylor, D. Cooper, and J. Graham. Active shape models - their training and applications. Computer Vision and Image Understanding, 61(1):38 - 59, 1995.
6. E. Borenstein, E. Sharon, and S. Ullman. Combining topdown and bottom-up segmentation. In Proc. of Conf. on Computer Vision and Pattern Recognition, 2004.
7. S. Yu and J. Shi. Object-specific figure-ground segmentation. In Proc. of Conf. on Computer Vision and Pattern Recognition, 2003.
8. S. X. Yu, R. Gross, and J. Shi. Concurrent object recognition and segmentation by graph partitioning. In Advances in Neural Information Processing Systems, 2002.
9. T. Riklin-Raviv, N. Kiryati, and N. Sochen. Prior-based segmentation by projective registration and level sets. In Proc. of International Conf. on Computer Vision, 2005.
10. J. Winn and N. Jojic. Locus: Learning object classes with unsupervised segmentation. In Proc. of International Conf. on Computer Vision, 2005.
11. E. Borenstein and S. Ullman. Learning to segment. In Proc. of European Conf. on Computer Vision, 2004.
12. J. Z. Wang, J. Li, and G. Wiederhold. SIMPLIcity: semantics-sensitive integrated matching for picture libraries. Trans. on Pattern Anal. and Machine Intel., 23(9), 2001.
13. A. Toshev, J. Shi, and K. Daniilidis. Image matching via saliency region correspondences. In Proc. of Conf. on Computer Vision and Pattern Recognition, 2007.
14. B. Kotnyek. A generalization of totally unimodular and network matrices. PhD thesis, London School of Economics and Political Science, 2002.
15. P.L. Hammer, P. Hansen, and B. Simeone. Roof duality, complementation and persistency in quadratic 0-1 optimization. Mathematical Programming, 28(2):121-155, 1984.
16. E. Boros and P.L. Hammer. Pseudo-Boolean optimization. Discrete Applied Math., 123(1-3):155-225, 2002.
17. A. Raj, G. Singh, and R. Zabih. MRFs for MRIs: Bayesian reconstruction of MR images via graph cuts. In Proc. of Conf. on Computer Vision and Pattern Recognition, 2006.
18. C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer. Optimizing binary mrfs via extended roof duality. In Proc. of Conf. on Computer Vision and Pattern Recognition, 2007.
19. P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, and P. Torr. On partial optimality in multi-label mrfs. In Proc. of International Conf. on Machine learning, 2008.
20. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. Trans. on Pattern Anal. and Machine Intel., 23(11):1222-1239, 2001.
21. H. Ishikawa and D. Geiger. Segmentation by Grouping Junctions. In Proc. of Conf. on Computer Vision and Pattern Recognition, 1998.
22. F. Kahl and D. Henrion. Globally optimal estimates for geometric reconstruction problems. International Journal of Computer Vision, 74(1):3-15, 2007.
23. B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms, page 101. Birkhäuser.
24. D. S. Hochbaum, N. Megiddo, J. Naor, and A. Tamir. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Programming, 62(1):69-83, 1993.
25. D. S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Math., 6:243-254, 1983.
26. E. Boros, P. L. Hammer, and G. Tavares. Preprocessing of unconstrained quadratic binary optimization. Technical report, Rutgers University, 2006.