A New Fast Computation Method in Mean Filter

Article Preview

Abstract:

Mean of neighbor pixels is usually computed in image process, its computation cost is very high, which lead to the executing speed. A fast computation strategy is applied to get the mean of neighbor pixels. In our approach, the means of neighbor pixels located in fist column and line are computed, after that the iterative solution methods is adopted to compute neighbor means of pixels located in neighbor pixels of current pixel. The proposed approach do not change the filter result, but which can accelerate the running speed, especially for large image, finally, we used several image to test the approach, the experiment results indicate that the approach do not change the filtering premise and effectively reduce the computational complexity.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 718-720)

Pages:

2340-2343

Citation:

Online since:

July 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ataman, E.;   Aatre, V.;   Wong, K: A fast method for real-time median filtering. IEEE Transactions on Acoustics, Speech and Signal Processing, Vol. 24, 4 (1980) 415-421

DOI: 10.1109/tassp.1980.1163426

Google Scholar

[2] Perreault, S.; Hebert, P: Median Filtering in Constant Time. IEEE Transactions on Image Processing , Vol. 16, 9 (2007) 2389-2394

DOI: 10.1109/tip.2007.902329

Google Scholar

[3] Yong Lee;   Kassam, S: Generalized median filtering and related nonlinear filtering techniques. IEEE Transactions on Acoustics, Speech and Signal Processing, Vol. 33, 3 (1985) 672-683

DOI: 10.1109/tassp.1985.1164591

Google Scholar

[4] L. Di Stefano, M.m., S. Mattoccia.: A Fast Area-Based Stereo Matching Algorithm. Image and Vision Computing, Vol. 22, 12 (2004) 983-1005

DOI: 10.1016/j.imavis.2004.03.009

Google Scholar