Share Email Print

Proceedings Paper

A fast iterative thresholding algorithm for wavelet-regularized deconvolution
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 20 September 2007
PDF: 5 pages
Proc. SPIE 6701, Wavelets XII, 67010D (20 September 2007); doi: 10.1117/12.733532
Show Author Affiliations
Cédric Vonesch, École Polytechnique Fédérale de Lausanne (Switzerland)
Michael Unser, École Polytechnique Fédérale de Lausanne (Switzerland)

Published in SPIE Proceedings Vol. 6701:
Wavelets XII
Dimitri Van De Ville; Vivek K. Goyal; Manos Papadakis, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?