The algorithm of fast mean filtering

Jian Jia Pan, Yuan Yan Tang, Bao Chang Pan

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

34 Citations (Scopus)

Abstract

Mean filtering is a normal filtering method. It simply smoothes local variations in an image, and noise is reduced as a result of blurring. But it takes many times to compute the neighborhood pixels. An algorithm of Fast Mean Filtering (FMF) is presented in this paper. The processing speed of the FMF is much faster than the traditional mean filtering, and the filtering result is the same as the traditional mean filtering.

Original languageEnglish
Title of host publicationProceedings of the 2007 International Conference on Wavelet Analysis and Pattern Recognition, ICWAPR '07
PublisherIEEE
Pages244-248
Number of pages5
Volume1
ISBN (Electronic)9781424410668
ISBN (Print)1424410665, 9781424410651
DOIs
Publication statusPublished - 2 Nov 2007
Event2007 International Conference on Wavelet Analysis and Pattern Recognition, ICWAPR 2007 - Beijing, China
Duration: 2 Nov 20074 Nov 2007

Publication series

NameProceedings of the International Conference on Wavelet Analysis and Pattern Recognition, ICWAPR
PublisherIEEE
ISSN (Print)2158-5695
ISSN (Electronic)2158-5709

Conference

Conference2007 International Conference on Wavelet Analysis and Pattern Recognition, ICWAPR 2007
Country/TerritoryChina
CityBeijing
Period2/11/074/11/07

User-Defined Keywords

  • Computation time
  • Fast mean filtering
  • Mean filter

Fingerprint

Dive into the research topics of 'The algorithm of fast mean filtering'. Together they form a unique fingerprint.

Cite this