2008
DOI: 10.1117/1.3028332
|View full text |Cite
|
Sign up to set email alerts
|

Impulsive noise filter using median- and partition-based operation

Abstract: A novel filter is proposed in this work to remove noise and preserve fine details from the impulse-corrupted images based on median and partition operation. Each pixel is classified into one of the mutually exclusive partition blocks by a novel observation vector. This observation vector can be directly used to partition the observation space without using predefined thresholds. The weight of each block is obtained using a learning approach based on the least-mean-square algorithm. The noise-filtering process … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2010
2010
2015
2015

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…That is to say c x and f x count these neighbor pixels, satisfying and un-satisfying the condition of |u y − u x | ≤ T : y ∈ Ω (N) i, j , respectively. Here, threshold T is set as T = 5 in the whole work, the same as the threshold d in [15]. Since there are (2N + 1) 2 − 1 neighbor positions in a filter window, the sum of c x and f x is (2N + 1)…”
Section: Algorithm About the Proposed Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…That is to say c x and f x count these neighbor pixels, satisfying and un-satisfying the condition of |u y − u x | ≤ T : y ∈ Ω (N) i, j , respectively. Here, threshold T is set as T = 5 in the whole work, the same as the threshold d in [15]. Since there are (2N + 1) 2 − 1 neighbor positions in a filter window, the sum of c x and f x is (2N + 1)…”
Section: Algorithm About the Proposed Methodsmentioning
confidence: 99%
“…Let c x and f x denote the number of "close" and "further" neighbor pixels which have the absolute gray differences to the center pixel u x not-exceeding and exceeding threshold T [15], respectively. That is to say c x and f x count these neighbor pixels, satisfying and un-satisfying the condition of |u y − u x | ≤ T : y ∈ Ω (N) i, j , respectively.…”
Section: Algorithm About the Proposed Methodsmentioning
confidence: 99%