Share Email Print

Proceedings Paper

Fast implementation of the basis matrix and block basis matrix representation for morphological filters
Author(s): Aldo W. Morales; Sung-Jea Ko; Kyung-Hoon Lee
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper presents a fast implementation method for grayscale function processing (FP) systems. The proposed method is based on the matrix representation of the FP system using the basis matrix (BM) and the block basis matrix (BBM). The computational efficiency derives from recursive algorithms based on some characteristics of the BM and BBM matrices. 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 open-closing and close-opening by 4N - 4 additions and 4N - 4 comparisons, when the size of the GSE is equal to N.

Paper Details

Date Published: 28 March 1995
PDF: 12 pages
Proc. SPIE 2424, Nonlinear Image Processing VI, (28 March 1995); doi: 10.1117/12.205224
Show Author Affiliations
Aldo W. Morales, The Pennsylvania State Univ. (United States)
Sung-Jea Ko, Korea Univ. (South Korea)
Kyung-Hoon Lee, Korea Univ. (South Korea)

Published in SPIE Proceedings Vol. 2424:
Nonlinear Image Processing VI
Edward R. Dougherty; Jaakko T. Astola; Harold G. Longbotham; Nasser M. Nasrabadi; Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top