File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-12307-8_13
- Scopus: eid_2-s2.0-78149302354
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Natural image segmentation with adaptive texture and boundary encoding
Title | Natural image segmentation with adaptive texture and boundary encoding |
---|---|
Authors | |
Issue Date | 2010 |
Citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, v. 5994 LNCS, n. PART 1, p. 135-146 How to Cite? |
Abstract | 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. © Springer-Verlag 2010. |
Persistent Identifier | http://hdl.handle.net/10722/326843 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rao, Shankar R. | - |
dc.contributor.author | Mobahi, Hossein | - |
dc.contributor.author | Yang, Allen Y. | - |
dc.contributor.author | Sastry, S. Shankar | - |
dc.contributor.author | Ma, Yi | - |
dc.date.accessioned | 2023-03-31T05:26:55Z | - |
dc.date.available | 2023-03-31T05:26:55Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, v. 5994 LNCS, n. PART 1, p. 135-146 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/326843 | - |
dc.description.abstract | 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. © Springer-Verlag 2010. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Natural image segmentation with adaptive texture and boundary encoding | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-12307-8_13 | - |
dc.identifier.scopus | eid_2-s2.0-78149302354 | - |
dc.identifier.volume | 5994 LNCS | - |
dc.identifier.issue | PART 1 | - |
dc.identifier.spage | 135 | - |
dc.identifier.epage | 146 | - |
dc.identifier.eissn | 1611-3349 | - |