A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Elements of information theory
Elements of information theory
Picture Segmentation by a Tree Traversal Algorithm
Journal of the ACM (JACM)
Document clustering using word clusters via the information bottleneck method
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Markov random field modeling in image analysis
Markov random field modeling in image analysis
Digital Image Processing
Advanced algorithmic approaches to medical image segmentation: state-of-the-art application in cardiology, neurology, mammography and pathology
Computer Vision
Computer Vision: A Modern Approach
Computer Vision: A Modern Approach
Yet Another Survey on Image Segmentation: Region and Boundary Information Integration
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
An Efficient Parameterless Quadrilateral-Based Image Segmentation Method
IEEE Transactions on Pattern Analysis and Machine Intelligence
A top-down region dividing approach for image segmentation
Pattern Recognition
Learning pattern classification-a survey
IEEE Transactions on Information Theory
A novel metrics based on information bottleneck principle for face retrieval
PCM'10 Proceedings of the 11th Pacific Rim conference on Advances in multimedia information processing: Part I
Multiresolution image registration based on tree data structures
Graphical Models
Information theory in computer graphics and visualization
SIGGRAPH Asia 2011 Courses
Color texture segmentation based on image pixel classification
Engineering Applications of Artificial Intelligence
Hi-index | 0.01 |
In image processing, segmentation algorithms constitute one of the main focuses of research. In this paper, new image segmentation algorithms based on a hard version of the information bottleneck method are presented. The objective of this method is to extract a compact representation of a variable, considered the input, with minimal loss of mutual information with respect to another variable, considered the output. First, we introduce a split-and-merge algorithm based on the definition of an information channel between a set of regions (input) of the image and the intensity histogram bins (output). From this channel, the maximization of the mutual information gain is used to optimize the image partitioning. Then, the merging process of the regions obtained in the previous phase is carried out by minimizing the loss of mutual information. From the inversion of the above channel, we also present a new histogram clustering algorithm based on the minimization of the mutual information loss, where now the input variable represents the histogram bins and the output is given by the set of regions obtained from the above split-and-merge algorithm. Finally, we introduce two new clustering algorithms which show how the information bottleneck method can be applied to the registration channel obtained when two multimodal images are correctly aligned. Different experiments on 2-D and 3-D images show the behavior of the proposed algorithms.