Computer Science – Computer Vision and Pattern Recognition
Scientific paper
2010-03-21
Computer Science
Computer Vision and Pattern Recognition
29 pages, 10 figures
Scientific paper
Among the many ways to model signals, a recent approach that draws considerable attention is sparse representation modeling. In this model, the signal is assumed to be generated as a random linear combination of a few atoms from a pre-specified dictionary. In this work we analyze two Bayesian denoising algorithms -- the Maximum-Aposteriori Probability (MAP) and the Minimum-Mean-Squared-Error (MMSE) estimators, under the assumption that the dictionary is unitary. It is well known that both these estimators lead to a scalar shrinkage on the transformed coefficients, albeit with a different response curve. In this work we start by deriving closed-form expressions for these shrinkage curves and then analyze their performance. Upper bounds on the MAP and the MMSE estimation errors are derived. We tie these to the error obtained by a so-called oracle estimator, where the support is given, establishing a worst-case gain-factor between the MAP/MMSE estimation errors and the oracle's performance. These denoising algorithms are demonstrated on synthetic signals and on true data (images).
Elad Michael
Protter Matan
Turek Javier
Yavneh Irad
No associations
LandOfFree
On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On MMSE and MAP Denoising Under Sparse Representation Modeling Over a Unitary Dictionary will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-316516