Initial-guess grid for the dipole-fit optimiser, with per-guess forward fields pre-computed. More...
#include "../inv_global.h"#include "inv_dipole_forward.h"#include <Eigen/Core>#include <QSharedPointer>#include <vector>

Go to the source code of this file.
Classes | |
| class | INVLIB::InvGuessData |
| Precomputed guess point grid with forward fields for initial dipole position candidates. More... | |
Namespaces | |
| namespace | INVLIB |
| Inverse source estimation (MNE, dSPM, sLORETA, dipole fitting). | |
Initial-guess grid for the dipole-fit optimiser, with per-guess forward fields pre-computed.
SPDX-License-Identifier: BSD-3-Clause Copyright (c) 2026 MNE-CPP Authors
INVLIB::InvGuessData generates and stores the regular grid of candidate dipole positions that seeds the Nelder-Mead optimiser used by InvDipoleFit. For every guess location the corresponding forward-field SVD is pre-computed into an InvDipoleForward, so the per-iteration evaluation cost reduces to a dense matmul. Replaces the guessDataRec record of MNE-C and is built either from a user-supplied guess source space or directly from an inner-skull BEM surface inflated to a regular (mindist, exclude, grid) lattice.
Definition in file inv_guess_data.h.