Adaptive iterative thresholding algorithms for magnetoencephalography (MEG)
From MaRDI portal
Publication:950188
DOI10.1016/j.cam.2007.10.048zbMath1146.92022OpenAlexW2069048486MaRDI QIDQ950188
Francesca Pitolli, Massimo Fornasier
Publication date: 22 October 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.10.048
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Neuroelectric source localization by random spatial sampling ⋮ Solution of the EEG inverse problem by random dipole sampling ⋮ An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography ⋮ Iterative thresholding algorithms ⋮ An Iterative Algorithm with Joint Sparsity Constraints for Magnetic Tomography ⋮ An inversion method based on random sampling for real-time MEG neuroimaging ⋮ Accelerated projected gradient method for linear inverse problems with sparsity constraints ⋮ Multilevel preconditioning and adaptive sparse solution of inverse problems
Cites Work
- Adaptive frame methods for elliptic operator equations
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Wavelets in numerical simulation. Problem adapted construction and applications
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Ten Lectures on Wavelets
- Adaptive Solution of Operator Equations Using Wavelet Frames
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Adaptive frame methods for elliptic operator equations: the steepest descent approach
- Unnamed Item
- Unnamed Item
This page was built for publication: Adaptive iterative thresholding algorithms for magnetoencephalography (MEG)