Abstract
We consider the familiar scenario where independent and identically distributed (i.i.d) noise in an image is removed using a set of overcomplete linear transforms and thresholding. Rather than the standard approach where one obtains the denoised signal by ad hoc averaging of the denoised estimates (corresponding to each transform), we formulate the optimal combination as a linear estimation problem for each pixel and solve it for optimal estimates. Our approach is independent of the utilized transforms and the thresholding scheme, and extends established work by exploiting a separate degree of freedom that is in general not reachable using previous techniques. Surprisingly, our derivation of the optimal estimates does not require explicit image statistics but relies solely on the assumption that the utilized transforms provide sparse decompositions. Yet it can be seen that our adaptive estimates utilize implicit conditional statistics and they make the biggest impact around edges and singularities where standard sparsity assumptions fail.
Keywords
ThresholdingIndependent and identically distributed random variablesAlgorithmImage (mathematics)MathematicsComputer sciencePixelSet (abstract data type)Noise (video)Pattern recognition (psychology)Mathematical optimizationArtificial intelligenceStatisticsRandom variable
Affiliated Institutions
Related Publications
The curvelet transform for image denoising
We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform. Our implementations offer exact re...
Image denoising using scale mixtures of gaussians in the wavelet domain
We describe a method for removing noise from digital images, based on a statistical model of the coefficients of an overcomplete multiscale oriented basis. Neighborhoods of coef...
Estimating the probability of the presence of a signal of interest in multiresolution single- and multiband image denoising
We develop three novel wavelet domain denoising methods for subband-adaptive, spatially-adaptive and multivalued image denoising. The core of our approach is the estimation of t...
Stable recovery of sparse overcomplete representations in the presence of noise
Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate sparse representations of signals. However, in ...
De-noising by soft-thresholding
Donoho and Johnstone (1994) proposed a method for reconstructing an unknown function f on [0,1] from noisy data d/sub i/=f(t/sub i/)+/spl sigma/z/sub i/, i=0, ..., n-1,t/sub i/=...
Publication Info
- Year
- 2004
- Type
- article
- Pages
- 1992-1996
- Citations
- 50
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
50
OpenAlex
Cite This
Onur G. Guleryuz
(2004).
Weighted overcomplete denoising.
, 1992-1996.
https://doi.org/10.1109/acssc.2003.1292330
Identifiers
- DOI
- 10.1109/acssc.2003.1292330