| 1. Identity statement | |
| Reference Type | Conference Paper (Conference Proceedings) |
| Site | sibgrapi.sid.inpe.br |
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH |
| Identifier | 6qtX3pFwXQZeBBx/wmcb3 |
| Repository | sid.inpe.br/banon/2002/12.03.11.53 |
| Last Update | 2002:11.28.02.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/banon/2002/12.03.11.53.44 |
| Metadata Last Update | 2022:06.14.00.12.28 (UTC) administrator |
| DOI | 10.1109/SIBGRAPI.2001.963066 |
| Citation Key | AndradeVemu:2001:InAlIm |
| Title | An interactive algorithm for image denoising and segmentation  |
| Year | 2001 |
| Access Date | 2025, May 09 |
| Number of Files | 1 |
| Size | 1847 KiB |
| 2. Context | |
| Author | 1 Andrade, Marcos Carneiro de 2 Vemuri, Baba C. |
| Editor | Borges, Leandro Díbio Wu, Shin-Ting |
| Conference Name | Brazilian Symposium on Computer Graphics and Image Processing, 14 (SIBGRAPI) |
| Conference Location | Florianópolis, SC, Brazil |
| Date | 15-18 Oct. 2001 |
| Publisher | IEEE Computer Society |
| Publisher City | Los Alamitos |
| Pages | 274-281 |
| Book Title | Proceedings |
| Tertiary Type | Full Paper |
| Organization | SBC - Brazilian Computer Society |
| History (UTC) | 2008-07-17 14:10:54 :: administrator -> banon :: 2008-08-26 15:22:04 :: banon -> administrator :: 2009-08-13 20:37:17 :: administrator -> banon :: 2010-08-28 20:00:14 :: banon -> administrator :: 2022-06-14 00:12:28 :: administrator -> :: 2001 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Version Type | finaldraft |
| Keywords | image segmentation curve evolution PDE level set watershed smoothing |
| Abstract | This paper presents an interactive algorithm for image denoising and segmentation. A global competition criterion is used to impose an order of processing on all image pixels. The smoothing step employs an evolution equation controlled by the local curvature to denoise the image while preserving the features. The interactive segmentation step requires the user to select one definitive seed per region. Region growing is initiated around provisory seeds, which are automatically detected, labeled and eventually merged by the algorithm. A simple merging mechanism is used to handle the topological transformations required to remove the image over-segmentation. It is shown that accurate and fast segmentation results can be achieved for gray and color images using this simple method. Extension to 3D images is straightforward and easily handled. |
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2001 > An interactive algorithm... |
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > An interactive algorithm... |
| 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/6qtX3pFwXQZeBBx/wmcb3 |
| zipped data URL | http://urlib.net/zip/6qtX3pFwXQZeBBx/wmcb3 |
| Language | en |
| Target File | 274-281.pdf |
| User Group | administrator |
| Visibility | shown |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPEW34M/46Q6TJ5 8JMKD3MGPEW34M/4742MCS |
| Citing Item List | sid.inpe.br/sibgrapi/2022/04.29.19.35 40 sid.inpe.br/sibgrapi/2022/06.10.21.49 5 |
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 |
| 6. Notes | |
| Notes | The conference was held in Florianópolis, SC, Brazil, from October 15 to 18. |
| Empty Fields | affiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume |