Image segmentation via IB method

This paper presents an image segmentation algorithm, called ISIB, based on the Information Bottleneck (IB) method. ISIB extracts the image patterns by maximally preserving the mutual information between the segments and the gray scale values. There are two stages in our algorithm, partitioning the image and merging the segmentations. In the partition process, we segment an image by maximizing the mutual information gain, so that the fine structure of the image can be obtained. In the second stage, we use the density based IB method to merge the fine segments to get the whole structure of the image. Our experiments show that, compared with other advanced image segment methods, ISIB induces the contours which better describe image objects.

[1]  Shiri Gordon,et al.  Unsupervised image-set clustering using an information theoretic framework , 2006, IEEE Transactions on Image Processing.

[2]  Dong Liu,et al.  Unsupervised object category discovery via information bottleneck method , 2010, ACM Multimedia.

[3]  Mateu Sbert,et al.  Image Segmentation Using Information Bottleneck Method , 2009, IEEE Transactions on Image Processing.

[4]  Qingrong Zhang,et al.  An Image Segmentation Algorithm in Image Processing Based on Threshold Segmentation , 2007, 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System.

[5]  Yongli Ren,et al.  The Density Connectivity Information Bottleneck , 2008, 2008 The 9th International Conference for Young Computer Scientists.

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

[7]  Naftali Tishby,et al.  The information bottleneck method , 2000, ArXiv.

[8]  Shih-Fu Chang,et al.  Video search reranking via information bottleneck principle , 2006, MM '06.

[9]  Naftali Tishby,et al.  Agglomerative Information Bottleneck , 1999, NIPS.