title: Improved bounds for subband-adaptive iterative shrinkage/thresholding algorithms.
abstract: This paper presents new methods for computing the step sizes of the subband-adaptive iterative shrinkage-thresholding algorithms proposed by Bayram & Selesnick and Vonesch & Unser. The method yields tighter wavelet-domain bounds of the system matrix, thus leading to improved convergence speeds. It is directly applicable to non-redundant wavelet bases, and we also adapt it for cases of redundant frames. It turns out that the simplest and most intuitive setting for the step sizes that ignores subband aliasing is often satisfactory in practice. We show that our methods can be used to advantage with reweighted least squares penalty functions as well as L1 penalties. We emphasize that the algorithms presented here are suitable for performing inverse filtering on very large datasets, including 3D data, since inversions are applied only to diagonal matrices and fast transforms are used to achieve all matrix-vector products.
authors.affiliation: Department of Engineering, University of Cambridge, Cambridge, UK. yingsong.zhang@ic.ac.uk
authors.forename: Yingsong
authors.initials: Y
authors.lastname: Zhang
authors.forename: Nick
authors.initials: N
authors.lastname: Kingsbury
mesh_terms: D000465:Algorithms; D006801:Humans; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional; D008856:Microscopy, Fluorescence; D010781:Photography; D012815:Signal Processing, Computer-Assisted