An optimization framework for feature extraction
Machine Vision and Applications
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image Segmentation by Data-Driven Markov Chain Monte Carlo
IEEE Transactions on Pattern Analysis and Machine Intelligence
Normalized Cuts and Image Segmentation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Texture Synthesis by Non-Parametric Sampling
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Efficient Graph-Based Image Segmentation
International Journal of Computer Vision
Segmentation Induced by Scale Invariance
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Scale-Invariant Contour Completion Using Conditional Random Fields
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Comparing clusterings: an axiomatic view
ICML '05 Proceedings of the 22nd international conference on Machine learning
Boundary Extraction in Natural Images Using Ultrametric Contour Maps
CVPRW '06 Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop
Learning Probabilistic Models for Contour Completion in Natural Images
International Journal of Computer Vision
Unsupervised segmentation of natural images via lossy data compression
Computer Vision and Image Understanding
An efficient chain code with Huffman coding
Pattern Recognition
Recovering human body configurations: combining segmentation and recognition
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Image Processing
Simultaneous segmentation and figure/ground organization using angular embedding
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part II
Segmentation via ncuts and lossy minimum description length: a unified approach
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part III
Towards hypothesis testing and lossy minimum description length: a unified segmentation framework
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part III
Image segmentation fusion using general ensemble clustering methods
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part IV
Unsupervised texture-based image segmentation through pattern discovery
Computer Vision and Image Understanding
Moving object detecting system with phase discrepancy
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part II
Segmentation of Natural Images by Texture and Boundary Compression
International Journal of Computer Vision
Proceedings of the 1st International Workshop on Visual Interfaces for Ground Truth Collection in Computer Vision Applications
Measuring non-gaussianity by phi-transformed and fuzzy histograms
Advances in Artificial Neural Systems - Special issue on Advances in Unsupervised Learning Techniques Applied to Biosciences and Medicine
Variational and PCA based natural image segmentation
Pattern Recognition
Hi-index | 0.00 |
We present a novel algorithm for unsupervised segmentation of natural images that harnesses the principle of minimum description length (MDL). Our method is based on observations that a homogeneously textured region of a natural image can be well modeled by a Gaussian distribution and the region boundary can be effectively coded by an adaptive chain code. The optimal segmentation of an image is the one that gives the shortest coding length for encoding all textures and boundaries in the image, and is obtained via an agglomerative clustering process applied to a hierarchy of decreasing window sizes. The optimal segmentation also provides an accurate estimate of the overall coding length and hence the true entropy of the image. Our algorithm achieves state-of-the-art results on the Berkeley Segmentation Dataset compared to other popular methods.