Biomedical Imaging GroupSTI
English only   BIG > Publications > Landweber Deconvolution

 Home Page
 News & Events
 Tutorials and Reviews
 Download Algorithms

 All BibTeX References

A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution

C. Vonesch, M. Unser

IEEE Transactions on Image Processing, vol. 17, no. 4, pp. 539-549, April 2008.

We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the ℓ1-norm of the wavelet coefficients of the solution. Previously available methods have essentially consisted in alternating between a Landweber iteration and a wavelet-domain soft-thresholding operation. While having the advantage of simplicity, they are known to converge slowly. By expressing the cost functional in a Shannon wavelet basis, we are able to decompose the problem into a series of subband-dependent minimizations. In particular, this allows for larger (subband-dependent) step sizes and threshold levels than the previous method. This improves the convergence properties of the algorithm significantly. We demonstrate a speed-up of one order of magnitude in practical situations. This makes wavelet-regularized deconvolution more widely accessible, even for applications with a strong limitation on computational complexity. We present promising results in 3-D deconvolution microscopy, where the size of typical data sets does not permit more than a few tens of iterations.

AUTHOR="Vonesch, C. and Unser, M.",
TITLE="A Fast Thresholded {L}andweber Algorithm for Wavelet-Regularized
        Multidimensional Deconvolution",
JOURNAL="{IEEE} Transactions on Image Processing",

© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.