<?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>83LX3pFwXQZeBBx/aE3Bz</identifier>
		<repository>dpi.inpe.br/banon/1997/10.03.09.49</repository>
		<lastupdate>1998:06.16.03.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2001/03.30.15.38.44</metadatarepository>
		<metadatalastupdate>2024:03.23.15.30.49 sid.inpe.br/bibdigital@80/2006/04.07.15.50 administrator</metadatalastupdate>
		<citationkey>BarreraHira:1997:FaAlCo</citationkey>
		<title>Fast algorithms to compute the elementary operators of mathematical morphology</title>
		<year>1997</year>
		<numberoffiles>4</numberoffiles>
		<size>136 KiB</size>
		<author>Barrera, Junior,</author>
		<author>Hirata Junior, Roberto,</author>
		<editor>Figueiredo, Luiz Henrique de,</editor>
		<editor>Netto, Marcio Lobo,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 10 (SIBGRAPI)</conferencename>
		<conferencelocation>Campos de Jordão, SP, Brazil</conferencelocation>
		<date>Oct. 1997</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<pages>163-170</pages>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<organization>SBC - Sociedade Brasileira de Computação; USP - Universidade de São Paulo</organization>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>mathematical morphology, image operator, morphological representation, fast algorithm, elementary operator, dilation, reconstruction, queue.</keywords>
		<abstract>Mathematical Morphology (MM) studies the representation of image operators in terms of some families of simple operators, called the elementary operators of MM. A drawback of this approach is that the representation of some operators is not efficient, since it uses a large number of elementary operators. Fast algorithms are the solution found by some authors to implement image operators that have complex representations. Two drawbacks of this solution are: i- they change the architecture of the software that implement the operators by the morphological representation. ii- these implementations are very specific and can not be used to implement other operators. Here, we study some of these fast algorithms and show that they can be transformed into morphological representations with equivalent performance, if proper data structures and algorithms are used to implement the elementary operators. Finally, some experimental results that illustrate these ideas are given.</abstract>
		<language>en</language>
		<targetfile>art09.pdf</targetfile>
		<usergroup>administrator</usergroup>
		<visibility>shown</visibility>
		<readpermission>allow from all</readpermission>
		<nexthigherunit>83LX3pFwXQZeBBx/cpksS</nexthigherunit>
		<nexthigherunit>8JMKD3MGPCW/4AUUH9L</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/46RL7SS</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/05.08.23.46 5</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<notes>This work has been partially supported by ProTeM-CC/CNPq through the AnIMoMat project, contract 680067/94-9. The conference was held in Campos de Jordão, SP, Brazil, from October 13 to 16.</notes>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/dpi.inpe.br/banon/1997/10.03.09.49</url>
	</metadata>
</metadatalist>