Optimization of Designs for fMRI · 1)Assume we know the shape of the HRF but not its amplitude....
Transcript of Optimization of Designs for fMRI · 1)Assume we know the shape of the HRF but not its amplitude....
T.T. Liu August 21, 2007
Optimization of Designs for fMRIUCLA Advanced Neuroimaging Summer School
August 21, 2007
Thomas Liu, Ph.D.UCSD Center for Functional MRI
T.T. Liu August 21, 2007
T.T. Liu August 21, 2007
• Scans are expensive.• Subjects can be difficult to find.• fMRI data are noisy• A badly designed experiment is
unlikely to yield publishable results.• Time = Money
Why optimize?
If your result needs a statistician then you should design abetter experiment. --Baron Ernest Rutherford
T.T. Liu August 21, 2007
• Statistical Efficiency: maximizecontrast of interest versus noise.
• Psychological factors: is the designtoo boring? Minimize anticipation,habituation, boredom, etc.
What to optimize?
T.T. Liu August 21, 2007
Which is thebest design?
E
It depends on theexperimentalquestion.
T.T. Liu August 21, 2007
• Where is the activation?• What does the hemodynamic response
function (HRF) look like?
Possible Questions
T.T. Liu August 21, 2007
1) Assume we know the shape of the HRFbut not its amplitude.
2) Assume we know nothing about theHRF (neither shape nor amplitude).
3) Assume we know something about theHRF (e.g. it’s smooth).
Model Assumptions
T.T. Liu August 21, 2007
General Linear Model
y = Xh + Sb + n
Parameters ofInterest
DesignMatrix
NuisanceParameters
NuisanceMatrixData
AdditiveGaussian
Noise
T.T. Liu August 21, 2007
Example 1: Assumed HRF shape
!
y =
0
0
0.5
1
1
1
0.5
0
0
"
#
$ $ $ $ $ $ $ $ $ $ $ $
%
&
' ' ' ' ' ' ' ' ' ' ' '
h1
+
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
"
#
$ $ $ $ $ $ $ $ $ $ $ $
%
&
' ' ' ' ' ' ' ' ' ' ' '
b1
b2
"
# $ %
& ' +
(1
(2
0
3
(1
1
2
.5
(.2
"
#
$ $ $ $ $ $ $ $ $ $ $ $
%
&
' ' ' ' ' ' ' ' ' ' ' '
Design matrix dependson both stimulus andHRF
Parameter = amplitude of response
Stimulus
Convolve w/ HRF
T.T. Liu August 21, 2007
Design Regressor
⊗ =
The process can be modeled by convolving the activitycurve with a "hemodynamic response function" or HRF
HRF Predicted neural activity
Predicted responseCourtesy of FSL Group and Russ Poldrack
T.T. Liu August 21, 2007
Example 2: Unknown HRF shape
!
y =
0 0 0 0
0 0 0 0
0 0 0 0
1 0 0 0
1 1 0 0
1 1 1 0
0 1 1 1
0 0 1 1
0 0 0 1
"
#
$ $ $ $ $ $ $ $ $ $ $ $
%
&
' ' ' ' ' ' ' ' ' ' ' '
h1
h2
h3
h4
"
#
$ $ $ $
%
&
' ' ' '
+
1 1
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
"
#
$ $ $ $ $ $ $ $ $ $ $ $
%
&
' ' ' ' ' ' ' ' ' ' ' '
b1
b2
"
# $ %
& ' +
(1
(2
0
3
(1
1
2
.5
(.2
"
#
$ $ $ $ $ $ $ $ $ $ $ $
%
&
' ' ' ' ' ' ' ' ' ' ' '
× h1
× h2
× h3
× h4
Unknown shape andamplitude
Note: Design matrixonly depends onstimulus, not HRF
T.T. Liu August 21, 2007
FIR design matrix
FIR estimates
Courtesy of Russ Poldrack
T.T. Liu August 21, 2007
Test Statistic
!
t " parameter estimate
variance of parameter estimate
Thermal noise, physiological noise, lowfrequency drifts, motion
Stimulus, neural activity, field strength, vascular state
Also depends on Experimental Design!!!
T.T. Liu August 21, 2007
Efficiency
!
Efficiency"1
Variance of Parameter Estimate
T.T. Liu August 21, 2007
Efficiency
!
Example 1:
Efficiency"1
Var ˆ h 1( )
!
Example 2 :
Efficiency"1
Var ˆ h 1( ) + Var ˆ h 2( ) + Var ˆ h 3( ) + Var ˆ h 4( )
T.T. Liu August 21, 2007
Known
Covariance Matrix
!
cov ˆ h ( ) =
var ˆ h 1( ) cov ˆ h
1, ˆ h
2( ) L cov ˆ h 1, ˆ h
N( )cov ˆ h
2, ˆ h
1( ) var ˆ h 2( ) L cov ˆ h
2, ˆ h
N( )M M O M
cov ˆ h N, ˆ h
1( ) cov ˆ h N, ˆ h
2( ) L var ˆ h N( )
"
#
$ $ $ $ $
%
&
' ' ' ' '
!
Efficiency"1
Trace cov ˆ h ( )[ ]
Known as an A-optimal design
T.T. Liu August 21, 2007
General Linear Model
y = Xh + n
DataDesignMatrix
HemodynamicResponse
T.T. Liu August 21, 2007
Nuisance Functions
However, to keep things simple, we will ignore thenuisance term Sb in the GLM for this talk.
Nuisance terms (constant term, linear drift, etc) are afact of life in fMRI experiments.
The formulas we derive have the same form whennuisance terms are considered. Just replace X by X⊥,where X⊥ is obtained by projecting the nuisanceterms out of the columns of X. See Liu et al 2001and Liu and Frank 2004 for more details.
T.T. Liu August 21, 2007
Principle of Orthogonality
y
x
E
h1x
!
ETx = 0
y " h1x( )
T
x = 0
h1
=yTx
xTx
Minimum error vector is orthogonal to the
model space.
T.T. Liu August 21, 2007
Principle of Orthogonality
XXh
!
XTE = 0
XT y "Xh( ) = 0
yE
!
" ˆ h = XTX( )
#1
XTy
T.T. Liu August 21, 2007
Covariance of estimate
!
cov ˆ h ( ) = E ˆ h " E ˆ h ( )( ) ˆ h " E ˆ h ( )( )T#
$ %
&
' (
= XTX( )
"1
XTE y "Xh( ) y "Xh( )
T( )X XTX( )
"1
( )= X
TX( )
"1
XTE nn
T( )X XTX( )
"1
( )=) 2
XTX( )
"1
Assume white noise for now
Depends on designDepends on system, physiology, motion, etc.
T.T. Liu August 21, 2007
Example 1: Assumed HRF shape
!
Assume we know the HDR shape h0 but not its amplitude h1
h = h0h1
!
GLM :
y = Xh + n
= Xh0h
1+ n
= ˜ X h1
+ n where ˜ X = Xh0
T.T. Liu August 21, 2007
Example 1: Assumed HRF shape
!
GLM :
y = ˜ X h1
+ n
Efficiency :
" #1
$ 2var ˆ h
1( )
=1
$ 2 ˜ X T ˜ X ( )
%1
=1
$ 2h0
TX
TXh0( )
%1
=h0
TX
TXh0
$ 2
Efficiency depends on boththe design X and the assumed shape h0(plus intrinsic noise)
T.T. Liu August 21, 2007
Interpretation
⊗ =
HRF Predicted neural activity
Predicted response
Modified from FSL Group and Russ Poldrack
h0X
Xh0
!
h0
TXTXh
0 = Xh
0
2 - - measure of how "big" Xh
0 is
T.T. Liu August 21, 2007
E
!
Which design
maximizes h0
TXTXh
0 ?
T.T. Liu August 21, 2007
Frequency Domain Interpretation Boxcar
Randomized ISIsingle-event
Regressor
FFT
Low-pass Low-pass
Adapted From S. Smith and R. Poldrack
T.T. Liu August 21, 2007
Example 2: Unknown HRF Shape
!
GLM :
y = Xh + n
Efficiency :
" #1
$ 2var ˆ h ( )
=1
$ 2Trace X
TX( )
%1
[ ]
Efficiency depends onlyon the design X(plus intrinsic noise)
T.T. Liu August 21, 2007
!
Which design
minimizes
Trace XTX( )
"1
[ ] ?
E
T.T. Liu August 21, 2007
Frequency Domain Interpretation Boxcar
Randomized ISIsingle-event
Regressor
FFT
Low-pass Low-pass
Adapted From S. Smith and R. Poldrack
T.T. Liu August 21, 2007
Maximizing Efficiency
!
Trace XTX( )
"1
[ ] is minimized when the columns of X are
orthogonal.
# Shifted versions of the stimuli need to be orthogonal to each other
!
" Shifted Randomized stimuli are orthogonal on average.
00000
!
" Shifted Block Designs are not orthogonal
T.T. Liu August 21, 2007
Knowledge (Assumptions) about HRF
None Some Total
!
" #1
$ 2Trace X
TX( )
%1
[ ]
!
" #h0
TXTXh
0
$ 2
Depends only on XMaximized by randomized designs
Depends on X and h0Maximized by block designsAlso referred to asdetection power
?
T.T. Liu August 21, 2007
Detection PowerWhen detection is the goal, we want to answer thequestion: is an activation present or not?
When trying to detect something, one needs to specifysome knowledge about the “target”.
In fMRI, the target is approximated by the convolutionof the stimulus with the HRF.
Once we have specified our target (e.g. stimuli andassumed HRF shape), the efficiency for estimating theamplitude of that target can be considered our detectionpower.
T.T. Liu August 21, 2007
Power and Efficiency
Random
SemiRandom
Block
T.T. Liu August 21, 2007
Experimental Data
F-st
atis
tic
T.T. Liu August 21, 2007
Efficiency vs. Power
Detection Power
Estim
atio
n Ef
ficie
ncy
T.T. Liu August 21, 2007
Theoretical Curves
Estim
atio
n Ef
ficie
ncy
Estim
atio
n Ef
ficie
ncy
Estim
atio
n Ef
ficie
ncy
Estim
atio
n Ef
ficie
ncy
T.T. Liu August 21, 2007
Basis Functions
!
If we know something about the shape, we can use a
basis function expansion : h = Bc
4 basis functions
5 random HDRs usingbasis functions
5 random HDRs w/obasis functions
Here if we assume basis functions, we only need toestimate 4 parameters as opposed to 20.
T.T. Liu August 21, 2007
Basis Functions
!
If we know something about the shape, we can use a
basis function expansion : h = Bc
Efficiency now depends on both X and B
!
GLM : y = XBc + n = ˜ X c + n
!
Estimate : ˆ c = BTXTX B( )
"1
BTXTy
ˆ h = Bˆ c = B BTXTX B( )
"1
BTXTy
!
Efficiency :" =1
# 2Trace B B
TXTX B( )
$1BT%
& ' ( ) *
T.T. Liu August 21, 2007
Knowledge (Assumptions) about HRF
None Some Total
!
" #1
$ 2Trace X
TX( )
%1
[ ]
!
" #h0
TXTXh
0
$ 2
!
" =1
# 2Trace B B
TXTX B( )
$1BT%
& ' ( ) *
Depends on X and BMaximized by semi-random designs.Large increases in efficiency as comparedto no assumptions
B = I B =h0
T.T. Liu August 21, 2007
Efficiency with Basis Functions
T.T. Liu August 21, 2007
Knowledge (Assumptions) about HRF
None Some Total
Experiments where you wantto characterize in detail theshape of the HDR.
Experiments where you havea good guess as to the shape(either a canonical form ormeasured HDR) and wantto detect activation.
A reasonable compromise between 1 and 2.Detect activation when you sort of know theshape. Characterize the shape when you sort ofknow its properties
T.T. Liu August 21, 2007
Question
If block designs are so good for detectingactivation, why bother using other typesof designs?
Problems with habituation and anticipation
Less Predictable
T.T. Liu August 21, 2007
EntropyPerceived randomness of an experimental design is animportant factor and can be critical for circumventingexperimental confounds such as habituation and anticipation.
!
2H
r is a measure of the average number of possible outcomes.
Conditional entropy is a measure of randomness in units of bits.
Rth order conditional entropy (Hr) is the average number ofbinary (yes/no) questions required to determine the next trialtype given knowledge of the r previous trial types.
T.T. Liu August 21, 2007
Entropy Example
Maximum entropy is 1 bit, since at most one needs to only askone question to determine what the next trial is (e.g. is the nexttrial A?). With maximum entropy, 21 = 2 is the number ofequally likely outcomes.
Maximum entropy is 2 bits, since at most one would need toask 2 questions to determine the next trial type. Withmaximum entropy, the number of equally likely outcomes tochoose from is 4 (22).
A A N A A N A A A N
A C B N C B A A B C N A
T.T. Liu August 21, 2007
T.T. Liu August 21, 2007
Efficiency ∝ 2^(Entropy)
T.T. Liu August 21, 2007
Multiple Trial Types
1 trial type + control (null)
A A N A A N A A A N
Extend to experiments with multiple trial types
A B A B N N A N B B A N A N A
B A D B A N D B C N D N B C N
T.T. Liu August 21, 2007
Multiple Trial Types GLM
y = Xh + Sb + n
X = [X1 X2 … XQ]
h = [h1T
h2T … hQ
T]T
T.T. Liu August 21, 2007
Multiple Trial Types OverviewEfficiency includes individual trials and also contrastsbetween trials.
!
Rtot
=K
average variance of HRF amplitude estimates
for all trial types and pairwise contrasts
"
# $
%
& '
!
"tot
=1
average variance of HRF estimates
for all trial types and pairwise contrasts
#
$ %
&
' (
T.T. Liu August 21, 2007
Multiple Trial Types Trade-off
T.T. Liu August 21, 2007
Optimal FrequencyCan also weight how much you care about individualtrials or contrasts. Or all trials versus events.Optimal frequency of occurrence depends on weighting.Example: With Q = 2 trial types, if only contrasts are ofinterest p = 0.5. If only trials are of interest, p = 0.2929.If both trials and contrasts are of interest p = 1/3.
!
p =Q(2k
1"1)+Q 2
(1" k1)+ k
1
1/2Q(2k
1"1)+Q 2
(1" k1)( )1/2
Q(Q "1)(k1Q "Q " k
1)
T.T. Liu August 21, 2007
DesignAs the number of trial types increases, it becomes moredifficult to achieve the theoretical trade-offs. Randomsearch becomes impractical.
For unknown HDR, should use an m-sequence baseddesign when possible.
Designs based on block or m-sequences are useful forobtaining intermediate trade-offs or for optimizing withbasis functions or correlated noise.
T.T. Liu August 21, 2007
Optimality of m-sequences
T.T. Liu August 21, 2007
Clustered m-sequences
T.T. Liu August 21, 2007
Topics we haven’t covered.The impact of correlated noise -- this will change theoptimal design.
Impact of nonlinearities in the BOLD response.
Other optimization algorithms -- e.g. genetic algorithms.
T.T. Liu August 21, 2007
Summary• Efficiency as a metric of design
performance.• Efficiency depends on both
experimental design and assumptionsabout HRF.
• Inherent tradeoff between power(detection of known HRF) andefficiency (estimation of HRF)