29 April 2016 A novel fast median filter algorithm without sorting
Author Affiliations +
Abstract
As one of widely applied nonlinear smoothing filtering methods, median filter is quite effective for removing salt-andpepper noise and impulsive noise while maintaining image edge information without blurring its boundaries, but its computation load is the maximal drawback while applied in real-time processing systems. In order to solve the issue, researchers have proposed many effective fast algorithms and published many papers. However most of the algorithms are based on sorting operations so as to make real-time implementation difficult. In this paper considering the large scale Boolean calculation function and convenient shift operation which are two of the advantages of FPGA(Field Programmable Gate Array), we proposed a novel median value finding algorithm without sorting, which can find the median value effectively and its performing time almost keeps changeless despite how large the filter radius is. Based on the algorithm, a real-time median filter has been realized. A lot of tests demonstrate the validity and correctness of proposed algorithm.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Weiping Yang, Zhilong Zhang, Xinping Lu, Jicheng Li, Dong Chen, Guopeng Yang, "A novel fast median filter algorithm without sorting", Proc. SPIE 9897, Real-Time Image and Video Processing 2016, 98970A (29 April 2016); doi: 10.1117/12.2219847; https://doi.org/10.1117/12.2219847
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT

Real-time processing scheme based on RM estimators
Proceedings of SPIE (April 14 2003)
Image Registration Algorithm For A PC-Based System
Proceedings of SPIE (January 18 1988)
Cascaded RM-filter for remote sensing imaging
Proceedings of SPIE (November 10 2004)
Fast Adaptive Filtering With Special Hardware
Proceedings of SPIE (December 19 1985)

Back to Top