Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Vol.03, Issue.05,
July-2015,
Pages:0683-0688
www.ijvdcs.org
Assoc Prof, Dept of ECE, Sarada Institute Technology and Science, TS, India, E-mail: Venumangapudi1986@yahoo.com.
PG Scholar, Dept of ECE, Sarada Institute Technology and Science, TS, India, E-mail: Nagaraju.parikapalli5@gmail.com.
3
Assoc Prof & HOD, Dept of ECE, Sarada Institute Technology and Science, TS, India, E-mail: nagarjun.singh24@gmail.com.
2
Abstract: In this paper, we propose a de-noising method motivated by our previous analysis of the performance bounds for
image de-noising. Insights from that study are used here to derive a high-performance practical de-noising algorithm. We
propose a patch-based Wiener filter that exploits patch redundancy for image de-noising. Our framework uses both
geometrically and photo metrically similar patches to estimate the different filter parameters. We describe how these parameters
can be accurately estimated directly from the input noisy image. Our de-noising approach, designed for near-optimal
performance (in the mean-squared error sense), has a sound statistical foundation that is analyzed in detail. The performance of
our approach is experimentally verified on a variety of images and noise levels. The results presented here demonstrate that our
proposed method is on par or exceeding the current state of the art, both visually and quantitatively.
Keywords: EPLL, Image Denoising, K-SVD.
I. INTRODUCTION
In the recent years, images and videos have become
integral parts of our lives. Applications now range from
casual documentation of events and visual communication, to
the more serious surveillance and medical fields. This has led
to an ever-increasing demand for accurate and visually
pleasing images. However, images captured by modern
cameras are invariably corrupted by noise. With increasing
pixel resolution, but more or less the same aperture size,
noise suppression has become more relevant. While advances
in optics and hardware try to mitigate such undesirable
effects, software-based de-noising approaches are more
popular as they are usually device independent and widely
applicable. In the last decade, many such methods have been
proposed leading to considerable improvement in de-noising
performance. In, we studied the problem from an estimation
theory perspective to quantify the fundamental limits of denoising. The insights gained from that study are applied to
develop a theoretically sound de-noising method in this
paper. The challenge of any image de-noising algorithm is to
suppress noise while producing sharp images without loss of
finer details. The first modern adaptive method to
successfully address these contradictory goals can be
attributed to where the authors proposed a generalization of
the SUSAN filter, which itself was an extension of the
Yaroslavky filter.
The authors there proposed de-noising by weighted
averaging using pixels similar in intensity within a local
neighborhood. Under strong noise, identifying such similar
pixels can be challenging. In, Takeda et al. proposed a signal
A Novel Approach for Patch-Based Image Denoising Based on Optimized Pixel-Wise Weighting
observed noisy image. The procedure is algorithmically
(3)
represented in Algorithm. 1. We first identify geometrically
where
Rn is the estimate of zi, Ji Rnn is the Fisher
similar patches within the noisy image. Once such patches
information matrix (FIM), Cz Rnn is the patch covariance
are identified, we can use these patches to estimate the
matrix, and ||.|| denotes the l2 norm. This covariance matrix
moments (sz and Cz) of the cluster, taking care to account for
captures the complexity of the patches, and is estimated from
noise (steps 8 & 9 of Algorithm. 1). Next, we identify the
all the geometrically similar patches present in the given
photometrically similar patches and calculate the weights wij
image. Fig. 2 illustrates what we mean by geometric
that control the amount of influence that any given patch
similarity, where it can be seen that each cluster groups
exerts on de-noising patches similar to it. These parameters
together patches containing flat regions, edges in the
are then used to de-noise each patch. Since we use
horizontal or vertical directions, and corners of the simulated
overlapping patches, multiple estimates are obtained for
box image. Note that such grouping is done irrespective of
pixels lying in the overlapping regions. These multiple
the actual patch intensities. This is justified for intensityestimates are then optimally aggregated to obtain the final deindependent noise when de-noising performance is dictated
noised image. Below, we describe each step in greater detail.
by complexity of patches, rather than their actual intensities.
Algorithm 1:
The FIM, on the other hand, is influenced by the noise
characteristics. When additive white Gaussian noise (WGN)
is considered, the FIM takes the form
(4)
where I is the nn identity matrix, is the noise standard
deviation, and Ni is the patch redundancy measured as the
number of patches zj within the latent image that are
photometrically similar to a given patch zi. We define such
similarity as
(5)
In, is chosen as a small threshold dependent on the
number of pixels (n) in each patch. The relationship between
similar patches shown in Eq. 5 is based on the underlying
noise-free patches that are not known in practice. In this
expression was extended to define photometric similarity
between the corresponding noisy patches yj as
(6)
The Ni values can then be estimated directly from the
noisy image as the number of yj patches (including yi) that
satisfy the above criterion. Note that the condition for
photometric similarity, as defined here, is stricter than that
for geometric similarity. As such, photometric similarity can
be expected to imply geometrically similar as well. The
bounds expression (3) thus takes into account the complexity
of the image patches present in the image as well as the
redundancy level and the noise variance corrupting the
image. In, the bound was shown to characterize the
performance of the optimal affine-biased de-noising method.
In particular, for WGN, the right-hand side of (3) is the
performance achieved by the optimal linear minimum mean
squared-error (LMMSE) estimator, with Ji and Cz being the
parameters of the estimator. The Wiener filter is, in fact, the
LMMSE estimator that achieves this lower bound. Thus, a
patch-based Wiener filter, where the parameters are
estimated accurately, can lead to near-optimal de-noising.
This forms the basis of our approach. We outline the theory
behind the proposed approach next.
III. PARAMETER ESTIMATION FOR DENOISING
Our proposed de-noising framework, graphically outlined
in Fig. 1, requires us to infer various parameters from the
A. Geometric Clustering
In Sec. II, our proposed filter was derived assuming
geometrically similar patches to be sampled from some
unknown pdf. So far we have assumed such clustering to be
available to us from an oracle. To perform practical
clustering, we need to identify features that capture the
underlying geometric structure of each patch from its noisy
observations. Such features need to be robust to the presence
of noise, as well as to differences in contrast and intensity
among patches exhibiting similar structural characteristics.
An example of such variations among geometrically similar
patches can be seen in Fig.2. Possible choices of features
include contrast adjusted image patches or principal
A Novel Approach for Patch-Based Image Denoising Based on Optimized Pixel-Wise Weighting
We find both of the two profiles are effective for moderate
noise levels, while the approximation profile performs even
better. Therefore, we choose the approximation profile to
improve the EPLL algorithm. As shown in Table II, for noise
level from = 5 to = 20, the averaged PSNR gain can reach
around 0.1dB. The proposed weighting approach is not
effective for high noise levels probably because: It is
designed to minimize the MSE under only one F&W process
when it is used for multiple times, minimizing the MSE
within each iteration may not be the optimal. As the noise
level increases, the number of iteration also increases, which
enlarges the impact of the misleading objective. For the
BM3D algorithm, we find the PSNR improvement by using
the proposed weighting approach is insignificant, no matter
which profile is used. This is probably because BM3D has
much more estimates for the same pixel compare to K-SVD
and EPLL, and their correlation is also more complicated,
Fig.4. The PSNR gain by using w () under = 50 for Kwhich makes approximating the hidden covariance matrix
SVD. Each curve represents one training image and the
Covi accurately very hard. Therefore, we need to design
circle indicates the position of the optimal that leads to
more sophisticated profiles for BM3D in the future.
the maximum gain for that image.
TABLE I: PSNR Comparison Under K-SVD Under Each
V. CONCLUSION
Noise Level, The Left Column Uses The Original Weight,
In this paper, we have proposed a method of de-noising
The Right Column Uses Weight Of The Practical Profile
motivated from our previous work in analyzing the
performance bounds of patch-based de-noising methods. We
have developed a locally optimal Wiener-filter-based method
and have extended it to take advantage of patch redundancy
to improve the de-noising performance. Our de-noising
approach does not require parameter tuning and is practical,
with the added benefit of a clean statistical motivation and
analytical formulation. We analyzed the framework in depth
to show its relation to nonlocal means and residual filtering
methods. Through experimental validation, we have shown
that our method produces results quite comparable with the
state of the art. While mainly developed for grayscale
images, with trivial modification, our method achieves near
state-of-the-art performance in de-noising color images as
well. The de-noising performance can be expected to
TABLE II: PSNR Comparison under Epll Under Each
improve further by taking into account the correlation across
Noise Level, The Left Column Uses The Original Weight,
color components. Since the method works by learning the
The Right Column Uses Weight Of The Approximation
moments in geometrically similar patches, the inter channel
Profile
color dependences can be implicitly captured in this
framework. In a more practical setting where signaldependent noise is observed, the clustering step needs to take
into account color (or intensity) information as well. The
noise in each cluster can be then assumed to be
homogeneous, and the proposed filter can be independently
applied in each cluster.
VI. REFERENCES
[1] Jianzhou Feng, Li Song, Xiaoming Huo, Xiaokang Yang,
and Wenjun Zhang, An Optimized Pixel-Wise Weighting
Approach for Patch-Based Image Denoising, IEEE Signal
Processing Letters, Vol. 22, No. 1, January 2015.
[2] M. Elad and M. Aharon, Image de-noising via sparse
and redundant representations over learned dictionaries,