Natural Image Segmentation Based on Tree Equipartition, Bayesian Flooding and Region Merging

We propose a general purpose image segmentation framework, which involves feature extraction and classification in feature space, followed by flooding and merging in spatial domain. Region growing is based on the computed local measurements and distances from the distribution of features describing the different classes. Using the properties of the label dependent distances spatial coherence is ensured, since the image features are described globally. The distribution of the features for the different classes are obtained by block-wise unsupervised clustering based on the construction of the minimum spanning tree of the blocks' grid using the Mallows distance and the equipartition of the resulting tree. The final clustering is obtained by using the k-centroids algorithm. With high probability and under topological constraints, connected components of the maximum likelihood classification map are used to compute a map of initially labelled pixels. An efficient flooding algorithm is introduced, namely, Priority Multi-Class Flooding Algorithm (PMCFA), that assign pixels to labels using Bayesian dissimilarity criteria. A new region merging method, which incorporates boundary information, is introduced for obtaining the final segmentation map. Therefore, the merging stage is based on region features and edge localization. Segmentation results on the Berkeley benchmark data set demonstrate the effectiveness of the proposed methods.

[1]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[2]  Marina Meila,et al.  Comparing Clusterings by the Variation of Information , 2003, COLT.

[3]  Dirk P. Kroese,et al.  Kernel density estimation via diffusion , 2010, 1011.2602.

[4]  Georgios Tziritas,et al.  Equivalent Key Frames Selection Based on Iso-Content Principles , 2009, IEEE Transactions on Circuits and Systems for Video Technology.

[5]  Fernand Meyer,et al.  Topographic distance and watershed lines , 1994, Signal Process..

[6]  Ηλίας Γκρίνιας Bayesian flooding for image and video segmentation , 2009 .

[7]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[8]  Jorge Stolfi,et al.  The image foresting transform: theory, algorithms, and applications , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Martial Hebert,et al.  A Comparison of Image Segmentation Algorithms , 2005 .

[10]  Georgios Tziritas,et al.  Colour and texture segmentation using wavelet frame analysis, deterministic relaxation, and fast marching algorithms , 2004, J. Vis. Commun. Image Represent..

[11]  Georgios Tziritas,et al.  The equipartition of curves , 2009, Comput. Geom..

[12]  David G. Stork,et al.  Pattern Classification , 1973 .

[13]  Jitendra Malik,et al.  Contour and Texture Analysis for Image Segmentation , 2001, International Journal of Computer Vision.

[14]  Xavier Cufí,et al.  Yet Another Survey on Image Segmentation: Region and Boundary Information Integration , 2002, ECCV.

[15]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[18]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[19]  Georgios Tziritas,et al.  Any dimension polygonal approximation based on equal errors principle , 2007, Pattern Recognit. Lett..

[20]  Shigeo Abe DrEng Pattern Classification , 2001, Springer London.

[21]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[22]  Vladimir Kolmogorov,et al.  Spatially coherent clustering using graph cuts , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[23]  Peter J. Bickel,et al.  The Earth Mover's distance is the Mallows distance: some insights from statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[24]  Yll Haxhimusa,et al.  Considerations Regarding the Minimum Spanning Tree Pyramid Segmentation Method , 2006, SSPR/SPR.

[25]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[26]  Rolf Adams,et al.  Seeded Region Growing , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[27]  C. Mallows A Note on Asymptotic Joint Normality , 1972 .

[28]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[30]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[31]  Georgios Tziritas,et al.  Bayesian Level Sets for Image Segmentation , 2002, J. Vis. Commun. Image Represent..

[32]  Ioannis Pitas,et al.  Color Texture Segmentation Based on the Modal Energy of Deformable Surfaces , 2009, IEEE Transactions on Image Processing.

[33]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.