Sparsity-enforcing regularisation and ISTA revisited

Ingrid Daubechies, Michel Defrise, Christine De Mol

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

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. Sparsity-enforcing constraints or penalties were then shown to provide a viable alternative to the usual quadratic ones for the regularisation of ill-posed 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.
Original languageEnglish
Article number104001
Number of pages15
JournalInverse Problems
Volume32
Issue number10
DOIs
Publication statusPublished - 2016

Keywords

  • sparsity
  • regularization

Fingerprint

Dive into the research topics of 'Sparsity-enforcing regularisation and ISTA revisited'. Together they form a unique fingerprint.

Cite this