Abstract
A real-time implementation method for the most general morphological system, the so-called grayscale function processing (FP) system is presented. The proposed method is an extension of our previous works [5], [6] using the matrix representation of the FP system with a basis matrix (BM) and a block basis matrix (BBM) composed of grayscale structuring elements (GSE). In order to further improve the computational efficiency of the basis matrix representation, we propose recursive algorithms based on the observation of the BM and BBM. The efficiency of the proposed algorithms is gained by avoiding redundant steps in computing overlapping local maximum or minimum operations. It is shown that, with the proposed scheme, both opening and closing can be determined in real time by 2N - 2 additions and 2N - 2 comparisons, and OC and CO by 4N - 4 additions and 4N - 4 comparisons, when the size of the GSE is equal to N. It is also shown that the proposed recursive opening and closing require only 3N - 3 memory elements.
| Original language | English |
|---|---|
| Pages (from-to) | 1073-1077 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Image Processing |
| Volume | 5 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 1996 Dec 1 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Graphics and Computer-Aided Design
- Software
- Theoretical Computer Science
- Computational Theory and Mathematics
- Computer Vision and Pattern Recognition
Cite this
Fast recursive algorithms for morphological operators based on the basis matrix representation. / Ko, Sung-Jea; Morales, Aldo; Lee, Kyung Hoon.
In: IEEE Transactions on Image Processing, Vol. 5, No. 6, 01.12.1996, p. 1073-1077.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Fast recursive algorithms for morphological operators based on the basis matrix representation
AU - Ko, Sung-Jea
AU - Morales, Aldo
AU - Lee, Kyung Hoon
PY - 1996/12/1
Y1 - 1996/12/1
N2 - A real-time implementation method for the most general morphological system, the so-called grayscale function processing (FP) system is presented. The proposed method is an extension of our previous works [5], [6] using the matrix representation of the FP system with a basis matrix (BM) and a block basis matrix (BBM) composed of grayscale structuring elements (GSE). In order to further improve the computational efficiency of the basis matrix representation, we propose recursive algorithms based on the observation of the BM and BBM. The efficiency of the proposed algorithms is gained by avoiding redundant steps in computing overlapping local maximum or minimum operations. It is shown that, with the proposed scheme, both opening and closing can be determined in real time by 2N - 2 additions and 2N - 2 comparisons, and OC and CO by 4N - 4 additions and 4N - 4 comparisons, when the size of the GSE is equal to N. It is also shown that the proposed recursive opening and closing require only 3N - 3 memory elements.
AB - A real-time implementation method for the most general morphological system, the so-called grayscale function processing (FP) system is presented. The proposed method is an extension of our previous works [5], [6] using the matrix representation of the FP system with a basis matrix (BM) and a block basis matrix (BBM) composed of grayscale structuring elements (GSE). In order to further improve the computational efficiency of the basis matrix representation, we propose recursive algorithms based on the observation of the BM and BBM. The efficiency of the proposed algorithms is gained by avoiding redundant steps in computing overlapping local maximum or minimum operations. It is shown that, with the proposed scheme, both opening and closing can be determined in real time by 2N - 2 additions and 2N - 2 comparisons, and OC and CO by 4N - 4 additions and 4N - 4 comparisons, when the size of the GSE is equal to N. It is also shown that the proposed recursive opening and closing require only 3N - 3 memory elements.
UR - http://www.scopus.com/inward/record.url?scp=0030164853&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0030164853&partnerID=8YFLogxK
U2 - 10.1109/83.503923
DO - 10.1109/83.503923
M3 - Article
VL - 5
SP - 1073
EP - 1077
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
SN - 1057-7149
IS - 6
ER -