DocumentCode
812956
Title
On computation of the running median
Author
Astola, Jaakko T. ; Campbell, T. George
Author_Institution
Comput. Syst. Lab., Tampere Univ. of Technol., Finland
Volume
37
Issue
4
fYear
1989
fDate
4/1/1989 12:00:00 AM
Firstpage
572
Lastpage
574
Abstract
A fast median filtering algorithm with logarithmic time complexity is presented that is based on a special data structure, a double heap, which naturally supports the median. With slight modification, the approach can be used to implement any rank-order filter. A complete implementation of the algorithm has been tested as a global Modula-2 module and has the expected performance and correctness
Keywords
digital filters; filtering and prediction theory; fast median filtering algorithm; global Modula-2 module; logarithmic time complexity; rank-order filter; running median; special data structure; Biomedical engineering; Data structures; Digital filters; Digital signal processing; Filtering; Frequency domain analysis; Nonlinear filters; Signal processing; Signal processing algorithms; Speech processing;
fLanguage
English
Journal_Title
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
0096-3518
Type
jour
DOI
10.1109/29.17539
Filename
17539
Link To Document