Computer Science – Computer Vision and Pattern Recognition
Scientific paper
2010-06-18
Computer Science
Computer Vision and Pattern Recognition
Scientific paper
We present a novel algorithm for 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 as multi-scale texture features. The optimal segmentation also provides an accurate estimate of the overall coding length and hence the true entropy of the image. We test our algorithm on the publicly available Berkeley Segmentation Dataset. It achieves state-of-the-art segmentation results compared to other existing methods.
Ma Yi
Mobahi Hossein
Rao Shankar R.
Sastry Shankar S.
Yang Allen Y.
No associations
LandOfFree
Segmentation of Natural Images by Texture and Boundary Compression does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Segmentation of Natural Images by Texture and Boundary Compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Segmentation of Natural Images by Texture and Boundary Compression will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-260553