HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01156478
Contributor : Luc Le Magoarou Connect in order to contact the contributor
Submitted on : Wednesday, May 27, 2015 - 2:12:09 PM
Last modification on : Thursday, January 20, 2022 - 5:33:09 PM
Long-term archiving on: : Tuesday, September 15, 2015 - 7:02:41 AM

File

EUSIPCO_current.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01156478, version 1

Citation

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⟩

Share

Metrics

Record views

685

Files downloads

256