๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A parallel approach to STAP implementation for fMRI data

โœ Scribed by Elizabeth A. Thompson


Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
730 KB
Volume
23
Category
Article
ISSN
1053-1807

No coin nor oath required. For personal study only.

โœฆ Synopsis


Abstract

Purpose

To exploit the capabilities of parallel processing in applying the spaceโ€time adaptive processing (STAP) algorithm, previously explored on a small scale for functional magnetic resonance imaging (fMRI) applications, to conventional size fMRI data sets.

Materials and Methods

STAP is a twoโ€dimensional filter that is able to locate fMRI activations in both space and frequency. It is applied here for the construction of brain activation maps in fMRI using Visual Ageยฎ C, incorporating Engineering and Scientific Subroutine Library (ESSLยฎ) functions, compiled in 64โ€bit, and executed on an IBM SP supercomputer.

Results

Computer simulations incorporating actual MRI noise indicate that STAP, incorporated using the method of steepest descent, is feasible on conventional size data sets and exhibits an improvement in detecting activations over the more traditional cross correlation method of fMRI analysis when the response is unknown.

Conclusion

STAP is feasible on traditional size fMRI data sets and useful in elucidating spatial and temporal connectivity. J. Magn. Reson. Imaging 2006. ยฉ 2006 Wileyโ€Liss, Inc.


๐Ÿ“œ SIMILAR VOLUMES


A STAP algorithm approach to fMRI: A sim
โœ Elizabeth A. Thompson; Scott K. Holland; Vincent J. Schmithorst ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 260 KB

## Abstract ## Purpose To adapt the spaceโ€time adaptive processing (STAP) algorithm, previously developed in the field of sensor array processing and applied to radar signal processing, for use in construction of brain activation maps in functional magnetic resonance imaging (fMRI). ## Materials

Towards a complete framework for paralle
โœ Succi, Giancarlo; Uhrik, Carl ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 784 KB

Although logic languages, due to their nnn-declarative nature, are widely proclaimed to be conducive in theory to parallel implementation, in fact there appears to be insufficient practical evidence to stimulate further developments in this field. The paper puts forward various complications which a

A data-parallel approach to multiblock f
โœ M. L. Sawley; J. K. Tegnรฉr ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 869 KB

Multiblock methods are often employed to compute flows in complex geometries. While such methods lend themselves in a natural way to coarse-grain parallel processing by the distribution of different blocks to different processors, in some situations a fine-grain data-parallel implementation may be m

A Comparison of Implementation Strategie
โœ Salvatore Orlando; Raffaele Perego ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 348 KB

Data-parallel languages allow programmers to easily express parallel computations by means of high-level constructs. To reduce overheads, the compiler partitions the computations among the processors at compile-time, on the basis of the static data distribution suggested by the programmer. When exec