A New Model and Simple Algorithms for Multi-label Mumford-Shah Problems

In this work, we address the multi-label Mumford-Shah problem, i.e., the problem of jointly estimating a partitioning of the domain of the image, and functions defined within regions of the partition. We create algorithms that are efficient, robust to undesirable local minima, and are easy-to-implement. Our algorithms are formulated by slightly modifying the underlying statistical model from which the multi-label Mumford-Shah functional is derived. The advantage of this statistical model is that the underlying variables: the labels and the functions are less coupled than in the original formulation, and the labels can be computed from the functions with more global updates. The resulting algorithms can be tuned to the desired level of locality of the solution: from fully global updates to more local updates. We demonstrate our algorithm on two applications: joint multi-label segmentation and denoising, and joint multi-label motion segmentation and flow estimation. We compare to the state-of-the-art in multi-label Mumford-Shah problems and show that we achieve more promising results.

[1]  L. Evans Convergence of an algorithm for mean curvature motion , 1993 .

[2]  Daniel Cremers,et al.  A convex representation for the vectorial Mumford-Shah functional , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Anthony J. Yezzi,et al.  Curve evolution implementation of the Mumford-Shah functional for image segmentation, denoising, interpolation, and magnification , 2001, IEEE Trans. Image Process..

[4]  Christopher V. Alvino,et al.  Reformulating and Optimizing the Mumford-Shah Functional on a Graph - A Faster, Lower Energy Solution , 2008, ECCV.

[5]  Stefano Soatto,et al.  Multi-View Stereo Reconstruction of Dense Shape and Complex Appearance , 2005, International Journal of Computer Vision.

[6]  Michael J. Black,et al.  Layered segmentation and optical flow estimation over time , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[7]  G. Barles,et al.  A Simple Proof of Convergence for an Approximation Scheme for Computing Motions by Mean Curvature , 1995 .

[8]  Gregory G. Slabaugh,et al.  Coupled PDEs for non-rigid registration and segmentation , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[9]  Alan L. Yuille,et al.  Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Jack Xin,et al.  Diffusion-Generated Motion by Mean Curvature for Filaments , 2001, J. Nonlinear Sci..

[11]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..

[12]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[13]  Christoph Schnörr,et al.  Continuous Multiclass Labeling Approaches and Algorithms , 2011, SIAM J. Imaging Sci..

[14]  Daniel Cremers,et al.  An algorithm for minimizing the Mumford-Shah functional , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[15]  Leo Grady,et al.  Discrete Optimization of the Multiphase Piecewise Constant Mumford-Shah Functional , 2011, EMMCVPR.

[16]  Tony F. Chan,et al.  A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model , 2002, International Journal of Computer Vision.

[17]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .

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

[19]  Joseph A. O'Sullivan,et al.  Alternating Minimization Algorithms for Transmission Tomography , 2007, IEEE Transactions on Medical Imaging.

[20]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .