From min tree to watershed lake tree: Theory and implementation

X. Huang, M. H. Fisher, Y. Zhu

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

Segmentation is a classical problem in image processing that has been an active research topic for more than three decades. Classical tools provided by mathematical morphology for segmenting images are the connected set operators and the watershed transformation. Both of these operations can be applied to form hierarchies of nested partitions at increasing scales. This paper studies two image partition hierarchies founded in mathematical morphology, namely the max/min tree and the watershed lake tree. By considering watershed and max/min tree image descriptions we show that a watershed lake tree comprises a subset of min tree vertices.
Original languageEnglish
Title of host publicationImage Analysis and Recognition
EditorsAurélio Campilho, Mohamed Kamel
PublisherSpringer Berlin / Heidelberg
Pages848-857
Number of pages10
Volume3211
ISBN (Print)978-3-540-23223-0
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg

Cite this