@InProceedings{BarreraHira:1997:FaAlCo,
               author = "Barrera, Junior and Hirata Junior, Roberto",
                title = "Fast algorithms to compute the elementary operators of 
                         mathematical morphology",
            booktitle = "Proceedings...",
                 year = "1997",
               editor = "Figueiredo, Luiz Henrique de and Netto, Marcio Lobo",
                pages = "163--170",
         organization = "Brazilian Symposium on Computer Graphics and Image Processing, 10. 
                         (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
                 note = "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{\~a}o, SP, Brazil, from October 13 to 
                         16.",
             keywords = "mathematical morphology, image operator, morphological 
                         representation, fast algorithm, elementary operator, dilation, 
                         reconstruction, queue.",
             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.",
  conference-location = "Campos de Jord{\~a}o, SP, Brazil",
      conference-year = "Oct. 1997",
             language = "en",
         organisation = "SBC - Sociedade Brasileira de Computa{\c{c}}{\~a}o; USP - 
                         Universidade de S{\~a}o Paulo",
                  ibi = "83LX3pFwXQZeBBx/aE3Bz",
                  url = "http://urlib.net/ibi/83LX3pFwXQZeBBx/aE3Bz",
           targetfile = "art09.pdf",
        urlaccessdate = "2024, May 03"
}