Tiered scene labeling with dynamic programming

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

Volumn , Issue , 2010, Pages 3097-3104

  Felzenszwalb, Pedro F ^a   Veksler, Olga ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION PROBLEMS; DYNAMIC PROGRAMMING ALGORITHM; HORIZONTAL CURVES; OPTIMAL LABELING; SHAPE PRIORS; TREE-WIDTH;

COMPUTER PROGRAMMING; COMPUTER VISION; IMAGE SEGMENTATION; PIXELS;

DYNAMIC PROGRAMMING;

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

References (23)

1. T. Asano, D. Chen, N. Katoh, and T. Tokuyama. Efficient algorithms for optimization-based image segmentation. IJCGA, 11(2):145-166, 2001.
2. A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr. Interactive image segmentation using an adaptive GMMRF model. In ECCV, 2004.
3. Y. Boykov and G. Funka Lea. Graph cuts and efficient n-d image segmentation. IJCV, 69(2):109-131, 2006.
4. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, 23(11):1222-1239, 2001.
5. D. Cremers, S. Osher, and S. Soatto. Kernel density estimation and intrinsic alignment for shape priors in level set segmentation. IJCV, 69(3):335-351, 2006.
6. P. Das, O. Veksler, S. Zavadsky, and Y. Boykov. Semiautomatic segmentation with compact shapre prior. In CRV, 2006.
7. A. Delong and Y. Boykov. Globally optimal segmentation of multi-region objects. In ICCV, 2009.
8. D. Greig, B. Porteous, and A. Seheult. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society, Series B, 51(2):271-279, 1989.
9. D. Hoiem, A. Efros, and M. Hebert. Recovering surface layout from an image. IJCV, 75(1):151-172, 2007.
10. H. Ishikawa. Exact optimization for markov random fields with convex priors. PAMI, 25(10):1333-1336, 2003.
11. P. Kohli, L. Ladický, and P. H. Torr. Robust higher order potentials for enforcing label consistency. IJCV, 82(3):302-324, 2009.
12. V. Kolmogorov and C. Rother. Minimizing nonsubmodular functions with graph cuts - a review. PAMI, 29(7):1274-1279, 2007.
13. M. Leventon, W. Grimson, and O. Faugeras. Stat. shape influence in geodesic active contours. In CVPR, 2000.
14. S. Li. Markov Random Field Modeling in Computer Vision. Springer-Verlag, 1995.
15. X. Liu, O. Veksler, and J. Samarabandu. Order preserving moves for graph cut based optimization. PAMI, to appear.
16. C. Rother, S. Kumar, V. Kolmogorov, and A. Blake. Digital tapestry. In CVPR, 2005.
17. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47(1-3):7-42, 2002.
18. D. Schlesinger and B. Flach. Transforming an arbitrary minsum problem into a binary one. Technical Report TUD-FI06-01, Dresden University of Technology, April 2006.
19. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. F. Tappen, and C. Rother. A comparative study of energy minimization methods for markov random fields with smoothness-based priors. PAMI, 30(6):1068-1080, 2008.
20. I. Tsochantaridis, T. Hofmann, T. Joachims, and Y. Altun. Support vector machine learning for interdependent and structured output spaces. In ICML, 2004.
21. O. Veksler. Star shape prior for graph-cut image segmentation. In ECCV, 2008.
22. J. Winn and J. Shotton. The layout consistent random field for recognizing and segmenting partially occluded objects. In CVPR, 2006.
23. C.-N. Yu and T. Joachims. Learning structural svms with latent variables. In ICML, 2009.