Paper
1 February 1990 Image Analysis With The Septree Data Structure
G. A. Baraghimian
Author Affiliations +
Proceedings Volume 1197, Automated Inspection and High-Speed Vision Architectures III; (1990) https://doi.org/10.1117/12.969943
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States
Abstract
This paper surveys hierarchical algorithms used in the analysis of image data under hexagonal planar decomposition. Part of the motivation for these algorithms is that practical parallel image processing devices have been based on hexagonal decomposition. The advantages of the hexagonal covering are based on the 'uniform adjacency property: each element is adjacent to exactly six others, shares with each exactly one-sixth of its boundary, and has identical distance between its centroid and those of its neighbors. We describe the septree: a seven-descendant hierarchical data structure based on decomposing a roughly-hexagonal planar region into a central hexagon and its six neighbors. Septree algorithms used for low-level image pre-processing, image segmentation, and feature extraction are surveyed. The results presented here for static two-dimensional scenes can be extended to three-dimensional analogies. These can be used in computer vision models and in time-sequences of images for robots.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
G. A. Baraghimian "Image Analysis With The Septree Data Structure", Proc. SPIE 1197, Automated Inspection and High-Speed Vision Architectures III, (1 February 1990); https://doi.org/10.1117/12.969943
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image processing

Image analysis

Image enhancement

Inspection

Image processing algorithms and systems

Binary data

Back to Top