Paper
16 December 1988 Pyramidal Image Processing Using Morphology
George Eichniann, Chao Lu, Jianxin Zhu, Yao Li
Author Affiliations +
Abstract
Linear pyramidal image processing (LPIP) is a form of multiresolution analysis in which a primary image is decomposed into a set of different resolution copies. LPIP aims to extract and interpret significant features of an image appearing at different resolutions. Morphological filtering, a nonlinear image processing technique, because of its simplicity of operation and its direct relation to the shapes in an image, has been widely studied. In this paper, the use of morphological filtering technique for a nonlinear pyramidal image processing (NPIP) is proposed. By using a set of desirably structured masks as the 'Structuring Elements" (SEs), a primary image is decomposed into a sequence of pyramidal image copies. For each Gaussian image pyramid, objects smaller than a predetermined image threshold size are filtered, while for each Laplacian pyramid, objects other than a predetermined size are blocked. For NPIP operation, pipelined and parallel software implementation algorithms are suggested. In order to reconstruct the original image, an inverse morphologic transform with some special Structuring Elements is considered.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
George Eichniann, Chao Lu, Jianxin Zhu, and Yao Li "Pyramidal Image Processing Using Morphology", Proc. SPIE 0974, Applications of Digital Image Processing XI, (16 December 1988); https://doi.org/10.1117/12.948427
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image filtering

Image processing

Binary data

Digital image processing

Selenium

Linear filtering

Nonlinear filtering

RELATED CONTENT

Logical context of nonlinear filtering
Proceedings of SPIE (April 01 1992)

Back to Top