In this paper we consider an underdetermined system of equations Lx ϭ b so m Ͻ n. However, the methods given We present an iterative method of preconditioned Krylov type for the solution of large least squares problems. We prove that the in Section 3 can also be used for overdetermined systems. me
Recursive penalized least squares solution for dynamical inverse problems of EEG generation
✍ Scribed by Okito Yamashita; Andreas Galka; Tohru Ozaki; Rolando Biscay; Pedro Valdes-Sosa
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 684 KB
- Volume
- 21
- Category
- Article
- ISSN
- 1065-9471
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In the dynamical inverse problem of electroencephalogram (EEG) generation where a specific dynamics for the electrical current distribution is assumed, we can impose general spatiotemporal constraints onto the solution by casting the problem into a state space representation and assuming a specific class of parametric models for the dynamics. The Akaike Bayesian Information Criterion (ABIC), which is based on the Type II likelihood, was used to estimate the parameters and evaluate the model. In addition, dynamic low‐resolution brain electromagnetic tomography (LORETA), a new approach for estimating the current distribution is introduced. A recursive penalized least squares (RPLS) step forms the main element of our implementation. To obtain improved inverse solutions, dynamic LORETA exploits both spatial and temporal information, whereas LORETA uses only spatial information. A considerable improvement in performance compared to LORETA was found when dynamic LORETA was applied to simulated EEG data, and the new method was applied also to clinical EEG data. Hum. Brain Mapp. 21:221–235, 2004. © 2004 Wiley‐Liss, Inc.
📜 SIMILAR VOLUMES