@InProceedings{MadeiraBarr:2000:InEvBD,
               author = "Madeira, Heraldo M. F. and Barrera, Junior",
                title = "Incremental evaluation of BDD-represented set operators",
            booktitle = "Proceedings...",
                 year = "2000",
               editor = "Carvalho, Paulo Cezar Pinto and Walter, Marcelo",
                pages = "308--315",
         organization = "Brazilian Symposium on Computer Graphics and Image Processing, 13. 
                         (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
                 note = "The conference was held in Gramado, RS, Brazil, from October 17 to 
                         20.",
             keywords = "mathematical 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.",
             abstract = "In 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.",
  conference-location = "Gramado, RS, Brazil",
      conference-year = "17-20 Oct. 2000",
                  doi = "10.1109/SIBGRA.2000.883927",
                  url = "http://dx.doi.org/10.1109/SIBGRA.2000.883927",
         organisation = "SBC - Brazilian Computer Society",
                  ibi = "6qtX3pFwXQZeBBx/w9yoH",
                  url = "http://urlib.net/ibi/6qtX3pFwXQZeBBx/w9yoH",
           targetfile = "308-315.pdf",
        urlaccessdate = "2024, May 04"
}