Distrbuted Processing and Design of RMESH Parallel Algorithms for Median Filters


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 11, pp. 2845-2854, Nov. 1998
10.3745/KIPSTE.1998.5.11.2845,   PDF Download:

Abstract

Median filter can be implemented in the binary domain based on threshold decomposition, stacking property, and linear separability. In this paper, we develop one-dimensional and two-dimensional parallel algorithms for the median filter on a reconfigurable mesh with buses(RMESH) which is suitable for VLSI implementation. And we evaluate their performance by comparing the time complexities of RMESH algorithms with those of algorithms on mesh-connected computer. When the length of M-valued 1-D signal is N and w is the window width, the RMESH algorithm is done in O(Mw) time and algorithm is done in (O(Mw^2) time. Besides, when the size of M-valued 2-D image is N×N and the window size is w×w, our algorithm on N×N RMESH can be computed in O(Mw) time which is a significant improvement over the O(Mw^2) complexity on N×N mesh.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. B. Moon and J. C. Sung, "Distrbuted Processing and Design of RMESH Parallel Algorithms for Median Filters," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 11, pp. 2845-2854, 1998. DOI: 10.3745/KIPSTE.1998.5.11.2845.

[ACM Style]
Jeon Byeong Moon and Jeong Chang Sung. 1998. Distrbuted Processing and Design of RMESH Parallel Algorithms for Median Filters. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 11, (1998), 2845-2854. DOI: 10.3745/KIPSTE.1998.5.11.2845.