DocumentCode
1442532
Title
Fast algorithms for running ordering and max/min calculation
Author
Pitas, Ioannis
Author_Institution
Dept. of Electr. Eng., Thessaloniki Univ., Greece
Volume
36
Issue
6
fYear
1989
fDate
6/1/1989 12:00:00 AM
Firstpage
795
Lastpage
804
Abstract
Order statistics are used in a variety of filtering techniques (e.g. median, α-trimmed mean, nonlinear order statistics filtering, morphological filtering). Their computation is relatively fast, because it requires only comparisons. The author presents an algorithm that requires a significantly smaller number of comparisons and is significantly faster than the traditional approach to order statistics filtering. Also proposed are filter structures for order statistics filtering that are much faster than the known sorting structures
Keywords
computational complexity; digital filters; filtering and prediction theory; minimax techniques; signal processing; α-trimmed mean; fast algorithms; filter structures; filtering techniques; max/min calculation; median filtering; morphological filtering; nonlinear order statistics filtering; running ordering; signal processing; Arithmetic; Circuits and systems; Computational complexity; Filtering algorithms; Maximum likelihood detection; Nonlinear filters; Pixel; Shape; Sorting; Statistics;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/31.90400
Filename
90400
Link To Document