From min tree to watershed lake tree: Evaluation

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

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

Abstract

Recently, several tree based hierarchical image descriptions have been proposed for image segmentation and analysis. This paper considers the problem of evaluating such algorithms. Recently we proposed a new algorithm for constructing the watershed lake tree by transforming the min tree structure as these two image trees share some similarities. We use this algorithm to illustrate the evaluation approach. The algorithm is evaluated by considering its computational complexity, memory usage and the cost of manipulating the resulting tree structure. Our results show that considerable care is needed when evaluating algorithms of this kind. In particular, comparisons cannot be made simply on the basis of computational complexity alone and other parameters such as image/tree ‘complexity’ also need to be considered.

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:25
Last Modified: 25 Jul 2019 03:21
URI: https://ueaeprints.uea.ac.uk/id/eprint/23499
DOI: 10.1007/978-3-540-30125-7_106

Actions (login required)

View Item View Item