Evolving Content-Driven Superpixels for Accurate Image Representation

A novel approach to superpixel generation is presented that aims to reconcile image information with superpixel coverage. It is described as content-driven as the number of superpixels in any given area is dictated by the underlying image properties. By using a combination of well-established computer vision techniques, superpixels are grown and subsequently divided on detecting simple image variation. It is designed to have no direct control over the number of superpixels as this can lead to errors. The algorithm is subject to performance metrics on the Berkeley Segmentation Dataset including: explained variation; mode label analysis, as well as a measure of oversegmentation. The results show that this new algorithm can reduce the superpixel oversegmentation and retain comparable performance in all other metrics. The algorithm is shown to be stable with respect to initialisation, with little variation across performance metrics on a set of random initialisations.

[1]  Sven J. Dickinson,et al.  TurboPixels: Fast Superpixels Using Geometric Flows , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

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

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

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

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

[8]  Umar Mohammed,et al.  Scene shape priors for superpixel segmentation , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[9]  Tony F. Chan,et al.  Active Contours without Edges for Vector-Valued Images , 2000, J. Vis. Commun. Image Represent..

[10]  Dana H. Ballard,et al.  Computer Vision , 1982 .

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

[12]  Jonathan Warrell,et al.  “Lattice Cut” - Constructing superpixels using layer constraints , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[13]  Jitendra Malik,et al.  Scale-Space and Edge Detection Using Anisotropic Diffusion , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

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

[15]  Umar Mohammed,et al.  Superpixel lattices , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.