Abstract
It is shown that in one-dimensional (1-D) recursive median (RM) filtering, the present output is fully determined by the input data in the window and by the most recent output. All other past outputs are shown to be redundant. Based on this result, efficient algorithms and VLSI implementation for 1-D RM filters are presented, and shown to compete favorably with those for standard median (SM) filtering.
Original language | English |
---|---|
Pages (from-to) | 1447-1450 |
Number of pages | 4 |
Journal | IEEE Transactions on Circuits and Systems |
Volume | 37 |
Issue number | 11 |
DOIs | |
Publication status | Published - 1990 Nov |
Externally published | Yes |
Bibliographical note
Funding Information:Manuscript received January 24, 1990. This work was supported by the National Science Foundation under Grant DC1-8611859, and by the United States Air Force under Contract F30602-88-D-0025, Task C-8-2400. This paper was recommended by Associate Editor P. H. Bauer. S.-J. KO is with the Department of Electrical and Computer Engineering, University of Michigan, Dearborn, MI 48128. Y. H. Lee is with the Department of Electrical Engineering, Korea Advanced Institute of Science and Technology, Cheongryang, Seoul, Korea. A. T. Farn is with the Department of Electrical and Computer Engineering, State University of New York, Buffalo, NY 14260. IEEE Log Number 9038555.
ASJC Scopus subject areas
- General Engineering