Description of digital images by region-based contour trees

Authors:
Shinobu Mizuta;Tetsuya Matsuda
Affiliations:
Kyoto University, Kyoto, Japan;Kyoto University, Kyoto, Japan
Venue:
ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Year:
2005

Citing 8
Cited 1

Contour trees and small seed sets for isosurface traversal

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Construction of contour trees in 3D in O(n log n) steps

Proceedings of the fourteenth annual symposium on Computational geometry
Efficient computation of the topology of level sets

Proceedings of the conference on Visualization '02
A Comparison of Algorithms for Connected Set Openings and Closings

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computing contour trees in all dimensions

Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Topological manipulation of isosurfaces

Topological manipulation of isosurfaces
Hybrid techniques for real-time radar simulation

AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
Antiextensive connected operators for image and sequence processing

IEEE Transactions on Image Processing

Describing shapes by geometrical-topological properties of real functions

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

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.