FA$\mu$ST: speeding up linear transforms for tractable inverse problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

FA$\mu$ST: speeding up linear transforms for tractable inverse problems

Abstract

In this paper, we propose a technique to factorize any matrix into multiple sparse factors. The resulting factorization, called Flexible Approximate MUlti-layer Sparse Transform (FAµST), yields reduced multiplication costs by the matrix and its adjoint. Such a desirable property can be used to speed up iterative algorithms commonly used to solve high dimensional linear inverse problems. The proposed approach is first motivated, introduced and related to prior art. The compromise between computational efficiency and data fidelity is then investigated, and finally the relevance of the approach is demonstrated on a problem of brain source localization using simulated magnetoencephalography (MEG) signals.
Fichier principal
Vignette du fichier
EUSIPCO_current.pdf (1.2 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01156478 , version 1 (27-05-2015)

Identifiers

  • HAL Id : hal-01156478 , version 1

Cite

Luc Le Magoarou, Rémi Gribonval, Alexandre Gramfort. FA$\mu$ST: speeding up linear transforms for tractable inverse problems. European Signal Processing Conference (EUSIPCO), Aug 2015, Nice, France. ⟨hal-01156478⟩
785 View
319 Download

Share

Gmail Mastodon Facebook X LinkedIn More