Reference TypeConference Proceedings
Citation KeyLotufoFalcZamp:2000:FaEuDi
Author1 Lotufo, Roberto A.
2 Falc„o, Alexandre A.
3 Zampirolli, Francisco A.
TitleFast Euclidean distance transform using a graph-search algorithm
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)
EditorCarvalho, Paulo Cezar Pinto
Walter, Marcelo
Publisher CityLos Alamitos
PublisherIEEE Computer Society
Conference LocationGramado, RS, Brazil
Keywordstree searching, Fast Euclidean distance transform, shortest path forest problem, shortest path graph-search, sequential algorithms, image processing.
AbstractTwo new Euclidean distance transform algorithms are described. The algorithms are designed using a shortest path graph-search framework. The distance transform can be seen as the solution of a shortest path forest problem. Previous works have dealt with the Euclidean distance transform (EDT) and with the shortest path forest problem, but none of them have presented an EDT using the graph-search approach. The proposed algorithms are very simple and yet belong to the class of one of the most efficient sequential algorithms. The algorithms easily extend to higher dimensions.
NotesThe conference was held in Gramado, RS, Brazil, from October 17 to 20.
OrganizationSBC - Brazilian Computer Society
Tertiary TypeFull Paper
Size400 KiB
Number of Files1
Target File269-275.pdf
Last Update2002: administrator
Metadata Last Update2020: administrator {D 2000}
Document Stagecompleted
Is the master or a copy?is the master
User Groupadministrator
Content TypeExternal Contribution
source Directory Contentthere are no files
agreement Directory Contentthere are no files
History2008-07-17 14:10:51 :: administrator -> banon ::
2008-08-26 15:23:02 :: banon -> administrator ::
2009-08-13 20:37:03 :: administrator -> banon ::
2010-08-28 20:00:11 :: banon -> administrator ::
2020-02-19 02:58:52 :: administrator -> :: 2000
Empty Fieldsaccessionnumber affiliation archivingpolicy archivist area booktitle callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi e-mailaddress edition electronicmailaddress format group holdercode isbn issn label language lineage mark mirrorrepository nextedition nexthigherunit numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume
Access Date2020, Nov. 28