Cart (Loading....) | Create Account
Close category search window

A fast iterative greedy algorithm for MEG source localization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Obregon-Henao, G. ; Dept. of Anesthesia, Critical Care, & Pain Med., Massachusetts Gen. Hosp., Boston, MA, USA ; Babadi, B. ; Lamus, C. ; Brown, E.N.
more authors

Recent dynamic source localization algorithms for the Magnetoencephalographic inverse problem use cortical spatio-temporal dynamics to enhance the quality of the estimation. However, these methods suffer from high computational complexity due to the large number of sources that must be estimated. In this work, we introduce a fast iterative greedy algorithm incorporating the class of subspace pursuit algorithms for sparse source localization. The algorithm employs a reduced order state-space model resulting in significant computational savings. Simulation studies on MEG source localization reveal substantial gains provided by the proposed method over the widely used minimum-norm estimate, in terms of localization accuracy, with a negligible increase in computational complexity.

Published in:

Engineering in Medicine and Biology Society (EMBC), 2012 Annual International Conference of the IEEE

Date of Conference:

Aug. 28 2012-Sept. 1 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.