By Topic

Fast recursive algorithms for morphological operators based on the basis matrix representation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sung-Jea Ko ; Dept. of Electron. Eng., Korea Univ., Seoul, South Korea ; Morales, A. ; Kyung-Hoon Lee

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 (1993, 1995) 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

Published in:

Image Processing, IEEE Transactions on  (Volume:5 ,  Issue: 6 )