<?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>83LX3pFwXQZ4BFjAq/jiHSg</identifier>
		<repository>dpi.inpe.br/vagner/1999/11.29.10.13</repository>
		<lastupdate>2000:01.03.02.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2001/03.30.15.58.31</metadatarepository>
		<metadatalastupdate>2024:03.23.15.30.51 sid.inpe.br/bibdigital@80/2006/04.07.15.50 administrator</metadatalastupdate>
		<doi>10.1109/SIBGRA.1999.805737</doi>
		<citationkey>MadeiraBarrJrHira:1999:BiDeDi</citationkey>
		<title>A new paradigm for the architecture of morphological machines: binary decision diagrams</title>
		<year>1999</year>
		<numberoffiles>3</numberoffiles>
		<size>242 KiB</size>
		<author>Madeira, Heraldo M. F.,</author>
		<author>Barrera, J.,</author>
		<author>Jr., R. Hirata,</author>
		<author>Hirata, N. S. T.,</author>
		<editor>Stolfi, Jorge,</editor>
		<editor>Tozzi, Clésio Luis,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 12 (SIBGRAPI)</conferencename>
		<conferencelocation>Campinas, SP, Brazil</conferencelocation>
		<date>17-20 Oct. 1999</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<pages>293-301</pages>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<organization>SBC - Brazilian Computer Society and UNICAMP - University of Campinas</organization>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>mathematical morphology, morphological machine, architecture.</keywords>
		<abstract>A central paradigm in Mathematical Morphology (MM) is the representation of set operators in terms of erosions, intersection, union, complementation and composition. A hardware or software that implement this decomposition structure is called a morphological machine (MMach). The architecture of all known MMachs has a central characteristic a small kernel with very fast procedures. Another well known decomposition result in MM is the defined) as an union of sup-generating (i.e., hit-or-miss) operators. In particular, erosion is a sup-generating operator. A remarkable property of this decomposition structure is that it can be represented efficiently by a graph called Binary Decision Diagram (BDD). In this paper, we propose a new architecture for an MMach that is based on BDDs and we compare it with the conventional architecture.</abstract>
		<targetfile>060-02082546.pdf</targetfile>
		<usergroup>administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPCW/4AUUH9L</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/46PDF8P</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/04.25.03.44 4</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<notes>The conference was held in Campinas, SP, 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-/dpi.inpe.br/vagner/1999/11.29.10.13</url>
	</metadata>
</metadatalist>