Fine-tuned High-speed Implementation of a GPU-based Median Filter
Author(s) -
Gilles Perrot,
Stéphane Domas,
Raphaël Couturier
Publication year - 2013
Publication title -
journal of signal processing systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.276
H-Index - 51
eISSN - 1939-8018
pISSN - 1939-8115
DOI - 10.1007/s11265-013-0799-2
Subject(s) - median filter , computer science , implementation , pixel , filter (signal processing) , kernel (algebra) , noise reduction , cuda , noise (video) , speedup , general purpose computing on graphics processing units , artificial intelligence , parallel computing , algorithm , computer vision , image processing , computer graphics (images) , mathematics , image (mathematics) , graphics , combinatorics , programming language
Median filtering is a well-known method used in a wide range of application frameworks as well as a standalone filter, especially for salt-and-pepper denoising. It is able to highly reduce the power of noise while minimizing edge blurring. Currently, existing algorithms and implementations are quite efficient but may be improved as far as processing speed is concerned, which has led us to further investigate the specificities of modern GPUs. In this paper, we propose the GPU implementation of fixed-size kernel median filters, able to output up to 1.85 billion pixels per second on C2070 Tesla cards. Based on a Branchless Vectorized Median class algorithm and implemented through memory fine tuning and the use of GPU registers, our median drastically outperforms existing implementations, resulting, as far as we know, in the fastest median filter to date.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom