A FAST IMPLEMENTATION ALGORITHM AND A BIT-SERIAL REALIZATION METHOD FOR GRAYSCALE MORPHOLOGICAL OPENING AND CLOSING

Citation
Sj. Ko et al., A FAST IMPLEMENTATION ALGORITHM AND A BIT-SERIAL REALIZATION METHOD FOR GRAYSCALE MORPHOLOGICAL OPENING AND CLOSING, IEEE transactions on signal processing, 43(12), 1995, pp. 3058-3061
Citations number
13
Categorie Soggetti
Engineering, Eletrical & Electronic
ISSN journal
1053587X
Volume
43
Issue
12
Year of publication
1995
Pages
3058 - 3061
Database
ISI
SICI code
1053-587X(1995)43:12<3058:AFIAAA>2.0.ZU;2-I
Abstract
This paper presents a fast real-time software implementation method fo r the grayscale morphological function processing (FP) opening and clo sing. The proposed method utilizes a basis matrix composed of structur ing elements. It is shown that opening and closing can be accomplished by a local matrix operation in real time rather than the cascade oper ation (erosion/dilation followed by dilation/erosion), which requires large amount of delays and memory storage for the intermediate erosion /dilation outputs. In the second part of this correspondence, a bit-se rial implementation architecture for the grayscale morphological FP op erators is presented. The proposed implementation architecture employs a bit-serial approach that allows grayscale morphological FP operator s is presented. The proposed implementation architecture employs a bit -serial approach that allows grayscale morphological operations to be decomposed into bit-level binary operation units for the p-b grayscale signal. It is shown that this realization is simple and modular in st ructure and thus is suitable for VLSI implementations.