MNE-CPP
beta 1.0
|
Minimum norm estimation. More...
#include <minimumnorm.h>
Public Types | |
typedef QSharedPointer< MinimumNorm > | SPtr |
typedef QSharedPointer< const MinimumNorm > | ConstSPtr |
Public Member Functions | |
MinimumNorm (const MNEInverseOperator &p_inverseOperator, float lambda, const QString method) | |
MinimumNorm (const MNEInverseOperator &p_inverseOperator, float lambda, bool dSPM, bool sLORETA) | |
virtual MNESourceEstimate | calculateInverse (const FiffEvoked &p_fiffEvoked, bool pick_normal=false) |
virtual MNESourceEstimate | calculateInverse (const MatrixXd &data, float tmin, float tstep) const |
virtual void | doInverseSetup (qint32 nave, bool pick_normal=false) |
virtual const char * | getName () const |
virtual const MNESourceSpace & | getSourceSpace () const |
MNEInverseOperator & | getPreparedInverseOperator () |
void | setMethod (QString method) |
void | setMethod (bool dSPM, bool sLORETA) |
void | setRegularization (float lambda) |
MatrixXd & | getKernel () |
![]() | |
virtual | ~IInverseAlgorithm () |
Minimum norm estimation.
Minimum norm estimation algorithm ToDo: Paper references.
Definition at line 82 of file minimumnorm.h.
typedef QSharedPointer<const MinimumNorm> INVERSELIB::MinimumNorm::ConstSPtr |
Const shared pointer type for MinimumNorm.
Definition at line 86 of file minimumnorm.h.
typedef QSharedPointer<MinimumNorm> INVERSELIB::MinimumNorm::SPtr |
Shared pointer type for MinimumNorm.
Definition at line 85 of file minimumnorm.h.
|
explicit |
Constructs minimum norm inverse algorithm
[in] | p_inverseOperator | The inverse operator |
[in] | lambda | The regularization factor |
[in] | method | Use mininum norm, dSPM or sLORETA. ("MNE" | "dSPM" | "sLORETA") |
Definition at line 70 of file minimumnorm.cpp.
|
explicit |
Constructs minimum norm inverse algorithm
[in] | p_inverseOperator | The inverse operator |
[in] | lambda | The regularization factor |
[in] | dSPM | Compute the noise-normalization factors for dSPM? |
[in] | sLORETA | Compute the noise-normalization factors for sLORETA? |
Definition at line 80 of file minimumnorm.cpp.
|
virtual |
Computes a L2-norm inverse solution Actual code using these principles might be different because the inverse operator is often reused across data sets.
[in] | p_fiffEvoked | Evoked data. |
[in] | pick_normal | If True, rather than pooling the orientations by taking the norm, only the radial component is kept. This is only applied when working with loose orientations. |
Implements INVERSELIB::IInverseAlgorithm.
Definition at line 91 of file minimumnorm.cpp.
|
virtual |
Applies the inverse algorithm to input data and returns a source estimate.
[in] | p_fiffEvoked | Evoked data. |
[in] | tmin | Minimal time point |
[in] | tmin | Time between two samples |
Implements INVERSELIB::IInverseAlgorithm.
Definition at line 188 of file minimumnorm.cpp.
|
virtual |
Returns the algorithm name
Implements INVERSELIB::IInverseAlgorithm.
Definition at line 257 of file minimumnorm.cpp.
|
inline |
Get the prepared inverse operator.
Definition at line 201 of file minimumnorm.h.
|
virtual |
Returns the current mne source space on which the inverse algorithm is performing on. Either from inverse operator (minimum norm estimate), or from forward solution (beamformers)
Implements INVERSELIB::IInverseAlgorithm.
Definition at line 265 of file minimumnorm.cpp.
void MinimumNorm::setMethod | ( | QString | method | ) |
Set minimum norm algorithm method ("MNE" | "dSPM" | "sLORETA")
[in] | method | Use mininum norm, dSPM or sLORETA. |
Definition at line 272 of file minimumnorm.cpp.
void MinimumNorm::setMethod | ( | bool | dSPM, |
bool | sLORETA | ||
) |
Set minimum norm algorithm method ("MNE" | "dSPM" | "sLORETA")
[in] | dSPM | Compute the noise-normalization factors for dSPM? |
[in] | sLORETA | Compute the noise-normalization factors for sLORETA? |
Definition at line 293 of file minimumnorm.cpp.
void MinimumNorm::setRegularization | ( | float | lambda | ) |
Set regularization factor
[in] | lambda | The regularization factor |
Definition at line 318 of file minimumnorm.cpp.