1998
DOI: 10.1016/s0168-5597(97)00091-9
|View full text |Cite
|
Sign up to set email alerts
|

Multi-start downhill simplex method for spatio-temporal source localization in magnetoencephalography

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
102
0

Year Published

1999
1999
2012
2012

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 124 publications
(102 citation statements)
references
References 21 publications
0
102
0
Order By: Relevance
“…The time interval of 20-870 ms poststimulus was analyzed for all task conditions. We developed and used the automated Multistart Downhill Simplex Method for determining source locations, strengths, and magnitudes (Huang et al, 1998;Aine et al, 2000). Nelder and Mead's (1965) downhill simplex search was utilized along with the Sarvas (1987) formula for forward calculations.…”
Section: Source Localization and Statistical Methodsmentioning
confidence: 99%
“…The time interval of 20-870 ms poststimulus was analyzed for all task conditions. We developed and used the automated Multistart Downhill Simplex Method for determining source locations, strengths, and magnitudes (Huang et al, 1998;Aine et al, 2000). Nelder and Mead's (1965) downhill simplex search was utilized along with the Sarvas (1987) formula for forward calculations.…”
Section: Source Localization and Statistical Methodsmentioning
confidence: 99%
“…Instead of using an informed initialization that anticipates some best solution, we run the algorithm several times (using different random initializations) and select the best solution: a similar multi-start procedure has been described by Huang et al (1998). In our experience, to find a good solution, one should at least run four iterations for single dipole models.…”
Section: Initialization and Convergencementioning
confidence: 99%
“…For the large dipole grid used in our median-nerve MEG data analysis with 16,137 dipole sites, the computational time for any of the beamformers was less than 50 sec using MATLAB (Math Works Inc., Massachusetts, USA) on a 600 MHz Pentium III PC. By comparison, a multiple dipole solution using nonlinear global optimization algorithms usually takes a couple of hours for this type of data (Huang et al 1998;Uutela et al 1998). …”
Section: Source Orientations and The Order Of Covariance Matrixmentioning
confidence: 99%
“…Unlike multiple dipole fitting where the number of dipoles has to be determined in advance (Huang et al 1998), the beamformer requires no a priori assumptions about the number of sources to model (Van Veen et al 1997). In addition, the dipole approach which depends on assumption of a point source may not be able to accurately describe the underlying neuronal sources with large extents, whereas the beamformer has the capability to handle such sources (Van Veen et al 1997).…”
Section: Introductionmentioning
confidence: 99%