The shape-tree semilattice is a new framework for quasi-self-dual morphological processing, where eroded images have all shapes shrunk in a contrast-invariant way. This approach was recently introduced, and is further investigated here. Apart of reviewing their original definition, different algorithms for computing the shape-tree morphological operators are presented.
KeywordsComplete inf-semilattices self-dual operators tree of shapes fillhole
Unable to display preview. Download preview PDF.
- R. Keshet, “Shape-Tree Semilattice,” Journal of Mathematical Imaging and Vision, special issue of mathematical morphology after 40 years, scheduled to March 2005.Google Scholar
- J. Serra, Image Analysis and Mathematical Morphology, Vol. 1, London: Academic Press, 1982.Google Scholar
- P. Soille, Morphological Image Analysis: Principles and Applications, NY: Springer, 2nd edition, 2003.Google Scholar
- R. Keshet (Kresch), “Mathematical Morphology on Complete Semilattices and its Applications to Image Processing,” Fundamenta Informaticae, Vol. 41, Nos. 1–2, pp. 33–56, January 2000.Google Scholar
- C. Ballester, V. Caselles and P. Monasse, “The Tree of Shapes of an Image,” ESAIM: Control, Optimisation and Calculus of Variations, Vol. 9, pp. 1–18, 2003.Google Scholar