<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>6qtX3pFwXQZeBBx/w65xt</identifier>
		<repository>sid.inpe.br/banon/2002/11.07.10.25</repository>
		<lastupdate>2002:11.06.02.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2002/11.07.10.25.26</metadatarepository>
		<metadatalastupdate>2024:03.23.15.30.53 sid.inpe.br/bibdigital@80/2006/04.07.15.50 administrator</metadatalastupdate>
		<doi>10.1109/SIBGRA.2000.883925</doi>
		<citationkey>ZampirolliLott:2000:ClDiTr</citationkey>
		<title>Classification of the distance transformation algorithms under the mathematical morphology approach</title>
		<year>2000</year>
		<numberoffiles>1</numberoffiles>
		<size>432 KiB</size>
		<author>Zampirolli, Francisco de Assis,</author>
		<author>Lottufo, Roberto de Alencar,</author>
		<editor>Carvalho, Paulo Cezar Pinto,</editor>
		<editor>Walter, Marcelo,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)</conferencename>
		<conferencelocation>Gramado, RS, Brazil</conferencelocation>
		<date>17-20 Oct. 2000</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<pages>292-299</pages>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<organization>SBC - Brazilian Computer Society</organization>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>image processing,distance transformation algorithm classification,mathematical morphology,binary image,distance metric,parallel algorithms,sequential raster algorithms,propagation algorithms,computer architectures, image processing.</keywords>
		<abstract>The 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.</abstract>
		<targetfile>292-299.pdf</targetfile>
		<usergroup>administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPCW/4AUUH9L</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/46PN6AP</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/06.10.21.49 3</citingitemlist>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/04.27.03.08 3</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<notes>The conference was held in Gramado, RS, Brazil, from October 17 to 20.</notes>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2002/11.07.10.25</url>
	</metadata>
</metadatalist>