Paper
1 July 1990 Three-dimensional mathematical morphology algorithms
Kendall Preston Jr.
Author Affiliations +
Proceedings Volume 1246, Parallel Architectures for Image Processing; (1990) https://doi.org/10.1117/12.19579
Event: Electronic Imaging: Advanced Devices and Systems, 1990, Santa Clara, CA, United States
Abstract
This paper discusses three-dimensional mathematical morphology using FCC (Face Centered Cubic) tessellation for executing both augmentation (dilation) and reduction (erosion). By treating gray level images as three-dimensional surfaces and using this tessellation with its 12-element neighborhood, the author has designed an architecture having flash-convolver speed for use in gray level image processing. The first step in this novel approach is to convert the gray level image into a binary surface by column encoding. After conversion the gray level image consists of volume elements (voxels) each of which has a binary value of either one or zero. The FCC convolution kernel is then ud to address each voxel and modify its value according a lookup table consisting of 213 = 8192 entries. This paper will describe the algorithms which can be executed using this methodology.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kendall Preston Jr. "Three-dimensional mathematical morphology algorithms", Proc. SPIE 1246, Parallel Architectures for Image Processing, (1 July 1990); https://doi.org/10.1117/12.19579
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
3D image processing

Mathematical morphology

Binary data

Image processing

Fractal analysis

Computer programming

Convolution

RELATED CONTENT

ADA interpretative system for image algebra
Proceedings of SPIE (June 01 1992)
Microstructural analysis of lignocellulosic fiber networks
Proceedings of SPIE (September 07 2006)
Comparison of connected-component algorithms
Proceedings of SPIE (August 27 1999)
Efficient computation of various types of skeletons
Proceedings of SPIE (June 01 1991)

Back to Top