Efficient Unsupervised Image Segmentation by Optimum Cuts in Graphs

In this work, a method based on optimum cuts in graphs is proposed for unsupervised image segmentation, that can be tailored to different objects, according to their boundary polarity, by extending the Oriented Image Foresting Transform (OIFT). The proposed method, named UOIFT, encompasses as a particular case the single-linkage algorithm by minimum spanning tree (MST), establishing important theoretical contributions, and gives superior segmentation results compared to other approaches commonly used in the literature, usually requiring a lower number of image partitions to isolate the desired regions of interest. The method is supported by new theoretical results involving the usage of non-monotonic-incremental cost functions in directed graphs. The results are demonstrated using a region adjacency graph of superpixels in medical and natural images.

[1]  Ming Zhang,et al.  Improving the Graph-Based Image Segmentation Method , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[2]  Lucy A. C. Mansilla,et al.  Oriented Image Foresting Transform Segmentation by Seed Competition , 2014, IEEE Transactions on Image Processing.

[3]  Roberto de Alencar Lotufo,et al.  Seed-Relative Segmentation Robustness of Watershed and Fuzzy Connectedness Approaches , 2007 .

[4]  Serge J. Belongie,et al.  Normalized cuts in 3-D for spinal MRI segmentation , 2004, IEEE Transactions on Medical Imaging.

[5]  Lucy A. C. Mansilla,et al.  Image segmentation by oriented image foresting transform: Handling ties and colored images , 2013, 2013 18th International Conference on Digital Signal Processing (DSP).

[6]  Paulo André Vechiatto Miranda,et al.  Oriented relative fuzzy connectedness: theory, algorithms, and its applications in hybrid image segmentation methods , 2015, EURASIP J. Image Video Process..

[7]  Alexandre X. Falcão,et al.  IFT-SLIC: A General Framework for Superpixel Generation Based on Simple Linear Iterative Clustering and Image Foresting Transform , 2015, 2015 28th SIBGRAPI Conference on Graphics, Patterns and Images.

[8]  Gabriel Taubin,et al.  Interactive 3D ScanningWithout Tracking , 2007 .

[9]  Jeffrey Mark Siskind,et al.  Image Segmentation with Ratio Cut , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Lucy A. C. Mansilla,et al.  Image Segmentation by Oriented Image Foresting Transform with Geodesic Star Convexity , 2013, CAIP.

[11]  Jean Cousty,et al.  Hierarchical Segmentations with Graphs: Quasi-flat Zones, Minimum Spanning Trees, and Saliency Maps , 2018, Journal of Mathematical Imaging and Vision.

[12]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Paulo André Vechiatto Miranda,et al.  Image segmentation by image foresting transform with geodesic band constraints , 2014, 2014 IEEE International Conference on Image Processing (ICIP).

[15]  Vladlen Koltun,et al.  Geodesic Object Proposals , 2014, ECCV.

[16]  Krzysztof Ciesielski,et al.  Path-Value Functions for Which Dijkstra’s Algorithm Returns Optimal Mapping , 2018, Journal of Mathematical Imaging and Vision.

[17]  Daniel P. Huttenlocher,et al.  Efficient Graph-Based Image Segmentation , 2004, International Journal of Computer Vision.

[18]  Jean Cousty,et al.  Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity , 2017, Math. Morphol. Theory Appl..

[19]  Jorge Stolfi,et al.  The image foresting transform: theory, algorithms, and applications , 2004 .

[20]  Alexandre Gonçalves Silva,et al.  Efficient computation of new extinction values from extended component tree , 2011, Pattern Recognit. Lett..

[21]  Roberto de Alencar Lotufo,et al.  iamxt: Max-tree toolbox for image processing and analysis , 2017, SoftwareX.

[22]  Lucy A. C. Mansilla,et al.  Oriented image foresting transform segmentation with connectivity constraints , 2016, 2016 IEEE International Conference on Image Processing (ICIP).

[23]  J. Siskind,et al.  Image segmentation with minimum mean cut , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[24]  Pascal Fua,et al.  SLIC Superpixels Compared to State-of-the-Art Superpixel Methods , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Jean Cousty,et al.  A Hierarchical Image Segmentation Algorithm Based on an Observation Scale , 2012, SSPR/SPR.

[26]  Hui Xiang,et al.  An Improved Graph-Based Image Segmentation Algorithm and Its GPU Acceleration , 2011, 2011 Workshop on Digital Media and Digital Content Management.