Close
Metadata

Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Identifier6qtX3pFwXQZeBBx/w9yoH
Repositorysid.inpe.br/banon/2002/11.13.12.12
Last Update2002:11.13.02.00.00 administrator
Metadatasid.inpe.br/banon/2002/11.13.12.13
Metadata Last Update2020:02.19.02.58.52 administrator
Citation KeyMadeiraBarr:2000:InEvBD
TitleIncremental evaluation of BDD-represented set operators
Year2000
DateOctober
Access Date2021, Jan. 19
Number of Files1
Size613 KiB
Context area
Author1 Madeira, Heraldo M. F.
2 Barrera, Junior
EditorCarvalho, Paulo Cezar Pinto
Walter, Marcelo
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)
Conference LocationGramado, RS, Brazil
Pages308-315
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Tertiary TypeFull Paper
OrganizationSBC - Brazilian Computer Society
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
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Keywordsmathematical morphology, mathematical morphology, formal language, vocabulary, morphological operators, translation invariant operators, locally defined set operators, 2D discrete W-operators, 3D discrete W-operators, reduced ordered binary decision diagram, equivalence proof.
AbstractIn mathematical morphology set operators are described by a formal language, whose vocabulary is composed of dilations, erosions, complementation, union and intersection. They are called morphological operators when expressed in this form. Translation invariant and locally defined set operators are called W-operators. Decision diagrams have been used as an alternative representation for some 2-D and 3-D discrete W-operators. This paper shows that the reduced and ordered binary decision diagram (ROBDD) is a non-ambiguous scheme for representing W-operators and presents a method to compute the ROBDD of any W-operator from a corresponding morphological operator. This procedure of computing decision diagrams can be applied to the automatic proof of equivalence between morphological operators, since the W-operator they represent are equal if and only if they have the same ROBDD.
source Directory Contentthere are no files
agreement Directory Contentthere are no files
Conditions of access and use area
data URLhttp://urlib.net/rep/6qtX3pFwXQZeBBx/w9yoH
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/w9yoH
Target File308-315.pdf
User Groupadministrator
Visibilityshown
Allied materials area
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
NotesThe conference was held in Gramado, RS, Brazil, from October 17 to 20.
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

Close