Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:issue
4
pubmed:dateCreated
2008-4-8
pubmed:abstractText
We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the l(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.
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:status
MEDLINE
pubmed:month
Apr
pubmed:issn
1057-7149
pubmed:author
pubmed:issnType
Print
pubmed:volume
17
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
539-49
pubmed:meshHeading
pubmed:year
2008
pubmed:articleTitle
A fast thresholded landweber algorithm for wavelet-regularized multidimensional deconvolution.
pubmed:affiliation
Biomedical Imaging Group, Lausanne, Switzerland. cedric.vonesch@epfl.ch
pubmed:publicationType
Journal Article, Research Support, Non-U.S. Gov't