Spectral Segmentation via Midlevel Cues Integrating Geodesic and Intensity

Image segmentation still remains as a challenge in image processing and pattern recognition when involving complex natural scenes. In this paper, we present a new affinity model for spectral segmentation based on midlevel cues. In contrast to most existing methods that operate directly on low-level cues, we first oversegment the image into superpixel images and then integrate the geodesic line edge and intensity cue to form the similarity matrix W so that it more accurately describes the similarity between data. The geodesic line edge could avoid strong boundary and represent the true boundary between two superpixels while the mean red green blue vector could describe the intensity of superpixels better. As far as we know, this is a totally new kind of affinity model to represent superpixels. Based on this model, we use the spectral clustering in the superpixel level and then achieve the image segmentation in the pixel level. The experimental results show that the proposed method performs steadily and well on various natural images. The evaluation comparisons also prove that our method achieves comparable accuracy and significantly performs better than most state-of-the-art algorithms.

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

[2]  Allan D. Jepson,et al.  Benchmarking Image Segmentation Algorithms , 2009, International Journal of Computer Vision.

[3]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

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

[5]  Horst Bischof,et al.  ROI-SEG: Unsupervised Color Segmentation by Combining Differently Focused Sub Results , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Andrew Blake,et al.  GeoS: Geodesic Image Segmentation , 2008, ECCV.

[7]  Lattre de Tassigny Boundary Extraction in Natural Images Using Ultrametric Contour Maps , 2006 .

[8]  B. S. Manjunath,et al.  Fast and Adaptive Pairwise Similarities for Graph Cuts-based Image Segmentation , 2006, 2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'06).

[9]  Jianbo Shi,et al.  Spectral segmentation with multiscale graph decomposition , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[10]  Guillermo Sapiro,et al.  Geodesic Matting: A Framework for Fast Interactive Image and Video Segmentation and Matting , 2009, International Journal of Computer Vision.

[11]  Meng Wang,et al.  Unified Video Annotation via Multigraph Learning , 2009, IEEE Transactions on Circuits and Systems for Video Technology.

[12]  Jitendra Malik,et al.  Learning to detect natural image boundaries using local brightness, color, and texture cues , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[14]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[15]  Christoph Schnörr,et al.  Hierarchical Image Segmentation Based on Semidefinite Programming , 2004, DAGM-Symposium.

[16]  Jianbo Shi,et al.  Multiclass spectral clustering , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[17]  Horst Bischof,et al.  Saliency driven total variation segmentation , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[18]  Scott Cohen,et al.  Geodesic graph cut for interactive image segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[19]  Bernhard Schölkopf,et al.  Learning with Local and Global Consistency , 2003, NIPS.

[20]  Martial Hebert,et al.  Toward Objective Evaluation of Image Segmentation Algorithms , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[22]  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.

[23]  Meng Wang,et al.  Tag Tagging: Towards More Descriptive Keywords of Image Content , 2011, IEEE Transactions on Multimedia.

[24]  Christopher Rohkohl,et al.  Efficient Image Segmentation Using Pairwise Pixel Similarities , 2007, DAGM-Symposium.

[25]  Jitendra Malik,et al.  Learning a classification model for segmentation , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[26]  Marina Meila,et al.  Comparing clusterings: an axiomatic view , 2005, ICML.

[27]  Meng Wang,et al.  Beyond Distance Measurement: Constructing Neighborhood Similarity for Video Annotation , 2009, IEEE Transactions on Multimedia.

[28]  Pekka J. Toivanen,et al.  Erratum to "New geodesic distance transforms for gray-scale images" [Pattern Recognition Letters 17 (1996) 437-450] , 1996, Pattern Recognit. Lett..

[29]  Guillermo Sapiro,et al.  A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[30]  Andrew Blake,et al.  Geodesic star convexity for interactive image segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[31]  J. A. Sethian,et al.  Fast Marching Methods , 1999, SIAM Rev..

[32]  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.

[33]  Charless C. Fowlkes,et al.  Contour Detection and Hierarchical Image Segmentation , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[35]  Vincent Lepetit,et al.  A Fully Automated Approach to Segmentation of Irregularly Shaped Cellular Structures in EM Images , 2010, MICCAI.

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

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

[38]  Shyi-Chyi Cheng,et al.  Adaptive image segmentation for region-based object retrieval using generalized Hough transform , 2010, Pattern Recognit..

[39]  Guillermo Sapiro,et al.  O(N) implementation of the fast marching algorithm , 2006, Journal of Computational Physics.

[40]  Jing Li Wang,et al.  Color image segmentation: advances and prospects , 2001, Pattern Recognit..

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

[42]  Sang Uk Lee,et al.  Learning full pairwise affinities for spectral segmentation , 2010, CVPR.

[43]  Hossein Mobahi,et al.  Natural Image Segmentation with Adaptive Texture and Boundary Encoding , 2009, ACCV.