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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cichosz, J., Meyer, F.: Morphological multiscale image segmentation. In: WIAMIS 1997, pp. 161–166 (1997)
Bangham, J.A., Hidalgo, J.R., Harvey, R., Cawley, G.: The segmentation of images via scale-space trees. In: 9th BMVC, pp. 33–43 (1998)
Fisher, M., Aldrige, R.: Hierarchical segmentation of images using a watershed scale-space trees. In: IEEE Int. Conf. Image Processing and its Applications, pp. 522–526 (1999)
Huang, X., Fisher, M., Smith, D.: An efficient implementation of max tree with linked list and hash table. In: Proceedings of International Conference on Digital Image Computing-Techniques and Applications, Macquarie University, Sydney, Australia, pp. 299–308 (December 2003)
Huang, X., Fisher, M., Zhu, Y.: From min tree to watershed lake tree:theory and implementation. In: Proceedings of Int’l Conf. on Image Analysis and Recognition, Porto, Portugal (2004)
Jones, R.: Connected filtering and segmentation using component trees. Computer Vision and Image Understanding 75(3), 215–228 (1999)
Meijster, A., Wilkinson, M.: A comparison of algorithms for connected set openings and closings. IEEE PAMI 24(4), 484–494 (2002)
Monasse, P., Guichard, F.: Scale-space from a level lines tree. Journal of Visual Communication and Image Representation 11(2), 224–236 (2000)
Ostermann, L.G.: Hierarchical Region Based Processing of Image and Video Sequences: Application to Filtering, Segmentation and Information Retrieval. PhD thesis, Department of Signal Theory and Communications, Universitat Politecnica de Catalunya, Barcelona, Spain (April 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, X., Fisher, M. (2004). From Min Tree to Watershed Lake Tree: Evaluation. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2004. Lecture Notes in Computer Science, vol 3211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30125-7_106
Download citation
DOI: https://doi.org/10.1007/978-3-540-30125-7_106
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23223-0
Online ISBN: 978-3-540-30125-7
eBook Packages: Springer Book Archive