Optimal solutions for semantic image decomposition

Bridging the gap between low-level and high-level image analysis has been a central challenge in computer vision throughout the last decades. In this article I will point out a number of recent developments in low-level image analysis which open up new possibilities to bring together concepts of high-level and low-level vision. The key observation is that numerous multi?label optimization problems can nowadays be efficiently solved in a near-optimal manner, using either graph-theoretic algorithms or convex relaxation techniques. Moreover, higher-level semantic knowledge can be learned and imposed on the basis of such multi?label formulations.

[1]  Daniel Cremers,et al.  A convex framework for image segmentation with moment constraints , 2011, 2011 International Conference on Computer Vision.

[2]  Daniel Cremers,et al.  A convex approach for computing minimal partitions , 2008 .

[3]  Jan-Michael Frahm,et al.  Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps , 2008, VMV.

[4]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[5]  Olga Veksler,et al.  Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[6]  Jing Yuan,et al.  Convex Multi-class Image Labeling by Simplex-Constrained Total Variation , 2009, SSVM.

[7]  Daniel Cremers,et al.  Generalized ordering constraints for multilabel optimization , 2011, 2011 International Conference on Computer Vision.

[8]  Olga Veksler,et al.  Order-Preserving Moves for Graph-Cut-Based Optimization , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

[10]  Olga Veksler,et al.  Tiered scene labeling with dynamic programming , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[12]  Daniel Cremers,et al.  Space-Varying Color Distributions for Interactive Multiregion Segmentation: Discrete versus Continuous Approaches , 2011, EMMCVPR.

[13]  Pushmeet Kohli,et al.  Graph Cut Based Inference with Co-occurrence Statistics , 2010, ECCV.

[14]  Bill Triggs,et al.  Histograms of oriented gradients for human detection , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[15]  Mila Nikolova,et al.  Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models , 2006, SIAM J. Appl. Math..