From min tree to watershed lake tree: Theory and implementation

Huang, X., Fisher, M. H. and Zhu, Y. (2004) From min tree to watershed lake tree: Theory and implementation. In: Image Analysis and Recognition. Lecture Notes in Computer Science, 3211 . Springer Berlin / Heidelberg, pp. 848-857. ISBN 978-3-540-23223-0

Full text not available from this repository. (Request a copy)

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.

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 14 Jun 2011 17:30
Last Modified: 22 Apr 2020 10:16
URI: https://ueaeprints.uea.ac.uk/id/eprint/23494
DOI: 10.1007/978-3-540-30125-7_105

Actions (login required)

View Item View Item