Multi-label image segmentation via point-wise repetition

Bottom-up segmentation tends to rely on local features. Yet, many natural and man-made objects contain repeating elements. Such structural and more spread-out features are important cues for segmentation but are more difficult to exploit. The difficulty also comes from the fact that repetition need not be perfect, and will actually rather be partial, approximate, or both in most cases. This paper presents a multi-label image segmentation algorithm that processes a single input image and efficiently discovers and exploits repeating elements without any prior knowledge about their shape, color or structure. The algorithm spells out the interplay between segmentation and repetition detection. The key of our approach is a novel, point-wise concept of repetition. This is defined by point-wise mutual information and locally compares certain neighborhoods to accumulate evidence. This point-wise repetition measure naturally handles imperfect repetitions, and the parts with inconsistent appearances are recognized and assigned with low scores. An energy functional is proposed to include the point-wise repetition into the image segmentation process, which takes the form of a graph-cut minimization. Real scene images demonstrate the ability of our algorithm to handle partial and approximate repetition.

[1]  Andrew Zisserman,et al.  OBJ CUT , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[2]  Alexei A. Efros,et al.  Discovering Texture Regularity as a Higher-Order Correspondence Problem , 2006, ECCV.

[3]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Thomas M. Cover,et al.  Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .

[5]  Joachim M. Buhmann,et al.  Non-parametric similarity measures for unsupervised texture segmentation and image retrieval , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  John G. van Bosse,et al.  Wiley Series in Telecommunications and Signal Processing , 2006 .

[7]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[8]  Jonas Gårding,et al.  Surface orientation and curvature from differential texture distortion , 1995, Proceedings of IEEE International Conference on Computer Vision.

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

[10]  Daniel Cremers,et al.  Dynamical statistical shape priors for level set-based tracking , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Sang Uk Lee,et al.  Color image segmentation based on 3-D clustering: morphological approach , 1998, Pattern Recognit..

[12]  David A. Forsyth,et al.  Shape from Texture without Boundaries , 2002, International Journal of Computer Vision.

[13]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[14]  Jitendra Malik,et al.  Textons, contours and regions: cue integration in image segmentation , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[15]  Josiane Zerubia,et al.  Higher Order Active Contours , 2006, International Journal of Computer Vision.

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

[17]  Yanxi Liu,et al.  Near-regular texture analysis and manipulation , 2004, SIGGRAPH 2004.

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

[19]  Robert W. G. Hunt,et al.  The reproduction of colour , 1957 .

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

[21]  Guy Marchal,et al.  Multimodality image registration by maximization of mutual information , 1997, IEEE Transactions on Medical Imaging.

[22]  Tao Zhang,et al.  Interactive graph cut based segmentation with shape priors , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[23]  Marc Pollefeys,et al.  IEEE Computer Society Conference on Computer Vision and Pattern Recognition workshops, 2008 , 2008, CVPR 2008.

[24]  Jia-Ping Wang,et al.  Stochastic Relaxation on Partitions With Connected Components and Its Application to Image Segmentation , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  Yu Jin Zhang,et al.  Evaluation and comparison of different segmentation algorithms , 1997, Pattern Recognit. Lett..

[26]  Manuel P. Malumbres,et al.  A new fast lower-tree wavelet image encoder , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[27]  Alain Trémeau,et al.  A region growing and merging algorithm to color segmentation , 1997, Pattern Recognit..

[28]  Jiebo Luo,et al.  Incorporation of derivative priors in adaptive Bayesian color image segmentation , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

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

[30]  Xie Yuan-dan,et al.  Survey on Image Segmentation , 2002 .