Description

We propose a novel, efficient approach for obtaining high-quality experimental designs for event-related functional magnetic resonance imaging (ER-fMRI), a popular brain mapping technique. Our proposed approach combines a greedy hill-climbing

We propose a novel, efficient approach for obtaining high-quality experimental designs for event-related functional magnetic resonance imaging (ER-fMRI), a popular brain mapping technique. Our proposed approach combines a greedy hill-climbing algorithm and a cyclic permutation method. When searching for optimal ER-fMRI designs, the proposed approach focuses only on a promising restricted class of designs with equal frequency of occurrence across stimulus types. The computational time is significantly reduced.

application/pdf

Download count: 0

Details

Contributors
Date Created
  • 2013-11-30
Resource Type
  • Text
  • Collections this item is in
    Identifier
    • Digital object identifier: 10.1080/00949655.2013.804524
    • Identifier Type
      International standard serial number
      Identifier Value
      0094-9655
    • Identifier Type
      International standard serial number
      Identifier Value
      1563-5163
    Note

    Citation and reuse

    Cite this item

    This is a suggested citation. Consult the appropriate style guide for specific citation guidelines.

    Kao, Ming-Hung, & Mittelmann, Hans D. (2014). A fast algorithm for constructing efficient event-related functional magnetic resonance imaging designs. JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 84(11), 2391-2407. http://dx.doi.org/10.1080/00949655.2013.804524

    Machine-readable links