Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier6qtX3pFwXQZeBBx/w65xt
Repositorysid.inpe.br/banon/2002/11.07.10.25
Last Update2002:11.06.02.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/banon/2002/11.07.10.25.26
Metadata Last Update2024:03.23.15.30.53 (UTC) administrator
DOI10.1109/SIBGRA.2000.883925
Citation KeyZampirolliLott:2000:ClDiTr
TitleClassification of the distance transformation algorithms under the mathematical morphology approach
Year2000
Access Date2024, May 04
Number of Files1
Size432 KiB
2. Context
Author1 Zampirolli, Francisco de Assis
2 Lottufo, Roberto de Alencar
EditorCarvalho, Paulo Cezar Pinto
Walter, Marcelo
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)
Conference LocationGramado, RS, Brazil
Date17-20 Oct. 2000
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Pages292-299
Book TitleProceedings
Tertiary TypeFull Paper
OrganizationSBC - Brazilian Computer Society
History (UTC)2008-07-17 14:10:51 :: administrator -> banon ::
2008-08-26 15:23:02 :: banon -> administrator ::
2009-08-13 20:37:01 :: administrator -> banon ::
2010-08-28 20:00:11 :: banon -> administrator ::
2024-03-23 15:30:53 :: administrator -> :: 2000
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsimage processing
distance transformation algorithm classification
mathematical morphology
binary image
distance metric
parallel algorithms
sequential raster algorithms
propagation algorithms
computer architectures
image processing
AbstractThe distance transform (DT) is a morphological erosion of the binary image by a given structuring function, that dictates the distance metric in the transformation. There are many known algorithms and structuring function decompositions to efficiently implement a morphological erosion. Most of the erosion algorithms are classified as parallel, sequential raster (and anti-raster), and propagation. Based on this classification and decomposition, we review and classify most of the DT algorithms reported in the literature. As a result of this study, we have contributed not only to better classify and understand the diversity of the DT algorithms in the literature, but also to create a collection of efficient erosion algorithms suitable to different computer architectures.
Arrangement 1MM > Classification of the...
Arrangement 2urlib.net > SDLA > Fonds > SIBGRAPI 2000 > Classification of the...
Arrangement 3urlib.net > SDLA > Fonds > Full Index > Classification of the...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/6qtX3pFwXQZeBBx/w65xt
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/w65xt
Target File292-299.pdf
User Groupadministrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPCW/4AUUH9L
8JMKD3MGPEW34M/46PN6AP
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/06.10.21.49 3
sid.inpe.br/sibgrapi/2022/04.27.03.08 3
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
NotesThe conference was held in Gramado, RS, Brazil, from October 17 to 20.
Empty Fieldsaffiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label language 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


Close