Fast spatial averaging: an efficient algorithm for 2D mean filtering
- 290 Downloads
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.
KeywordsBlurring Complexity theory Mean filtering Smoothing Spatial averaging
Unable to display preview. Download preview PDF.
- 3.Gonzalez RC, RE Woods (2002) Digital image processing, 2nd edn. Prentice-Hall, Upper Saddle River Google Scholar
- 9.Pan J-J, Tang Y-Y, Pan B-C (2007) The algorithm of fast mean filtering. In: Proceedings of the 2007 int conf on wavelet anal and pattern recognit, pp 244–248 Google Scholar
- 11.TA Standish (1995) Data structures, algorithms & software principles in C. Addison-Wesley, New York Google Scholar