DocumentCode :
3340149
Title :
A fast weighted median algorithm based on Quickselect
Author :
Rauh, André ; Arce, Gonzalo R.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Delaware, Delaware, OH, USA
fYear :
2010
fDate :
26-29 Sept. 2010
Firstpage :
105
Lastpage :
108
Abstract :
Weighted median filters are increasingly being used in signal processing applications and thus fast implementations are of importance. This paper introduces a fast algorithm to compute the weighted median of N samples which has linear time and space complexity as opposed to O(N logN) which is the time complexity of traditional sorting algorithms. The proposed algorithm is based on Quickselect which is closely related to the well known Quicksort. We compare the runtime and the complexity to Floyd and Rivest´s algorithm SELECT which to date has been the fastest median finding algorithm and show that our algorithm is up to 30% faster.
Keywords :
median filters; sorting; Quickselect; Quicksort; signal processing; sorting algorithms; weighted median filters; Algorithm design and analysis; Arrays; Complexity theory; Cost function; Partitioning algorithms; Runtime; Signal processing algorithms; Algorithms; Median filters;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Image Processing (ICIP), 2010 17th IEEE International Conference on
Conference_Location :
Hong Kong
ISSN :
1522-4880
Print_ISBN :
978-1-4244-7992-4
Electronic_ISBN :
1522-4880
Type :
conf
DOI :
10.1109/ICIP.2010.5651855
Filename :
5651855
Link To Document :
بازگشت