Abstract
In analyzing the morphological information of objects in images, isosurfaces play important and application-independent roles. For continuous scalar field, Contour Trees have been used as a tool to select and visualize isosurfaces. However, the tree structure of contour trees is based on the critical points which does not exist in digital images. In this paper, we propose a tree structure of isosurfaces in digital images named Region-based Contour Tree. The proposed method describes a finite number of isosurfaces in digital images completely, without redundancy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Salembier, P., Oliveras, A., Garrido, L.: Antiextensive connected operators for image and sequence processing. IEEE Trans. Image Processing 7(4), 555–570 (1998)
Meijster, A., Wilkinson, H.F.: A comparison of algorithms for connected set openings and closings. IEEE Trans. Pattern Analysis and Machine Intelligence 24(4), 484–494 (2002)
Fisher, M., Aldrige, R.: Hierarchical segmentation of images using a watershed scale-space trees. In: IEE Int. Conf. Image Processing and its Applications, pp. 522–526 (1999)
Huang, F.X., Fisher, M., Zhu, Y.: From min tree to watershed lake tree: theory and implementation. In: Campilho, A.C., Kamel, M.S. (eds.) ICIAR 2004. LNCS, vol. 3211, pp. 848–857. Springer, Heidelberg (2004)
Monasse, P., Guichard, F.: Scale-space from a level lines tree. Journal of Visual Communication and Image Representation 11, 224–236 (2000)
Boyell, R.W., Ruston, H.: Hybrid techniques for real-time radar simulation. IEEE Proceedings Fall Joint Computer Conference 63, 36–37 (1963)
Asano, T.: Mathematical Sciences (433), 34-40 (July 1999) (in Japanese)
Tarasov, S.P., Vyalyi, M.N.: Construction of contour trees in 3D in O(n log n) steps. In: Proceedings of the 14 th ACM Symposium on Computational Geometry, pp. 68–75. ACM, New York (1998)
van Kreveld, M., van Oostrum, R., Bajaj, C.L., Pascucci, V., Schikore, D.R.: Contour trees and small seed sets for isosurface traversal. In: Proceedings of the 13 th ACM Symposium on Computational Geometry, pp. 212–220. ACM, New York (1997)
Carr, H., Snoeyink, J., Axen, U.: Computing contour trees in all dimensions. Computational Geometry 24, 73–94 (2003)
Carr, H.: Topological Manipulation of Isosurfaces, PhD Thesis of The University of British Columbia (April 2004)
Pascucci, V., Cole-McLaughlin, K.: Efficient Computation of the Topology of Level sets. In: Proc. IEEE Visualization 2002, pp. 187–194 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mizuta, S., Matsuda, T. (2005). Description of Digital Images by Region-Based Contour Trees. In: Kamel, M., Campilho, A. (eds) Image Analysis and Recognition. ICIAR 2005. Lecture Notes in Computer Science, vol 3656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559573_68
Download citation
DOI: https://doi.org/10.1007/11559573_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29069-8
Online ISBN: 978-3-540-31938-2
eBook Packages: Computer ScienceComputer Science (R0)