The Journal of Supercomputing

, Volume 65, Issue 1, pp 262–273

Fast spatial averaging: an efficient algorithm for 2D mean filtering



We present a new fast spatial averaging technique that efficiently implements operations for spatial averaging or two-dimensional mean filtering. To perform spatial averaging of an M×N image with an averaging filter of size m×n, our proposed method requires approximately 4MN additions and no division. This is very promising, since the major computations required by our algorithm depend only on the size of the original image but not on the size of the averaging filter. To our knowledge, this technique requires the smallest number of additions for mean filtering. Experimental results on various image sizes using different filter sizes confirm that our fast spatial averaging algorithm is significantly faster than other spatial averaging algorithms, especially when the size of the input image is very large.


Blurring Complexity theory Mean filtering Smoothing Spatial averaging 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Electrical and Computer EngineeringThammasat UniversityAmpher KhlongluangThailand

Personalised recommendations