Co-Sparse Textural Similarity for Interactive Segmentation

We propose an algorithm for segmenting natural images based on texture and color information, which leverages the co-sparse analysis model for image segmentation. As a key ingredient of this method, we introduce a novel textural similarity measure, which builds upon the co-sparse representation of image patches. We propose a statistical MAP inference approach to merge textural similarity with information about color and location. Combined with recently developed convex multilabel optimization methods this leads to an efficient algorithm for interactive segmentation, which is easily parallelized on graphics hardware. The provided approach outperforms state-of-the-art interactive segmentation methods on the Graz Benchmark.

[1]  Yunjin Chen,et al.  Insights Into Analysis Operator Learning: From Patch-Based Sparse Models to Higher Order MRFs , 2014, IEEE Transactions on Image Processing.

[2]  Daniel Cremers,et al.  A Survey and Comparison of Discrete and Continuous Multi-label Optimization Approaches for the Potts Model , 2013, International Journal of Computer Vision.

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

[4]  Allen Y. Yang,et al.  Unsupervised segmentation of natural images via lossy data compression , 2008, Comput. Vis. Image Underst..

[5]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[6]  Shree K. Nayar,et al.  Computer Vision - ACCV 2006, 7th Asian Conference on Computer Vision, Hyderabad, India, January 13-16, 2006, Proceedings, Part I , 2006, ACCV.

[7]  L. R. Dice.  Measures of the Amount of Ecologic Association Between Species , 1945 .

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

[9]  Chi-Keung Tang,et al.  Soft Color Segmentation and Its Applications , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Martin Kleinsteuber,et al.  A Joint Intensity and Depth Co-sparse Analysis Model for Depth Map Super-resolution , 2013, 2013 IEEE International Conference on Computer Vision.

[11]  Michael Elad,et al.  Analysis versus synthesis in signal priors , 2006, 2006 14th European Signal Processing Conference.

[12]  Feiping Nie,et al.  Texture Image Segmentation: An Interactive Framework Based on Adaptive Features and Transductive Learning , 2006, ACCV.

[13]  Daniel Cremers,et al.  TVSeg - Interactive Total Variation Based Image Segmentation , 2008, BMVC.

[14]  Antonin Chambolle,et al.  Diagonal preconditioning for first order primal-dual algorithms in convex optimization , 2011, 2011 International Conference on Computer Vision.

[15]  Rémi Gribonval,et al.  Constrained Overcomplete Analysis Operator Learning for Cosparse Signal Modelling , 2012, IEEE Transactions on Signal Processing.

[16]  Michael Elad,et al.  The Cosparse Analysis Model and Algorithms , 2011, ArXiv.

[17]  Horst Bischof,et al.  Interactive Multi-label Segmentation , 2010, ACCV.

[18]  Daniel Cremers,et al.  Spatially Varying Color Distributions for Interactive Multilabel Segmentation , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[21]  Guillermo Sapiro,et al.  Discriminative learned dictionaries for local image analysis , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[22]  Hossein Mobahi,et al.  Segmentation of Natural Images by Texture and Boundary Compression , 2011, International Journal of Computer Vision.

[23]  E. Parzen.  On Estimation of a Probability Density Function and Mode , 1962 .

[24]  Radim Sára,et al.  A Weak Structure Model for Regular Pattern Recognition Applied to Facade Images , 2010, ACCV.

[25]  Max Mignotte,et al.  MDS-based segmentation model for the fusion of contour and texture cues in natural images , 2012, Comput. Vis. Image Underst..

[26]  C. Michelot.  A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .

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

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

[29]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[30]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[31]  Klaus Diepold,et al.  Analysis Operator Learning and its Application to Image Reconstruction , 2012, IEEE Transactions on Image Processing.

[32]  Daniel Cremers,et al.  On Local Region Models and the Statistical Interpretation of the Piecewise Smooth Mumford-shah Functional , 2007 .

[33]  Horst Bischof,et al.  Interactive Texture Segmentation using Random Forests and Total Variation , 2009, BMVC.

[34]  A. Fiacco.  A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R " , 2009 .

[35]  H. Fédérer.  Geometric Measure Theory , 1969 .

[36]  Hoai Bac Le,et al.  Combining Color and Texture for a Robust Interactive Segmentation Algorithm , 2010, RIVF.

[37]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[38]  Yoram Bresler,et al.  Learning Sparsifying Transforms , 2013, IEEE Transactions on Signal Processing.