Abstract
In this paper, we introduce efficient pipeline architectures for the recursive morphological operations. The standard morphological operation is applied directly on the original input image and produces an output image. The order of image scanning in which the operator is applied to the input pixels is irrelevant. However, the intent of the recursive morphological operations is to feed back the output at the current scanning pixel to overwrite its corresponding input pixel to be considered into computation at the following scanning pixels. The resultant output image by recursive morphology inherently depends on the image scanning sequence. Two pipelined implementations of the recursive morphological operations are presented. The design of an application-specific systolic array is first introduced. The systolic array uses 3 n cells to process an n x n image in 6 n-2 cycles. The cell utilization rate is 100%. Second, a parallel program implementing the recursive morphological operations and running on distributed-memory multicomputers is described. Performance of the program can be finely tuned by choosing appropriate partition parameters.
Original language | English (US) |
---|---|
Pages (from-to) | 11-18 |
Number of pages | 8 |
Journal | IEEE Transactions on Image Processing |
Volume | 4 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1995 |
All Science Journal Classification (ASJC) codes
- Software
- Computer Graphics and Computer-Aided Design