4 February 2011 A graph, non-tree representation of the topology of a gray scale image
Author Affiliations +
Proceedings Volume 7870, Image Processing: Algorithms and Systems IX; 78700O (2011); doi: 10.1117/12.871664
Event: IS&T/SPIE Electronic Imaging, 2011, San Francisco Airport, California, United States
Abstract
The paper provides a method of graph representation of gray scale images. For binary images, it is generally recognized that not only connected components must be captured, but also the holes. For gray scale images, there are two kinds of "connected components" - dark regions surrounded by lighter areas and light regions surrounded by darker areas. These regions are the lower and upper level sets of the gray level function, respectively. The proposed method represents the hierarchy of these sets, and the topology of the image, by means of a graph. This graph contains the well-known inclusion trees, but it is not a tree in general. Two standard topological tools are used. The first tool is cell decomposition: the image is represented as a combination of pixels as well as edges and vertices. The second tool is cycles: both the connected components and the holes are captured by circular sequences of edges.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Peter Saveliev, "A graph, non-tree representation of the topology of a gray scale image", Proc. SPIE 7870, Image Processing: Algorithms and Systems IX, 78700O (4 February 2011); doi: 10.1117/12.871664; https://doi.org/10.1117/12.871664
PROCEEDINGS
19 PAGES


SHARE
KEYWORDS
Binary data

Image processing

Image analysis

Image segmentation

Analytical research

Algorithm development

Video

RELATED CONTENT

Integrated circuit layer image segmentation
Proceedings of SPIE (September 14 2010)
Skeletons and watershed lines in digital spaces
Proceedings of SPIE (November 01 1990)
Concurrent image processing on hypercube multicomputers
Proceedings of SPIE (July 01 1990)

Back to Top