## Monte-Carlo Sure: A black-box optimization of regularization parameters for general denoising algorithms (2008)

Venue: | IEEE TRANSACTIONS ON IMAGE PROCESSING |

Citations: | 27 - 3 self |

### BibTeX

@ARTICLE{Ramani08monte-carlosure:,

author = {Sathish Ramani and Thierry Blu and Michael Unser},

title = {Monte-Carlo Sure: A black-box optimization of regularization parameters for general denoising algorithms},

journal = {IEEE TRANSACTIONS ON IMAGE PROCESSING},

year = {2008},

pages = {1540--1554}

}

### OpenURL

### Abstract

We consider the problem of optimizing the parameters of a given denoising algorithm for restoration of a signal corrupted by white Gaussian noise. To achieve this, we propose to minimize Stein’s unbiased risk estimate (SURE) which provides a means of assessing the true mean-squared error (MSE) purely from the measured data without need for any knowledge about the noise-free signal. Specifically, we present a novel Monte-Carlo technique which enables the user to calculate SURE for an arbitrary denoising algorithm characterized by some specific parameter setting. Our method is a black-box approach which solely uses the response of the denoising operator to additional input noise and does not ask for any information about its functional form. This, therefore, permits the use of SURE for optimization of a wide variety of denoising algorithms. We justify our claims by presenting experimental results for SURE-based optimization of a series of popular image-denoising algorithms such as total-variation denoising, wavelet soft-thresholding, and Wiener filtering/smoothing splines. In the process, we also compare the performance of these methods. We demonstrate numerically that SURE computed using the new approach accurately predicts the true MSE for all the considered algorithms. We also show that SURE uncovers the optimal values of the parameters in all cases.