| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 6qtX3pFwXQZG2LgkFdY/Rwwsf |
| Repository | sid.inpe.br/sibgrapi@80/2007/09.21.12.42 |
| Last Update | 2007:09.21.12.42.18 (UTC) administrator |
| Metadata Repository | sid.inpe.br/sibgrapi@80/2007/09.21.12.42.19 |
| Metadata Last Update | 2022:05.18.22.21.15 (UTC) administrator |
| Citation Key | BastosConc:2007:AuTeSe |
| Title | Automatic Texture Segmentation Based on k-means Clustering and Co-occurrence Features  |
| Format | On-line |
| Year | 2007 |
| Access Date | 2025, July 03 |
| Number of Files | 1 |
| Size | 90 KiB |
| 2. Context | |
| Author | 1 Bastos, Lucas 2 Conci, Aura |
| Affiliation | 1 Universidade Federal Fluminense 2 Universidade Federal Fluminense |
| Editor | Gonçalves, Luiz Wu, Shin Ting |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 20 (SIBGRAPI) |
| Conference Location | Belo Horizonte, MG, Brazil |
| Date | 7-10 Oct. 2007 |
| Publisher | Sociedade Brasileira de Computação |
| Publisher City | Porto Alegre |
| Book Title | Proceedings |
| Tertiary Type | Technical Poster |
| History (UTC) | 2008-07-17 14:09:45 :: aconci@ic.uff.br -> administrator :: 2009-08-13 20:38:44 :: administrator -> banon :: 2010-08-28 20:02:32 :: banon -> administrator :: 2022-05-18 22:21:15 :: administrator -> :: 2007 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Keywords | Haralick features automatic texture segmentation grey level co-occurrence |
| Abstract | This work presents a method for automatic texture segmentation based on k-means clustering technique and cooccurrence texture features. A set of up to eight features were extracted from a 256 grey-level co-occurrence information. These features were used to segment image regions regarding the textural homogeneity of its areas. As the process of calculating co-occurrence information demands the majority of computational time required,we propose a new methodology based on a grey-level cooccurrence indexed list (GLCIL) for fast element access and highly optimize this step in the algorithm. Besides that, we compare the efficiency of the proposed method against the GLCM and GLCLL algorithms. The GLCIL shows to be the most efficient method in terms of computational time. Additionally, traditional Brodatz textures and others examples of the literature were tested to evaluate the appropriateness and robustness of the method. |
| Arrangement | urlib.net > SDLA > Fonds > SIBGRAPI 2007 > Automatic Texture Segmentation... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| data URL | http://urlib.net/ibi/6qtX3pFwXQZG2LgkFdY/Rwwsf |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZG2LgkFdY/Rwwsf |
| Language | en |
| Target File | lucasfinal.pdf |
| User Group | aconci@ic.uff.br administrator |
| Visibility | shown |
| 5. Allied materials | |
| Mirror Repository | sid.inpe.br/sibgrapi@80/2007/08.02.16.22 |
| Next Higher Units | 8JMKD3MGPEW34M/46SF8Q5 |
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.14.00.14 65 sid.inpe.br/banon/2001/03.30.15.38.24 8 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi e-mailaddress edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume |