A fast iterative thresholding algorithm for wavelet-regularized deconvolution

Cédric Vonesch; Michael Unser

doi:10.1117/12.733532

20 September 2007 A fast iterative thresholding algorithm for wavelet-regularized deconvolution

Cédric Vonesch, Michael Unser

Proceedings Volume 6701, Wavelets XII; 67010D (2007) https://doi.org/10.1117/12.733532
Event: Optical Engineering + Applications, 2007, San Diego, California, United States

Abstract

We present an iterative deconvolution algorithm that minimizes a functional with a non-quadratic wavelet-domain regularization term. Our approach is to introduce subband-dependent parameters into the bound optimization framework of Daubechies et al.; it is sufficiently general to cover arbitrary choices of wavelet bases (non-orthonormal or redundant). The resulting procedure alternates between the following two steps: 1. a wavelet-domain Landweber iteration with subband-dependent step-sizes; 2. a denoising operation with subband-dependent thresholding functions. The subband-dependent parameters allow for a substantial convergence acceleration compared to the existing optimization method. Numerical experiments demonstrate a potential speed increase of more than one order of magnitude. This makes our "fast thresholded Landweber algorithm" a viable alternative for the deconvolution of large data sets. In particular, we present one of the first applications of wavelet-regularized deconvolution to 3D fluorescence microscopy.

Citation Download Citation

Cédric Vonesch and Michael Unser "A fast iterative thresholding algorithm for wavelet-regularized deconvolution", Proc. SPIE 6701, Wavelets XII, 67010D (20 September 2007); https://doi.org/10.1117/12.733532

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available