Advertisement

The Journal of Supercomputing

, Volume 65, Issue 1, pp 262–273 | Cite as

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

Article

Abstract

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.

Keywords

Blurring Complexity theory Mean filtering Smoothing Spatial averaging 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jain AK (1989) Fundamentals of digital image processing. Prentice-Hall, Englewood Cliffs MATHGoogle Scholar
  2. 2.
    Pratt WK (2001) Digital image processing, 3rd edn. Wiley, New York CrossRefGoogle Scholar
  3. 3.
    Gonzalez RC, RE Woods (2002) Digital image processing, 2nd edn. Prentice-Hall, Upper Saddle River Google Scholar
  4. 4.
    Casasent D, Nakariyakul S, Topiwala P (2004) Zero-mean Minace filters for detection in visible EO imagery. Proc SPIE 5608:252–263 CrossRefGoogle Scholar
  5. 5.
    Bodnarova A, Bennamoun M, Kubik KK (2000) Suitability analysis of techniques for flaw detection in texiles using texure analysis. PAA Pattern Anal Appl 3:254–266 MATHCrossRefGoogle Scholar
  6. 6.
    Kundu A, Mitra SK, Vaidyanathan PP (1984) Application of two-dimensional generalized mean filtering for removal of impulse noises from images. IEEE Trans Acoust Speech Signal Process ASSP-32:600–609 CrossRefGoogle Scholar
  7. 7.
    Nie X, Unbehauen R (1991) Edge preserving filtering by combining nonlinear mean and median filters. IEEE Trans Signal Process 39:2552–2554 CrossRefGoogle Scholar
  8. 8.
    Oten R, de Figueiredo RJP (2004) Adaptive alpha-trimmed mean filters under deviations from assumed noise model. IEEE Trans Image Process 13:627–639 CrossRefGoogle Scholar
  9. 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
  10. 10.
    Rakshit S, Ghosh A, Uma Shankar B (2007) Fast mean filtering technique (FMFT). Pattern Recognit 40:890–897 MATHCrossRefGoogle Scholar
  11. 11.
    TA Standish (1995) Data structures, algorithms & software principles in C. Addison-Wesley, New York Google Scholar
  12. 12.
    Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. The MIT Press, Cambridge MATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

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

Personalised recommendations