A Graph Formalism for Time and Memory Efficient Morphological Attribute-Space Connected Filters

Mohammad Babai, Ananda S. Chowdhury, Michael H. F. Wilkinson. A Graph Formalism for Time and Memory Efficient Morphological Attribute-Space Connected Filters. In Bernhard Burgeth, Andreas Kleefeld, Benoît Naegel, Nicolas Passat, Benjamin Perret, editors, Mathematical Morphology and Its Applications to Signal and Image Processing - 14th International Symposium, ISMM 2019, Saarbrücken, Germany, July 8-10, 2019, Proceedings. Volume 11564 of Lecture Notes in Computer Science, pages 281-294, Springer, 2019. [doi]

@inproceedings{BabaiCW19,
  title = {A Graph Formalism for Time and Memory Efficient Morphological Attribute-Space Connected Filters},
  author = {Mohammad Babai and Ananda S. Chowdhury and Michael H. F. Wilkinson},
  year = {2019},
  doi = {10.1007/978-3-030-20867-7_22},
  url = {https://doi.org/10.1007/978-3-030-20867-7_22},
  researchr = {https://researchr.org/publication/BabaiCW19},
  cites = {0},
  citedby = {0},
  pages = {281-294},
  booktitle = {Mathematical Morphology and Its Applications to Signal and Image Processing - 14th International Symposium, ISMM 2019, Saarbrücken, Germany, July 8-10, 2019, Proceedings},
  editor = {Bernhard Burgeth and Andreas Kleefeld and Benoît Naegel and Nicolas Passat and Benjamin Perret},
  volume = {11564},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-20867-7},
}