Fast mean filtering technique (FMFT)

  • Authors:
  • S. Rakshit;A. Ghosh;B. Uma Shankar

  • Affiliations:
  • Machine Intelligence Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata - 700108, India;Machine Intelligence Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata - 700108, India;Machine Intelligence Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata - 700108, India

  • Venue:
  • Pattern Recognition
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

This article presents a novel method for mean filtering that reduces the required number of additions and eliminates the need for division altogether. The time reduction is achieved using basic store-and-fetch operations and is irrespective of the image or neighbourhood size. This method has been tested on a variety of greyscale images and neighbourhood sizes with promising results. These results indicate that the relative time requirement reduces with increase in image size. The method's efficiency also improves significantly with increase in neighbourhood size thereby making it increasingly useful when dealing with large images.