Generalized ordering constraints for multilabel optimization

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2011, Pages 2619-2626

  Strekalovskiy, Evgeny ^a   Cremers, Daniel ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS OPTIMIZATION; CONVEX SHAPES; HIGHER DIMENSIONS; IMAGE DOMAIN; LABEL LAYOUTS; MULTI-LABEL; NOVEL APPLICATIONS; ORDERING CONSTRAINTS;

IMAGE PROCESSING;

OPTIMIZATION;

EID: 84856632142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2011.6126551     Document Type: Conference Paper

References (15)

1. G. Alberti, G. Bouchitté, and G. D. Maso. The calibration method for the mumford-shah functional and free-Figure 1I. Beyond existing approaches, the proposed framework allows to model priors on convex shapes. From left to right: input image with user scribbles, Potts partitioning, partitioning using the convex shape prior, prior encoding. The prior is modeled by a n-gon, here an octagon, with edges pointing in all directions. discontinuity problems. Calc. Var. Partial Differential Equations, 16(3):299-333, 2003. 1, 3
2. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Trans. on Patt. Anal. and Mach. Intell., 23(11):1222-1239, 2001 1
3. A. Chambolle, D. Cremers, and T. Pock. A convex approach for computing minimal partitions. Technical report TR-2008-05, Dept. of Computer Science, University of Bonn, Bonn, Germany, November 2008. 1
4. P. F. Felzenszwalb and O. Veksler. Tiered scene labeling with dynamic programming. Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, 0:3097-3104, 2010. 1, 4, 5, 6, 7
5. D. Hoiem, A. A. Efros, and M. Hebert. Recovering surface layout from an image. Int. J. Comput. Vision, 75:151-172, October 2007. 4, 5
6. H. Ishikawa. Exact optimization for Markov random fields with convex priors. IEEE Trans. on Patt. Anal. and Mach. Intell., 25(10):1333-1336, October 2003. 1
7. N. Komodakis and G. Tziritas. Approximate labeling via graph-cuts based on linear programming. IEEE Trans. on Patt. Anal. and Mach. Intell., 29(8):1436-1453, 2007. 1
8. J. Lellman, J. Kappes, J. Yuan, F. Becker, and C. Schnörr. Convex multi-class image labeling by simplex-constrained total variation. Technical report, IPA, HC1, Dept. Of Mathematics and Computer Science, Univ. Heidelberg, October 2008. 1
9. J. Lellmann, F. Becker, and C. Schnörr. Convex optimization for multi-class image labeling with a novel family of total variation based regularizers. In IEEE International Conference on Computer Vision (ICCV), pages 646-653, 2009. 3
10. X. Liu, O. Veksler, and J. Samarabandu. Order-preserving moves for graph-cut-based optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32:1182-1196, 2010. 1, 4
11. K. Murota. Discrete Convex Analysis. SIAM, 2003. 8
12. T. Pock, D. Cremers, H. Bischof, and A. Chambolle. An algorithm for minimizing the piecewise smooth mumford-shah functional. In IEEE International Conference on Computer Vision (ICCV), Kyoto, Japan, 2009. 4
13. R. T. Rockafellar. Convex Analysis. Princeton University Press, 1996. 2
14. O. Veksler. Star shape prior for graph-cut image segmentation. In Proceedings of the 10th European Conference on Computer Vision: Part II1, pages 454-467, Berlin, Heidelberg, 2008. Springer-Verlag. 1, 6
15. C. Zach, D. Gallup, J.-M. Frahm, and M. Niethammer. Fast global labeling for real-time stereo using multiple plane sweeps. In Workshop on Vision, Modeling and Visualization, October 2008. 1