File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s11263-011-0444-0
- Scopus: eid_2-s2.0-79960270397
- WOS: WOS:000294569300006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Segmentation of natural images by texture and boundary compression
Title | Segmentation of natural images by texture and boundary compression |
---|---|
Authors | |
Keywords | Image segmentation Minimum description length Texture segmentation |
Issue Date | 2011 |
Citation | International Journal of Computer Vision, 2011, v. 95, n. 1, p. 86-98 How to Cite? |
Abstract | 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. © 2011 Springer Science+Business Media, LLC. |
Persistent Identifier | http://hdl.handle.net/10722/326869 |
ISSN | 2023 Impact Factor: 11.6 2023 SCImago Journal Rankings: 6.668 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mobahi, Hossein | - |
dc.contributor.author | Rao, Shankar R. | - |
dc.contributor.author | Yang, Allen Y. | - |
dc.contributor.author | Sastry, Shankar S. | - |
dc.contributor.author | Ma, Yi | - |
dc.date.accessioned | 2023-03-31T05:27:07Z | - |
dc.date.available | 2023-03-31T05:27:07Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | International Journal of Computer Vision, 2011, v. 95, n. 1, p. 86-98 | - |
dc.identifier.issn | 0920-5691 | - |
dc.identifier.uri | http://hdl.handle.net/10722/326869 | - |
dc.description.abstract | 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. © 2011 Springer Science+Business Media, LLC. | - |
dc.language | eng | - |
dc.relation.ispartof | International Journal of Computer Vision | - |
dc.subject | Image segmentation | - |
dc.subject | Minimum description length | - |
dc.subject | Texture segmentation | - |
dc.title | Segmentation of natural images by texture and boundary compression | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s11263-011-0444-0 | - |
dc.identifier.scopus | eid_2-s2.0-79960270397 | - |
dc.identifier.volume | 95 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 86 | - |
dc.identifier.epage | 98 | - |
dc.identifier.eissn | 1573-1405 | - |
dc.identifier.isi | WOS:000294569300006 | - |