Advanced search
1 file | 5.02 MB

Universal impulse noise filter based on genetic programming

Author
Organization
Abstract
In this paper, we present a novel method for impulse noise filter construction, based on the switching scheme with two cascaded detectors and two corresponding estimators. Genetic programming as a supervised learning algorithm is employed for building two detectors with complementary characteristics. The first detector identifies the majority of noisy pixels. The second detector searches for the remaining noise missed by the first detector, usually hidden in image details or with amplitudes close to its local neighborhood. Both detectors are based on the robust estimators of location and scale-median and MAD. The filter made by the proposed method is capable of effectively suppressing all kinds of impulse noise, in contrast to many existing filters which are specialized only for a particular noise model. In addition, we propose the usage of a new impulse noise model-the mixed impulse noise, which is more realistic and harder to treat than existing impulse noise models. The proposed model is the combination of commonly used noise models: salt-and-pepper and uniform impulse noise models. Simulation results show that the proposed two-stage GP filter produces excellent results and outperforms existing state-of-the-art filters.
Keywords
impulse noise, WEIGHTED MEDIAN FILTERS, REDUCTION METHOD, REMOVAL, STATISTICS, ALGORITHM, evolutionary algorithms, nonlinear filters, genetic programming (GP), HIGHLY CORRUPTED IMAGES

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 5.02 MB

Citation

Please use this url to cite or link to this publication:

Chicago
Petrovic, Nemanja, and Vladimir Crnojevic. 2008. “Universal Impulse Noise Filter Based on Genetic Programming.” Ieee Transactions on Image Processing 17 (7): 1109–1120.
APA
Petrovic, N., & Crnojevic, V. (2008). Universal impulse noise filter based on genetic programming. IEEE TRANSACTIONS ON IMAGE PROCESSING, 17(7), 1109–1120.
Vancouver
1.
Petrovic N, Crnojevic V. Universal impulse noise filter based on genetic programming. IEEE TRANSACTIONS ON IMAGE PROCESSING. 2008;17(7):1109–20.
MLA
Petrovic, Nemanja, and Vladimir Crnojevic. “Universal Impulse Noise Filter Based on Genetic Programming.” IEEE TRANSACTIONS ON IMAGE PROCESSING 17.7 (2008): 1109–1120. Print.
@article{745883,
  abstract     = {In this paper, we present a novel method for impulse noise filter construction, based on the switching scheme with two cascaded detectors and two corresponding estimators. Genetic programming as a supervised learning algorithm is employed for building two detectors with complementary characteristics. The first detector identifies the majority of noisy pixels. The second detector searches for the remaining noise missed by the first detector, usually hidden in image details or with amplitudes close to its local neighborhood. Both detectors are based on the robust estimators of location and scale-median and MAD. The filter made by the proposed method is capable of effectively suppressing all kinds of impulse noise, in contrast to many existing filters which are specialized only for a particular noise model. In addition, we propose the usage of a new impulse noise model-the mixed impulse noise, which is more realistic and harder to treat than existing impulse noise models. The proposed model is the combination of commonly used noise models: salt-and-pepper and uniform impulse noise models. Simulation results show that the proposed two-stage GP filter produces excellent results and outperforms existing state-of-the-art filters.},
  author       = {Petrovic, Nemanja and Crnojevic, Vladimir},
  issn         = {1057-7149},
  journal      = {IEEE TRANSACTIONS ON IMAGE PROCESSING},
  language     = {eng},
  number       = {7},
  pages        = {1109--1120},
  title        = {Universal impulse noise filter based on genetic programming},
  url          = {http://dx.doi.org/10.1109/TIP.2008.924388},
  volume       = {17},
  year         = {2008},
}

Altmetric
View in Altmetric
Web of Science
Times cited: