Skip to Main content Skip to Navigation
Theses

Accelerating sparse inverse problems using structured approximations

Cassio F. Dantas 1 
1 PANAMA - Parcimonie et Nouveaux Algorithmes pour le Signal et la Modélisation Audio
Inria Rennes – Bretagne Atlantique , IRISA-D5 - SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE
Abstract : As the quantity and size of available data grow, the existing algorithms for solving sparse inverse problems can become computationally intractable. In this work, we explore two main strategies for accelerating such algorithms. First, we study the use of structured dictionaries which are fast to operate with. A particular family of dictionaries, written as a sum of Kronecker products, is proposed. Then, we develop stable screening tests, which can safely identify and discard useless atoms (columns of the dictionary matrix which do not correspond to the solution support), despite manipulating approximate dictionaries.
Document type :
Theses
Complete list of metadata

Cited literature [208 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02494569
Contributor : Cassio F. Dantas Connect in order to contact the contributor
Submitted on : Friday, February 28, 2020 - 7:28:53 PM
Last modification on : Friday, August 5, 2022 - 2:54:52 PM
Long-term archiving on: : Friday, May 29, 2020 - 6:31:37 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-02494569, version 1

Citation

Cassio F. Dantas. Accelerating sparse inverse problems using structured approximations. Signal and Image Processing. Inria Rennes - Bretagne Atlantique; Université Rennes 1, 2019. English. ⟨tel-02494569v1⟩

Share

Metrics

Record views

159

Files downloads

160