Math @ Duke

Publications [#323650] of Ingrid Daubechies
Papers Published
 Daubechies, I; Defrise, M; De Mol, C, Sparsityenforcing regularisation and ISTA revisited,
Inverse Problems, vol. 32 no. 10
(August, 2016),
pp. 104001104001, IOP Publishing [doi]
(last updated on 2019/05/24)
Abstract: © 2016 IOP Publishing Ltd. About two decades ago, the concept of sparsity emerged in different disciplines such as statistics, imaging, signal processing and inverse problems, and proved to be useful for several applications. Sparsityenforcing constraints or penalties were then shown to provide a viable alternative to the usual quadratic ones for the regularisation of illposed problems. To compute the corresponding regularised solutions, a simple, iterative and provably convergent algorithm was proposed and later on referred to as the iterative softthresholding algorithm. This paper provides a brief review of these early results as well as that of the subsequent literature, albeit from the authors' limited perspective. It also presents the previously unpublished proof of an extension of the original framework.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

