Search PubMed⌕ Search

PubMed · 10385289

Generalized likelihood ratio detection for fMRI using complex data.

Abstract

The majority of functional magnetic resonance imaging (fMRI) studies obtain functional information using statistical tests based on the magnitude image reconstructions. Recently, a complex correlation (CC) test was proposed based on the complex image data in order to take advantage of phase information in the signal. However, the CC test ignores additional phase information in the baseline component of the data. In this paper, a new detector for fMRI based on a generalized likelihood ratio test (GLRT) is proposed. The GLRT exploits the fact that the fMRI response signal as well as the baseline component of the data share a common phase. Theoretical analysis and Monte Carlo simulation are used to explore the performance of the new detector. At relatively low signal intensities, the GLRT outperforms both the standard magnitude data test and the CC test. At high signal intensities, the GLRT performs as well as the standard magnitude data test and significantly better than the CC test.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

F Y Nan, R D Nowak. 1999. Generalized likelihood ratio detection for fMRI using complex data.. https://doi.org/10.1109/42.768841

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

Complexity of the simplest phylogenetic estimation problem.

The maximum-likelihood (ML) solution to a simple phylogenetic estimation problem is obtained analytically The problem is estimation of the rooted tree for three species using binary characters with a symmetrical rate of substitution under the molecular clock. ML estimates of branch lengths and log-likelihood scores are obtained analytically for each of the three rooted binary trees. Estimation of the tree topology is equivalent to partitioning the sample space (space of possible data outcomes) into subspaces, within each of which one of the three binary trees is the ML tree. Distance-based least squares and parsimony-like methods produce essentially the same estimate of the tree topology, although differences exist among methods even under this simple model. This seems to be the simplest case, but has many of the conceptual and statistical complexities involved in phylogeny estimation. The solution to this real phylogeny estimation problem will be useful for studying the problem of significance evaluation.

Likelihood Functions↗

Estimating the total number of protein folds.

Many seemingly unrelated protein families share common folds. Theoretical models based on structure designability have suggested that a few folds should be very common while many others have low probability. In agreement with the predictions of these models, we show that the distribution of observed protein families over different folds can be modeled with a highly-stretched exponential. Our results suggest that there are approximately 4,000 possible folds, some so unlikely that only approximately 2,000 folds existing among naturally-occurring proteins. Due to the large number of extremely rare folds, constructing a comprehensive database of all existent folds would be difficult. Constructing a database of the most-likely folds representing the vast majority of protein families would be considerably easier.

Likelihood Functions↗