neuroelf_methods
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
neuroelf_methods [2013/02/01 18:30] – jochen | neuroelf_methods [2013/02/02 00:38] (current) – added cluster table function jochen | ||
---|---|---|---|
Line 5: | Line 5: | ||
===== List of methods (overview) ===== | ===== List of methods (overview) ===== | ||
- | The following list gives an overview on what methods of analysis and parameter estimation are implemented in NeuroElf (as far as they exceed basic operations, such as for example plain averaging across a dimension): | + | The following list gives an overview on what methods of analysis and parameter estimation are implemented in NeuroElf (as far as they exceed basic operations, such as for example plain averaging across a dimension, or auxiliary functions that are used for string manipulation, |
+ | |||
+ | ==== Cluster size threshold estimation (alphasim) ==== | ||
+ | [[alphasim|Cluster size threshold estimation]] is a method that can be used to account for the fact that a regular whole-brain map is made up of multiple (partially) independent tests. One common way is to simply adapt the statistical threshold by dividing the desired false-positive rate (i.e. typically 5 per cent = 0.05) by (an estimate of) the number of independent tests. However, this can be too stringent in some cases where larger swaths of cortex (neurocomputational network nodes) respond to an experimental manipulation below the then required detection threshold. Instead of ensuring significance of results solely by applying a voxel-wise corrected statistical threshold it is possible to estimate **how large clusters are, given the smoothness of the residual, that appear in a given search space at random**. I.e. the alpha-rate (false positives among performed tests) can be estimated by simulating statistical maps of the desired kind and then selecting the appropriate cluster size threshold to ensure that at most 5 per cent of maps (with the residual exhibiting the same smoothness) would show a false positive cluster. The resulting **pair of uncorrected statistical threshold and cluster size threshold together** then correct a whole-brain map to a family-wise-error corrected threshold of desired strength (again usually 0.05). This algorithm is | ||
+ | |||
+ | * implemented in function **'' | ||
+ | * accepts a mask (sub-space specification) | ||
+ | * can be applied to surface statistics (given the mesh vertices and topology, as well as an estimate of the smoothness) | ||
+ | * allows to estimate the cluster size threshold for fully independent components of a conjunction analysis | ||
+ | * as a still experimental feature allows to apply a shift in the Z-distribution to account for shifts in the observed distribution of a statistical map (e.g. by-chance global " | ||
+ | |||
+ | ==== Cluster table generation ==== | ||
+ | [[Cluster table|Cluster tables]] are often presented in publications describing analyses where whole-brain mapping was performed, i.e. the attempt in localizing the spatial nodes within cortex that subserve a specific function. This function is | ||
+ | |||
+ | * implemented in a combination of an M-file, **'' | ||
+ | * whereas the M-file provides a command-line interface with rich options for output formatting, converting coordinates, | ||
+ | * and the C/MEX-file provides the actual clustering of the binary (thresholded and masked) volume into separate spatial nodes | ||
+ | |||
+ | Once a (thresholded) map has been segregated into separate volumes (such that voxels of different clusters do not " | ||
+ | |||
+ | ==== Conjunction analysis (minimum t-statistic) ==== | ||
+ | A [[Conjunction analysis|conjunction analysis]] can be informative when, across the brain, the overlap of two statistical tests is of interest. The most stringent test that can be applied is that of requiring that, in each considered voxel, both tests must be significant at the desired level. This functionality is | ||
+ | |||
+ | * implemented in the function **'' | ||
+ | * implemented in the function **'' | ||
==== Mediation analysis ==== | ==== Mediation analysis ==== | ||
Line 21: | Line 45: | ||
* implemented as a method for [[xff - PLP format|PLP objects]], [[plp.MKDA|PLP:: | * implemented as a method for [[xff - PLP format|PLP objects]], [[plp.MKDA|PLP:: | ||
* available via the [[NeuroElf GUI - MKDA UI|Meta Analysis interface]] | * available via the [[NeuroElf GUI - MKDA UI|Meta Analysis interface]] | ||
+ | |||
+ | ==== Ordinary least-squares (OLS) regression ==== | ||
+ | [[OLS|Ordinary least-squares (OLS) regression]] is the most generic way of applying the General Linear Model (GLM) so as to estimate " | ||
+ | |||
+ | * the most general implementation is done in the **'' | ||
+ | * to assess the significance of the regression (single beta or computed contrasts), the **'' | ||
+ | * a special implementation is contained in the **'' | ||
+ | |||
+ | An additional small number of function files also perform some flavor of linear regression, but those are not applied to functional imaging data (e.g. the function **'' | ||
==== Robust regression ==== | ==== Robust regression ==== | ||
Line 33: | Line 66: | ||
* a special case is for when, in a correlation, | * a special case is for when, in a correlation, | ||
* and to compare means between groups, the two simplified functions **'' | * and to compare means between groups, the two simplified functions **'' | ||
- |
neuroelf_methods.1359743409.txt.gz · Last modified: 2013/02/01 18:30 by jochen