Improved approximated median filter algorithm for real-time computer vision applications
Median filter is one of the predominant filters that are used to suppress impulse noise. Its simplicity and ability to maintain edges has led to an extensive application in the domain of image processing and computer vision. However, challenges such as moderate to high running time of the standard m...
Gespeichert in:
Veröffentlicht in: | Journal of King Saud University. Computer and information sciences 2022-03, Vol.34 (3), p.782-792 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Median filter is one of the predominant filters that are used to suppress impulse noise. Its simplicity and ability to maintain edges has led to an extensive application in the domain of image processing and computer vision. However, challenges such as moderate to high running time of the standard median filter algorithm and relatively poorer performance when the image is highly corrupted with impulse noise, have led to the design of several variations of the algorithm. One set of variation of the algorithm concentrates on generating quality outputs, while the other set focuses on reducing running time. Among the set targeting the reduction of the running time of the median filter is the DP approximated median filter. However, DP performs poorly when images are corrupted with moderate to high levels of noise. This paper therefore proposes an Improved Approximation Median Filtering Algorithms (IAMFA-I & IAMFA-II) based on DP to generate a better output. The introduction of Mid-Value-Decision-Median in DP reduces the chances of selecting corrupted pixel for denoised image. Experimental results indicate that the IAMFA-II has better running time and equivalent output compared with DP, while IAMFA-I generates better output and has equivalent running time when compared with DP. |
---|---|
ISSN: | 1319-1578 2213-1248 |
DOI: | 10.1016/j.jksuci.2020.04.005 |