An Optimal Framework for T1 Estimation in An SPGR Acquisition C. Koay1, L-C. Chang1, S. Deoni2, and C. Pierpaoli1 NICHD, NIH, Bethesda, MD, United States, 2Centre for Neuroimaging Sciences, Institute of Psychiatry, King's College London, London, United Kingdom

1

INTRODUCTION The longitudinal relaxation time, T1, and the magnetization at thermal equilibrium, M0, can be estimated from two or more spoiled gradient recalled echo (SPGR) images acquired with different flip angles and/or repetition times (TR) [1-5]. To date, several approaches have been proposed for selecting the combination of number of data points, flip angles, and TR values that would provide the best estimate (i.e. lowest variance) of a given T1 [1-5]. These previous studies converge to the conclusion that an optimal approach is a two-point acquisition with constant TR, and two flip angles yielding signal equal to 1/√2, ( ≈70.7%) of the signal at the Ernst angle [2]. Numerical verification of this fact was shown by Deoni et al. [4]. However, methods that provide an optimal estimation of a single T1 are not ideally suited for studying the brain and other biological tissue that present a range of T1 values. We argue that to find optimal acquisition parameters for a range of T1 values, it is necessary to take M0 into account since each voxel in the brain contains different pair of M0 and T1. No previous studies have attempted to optimize acquisition parameters for M0. Here, we propose a framework for finding a set of optimal flip angles by minimizing the variance of T1 weighted by the joint density of (M0 , T1) at a single TR. METHODS The nonlinear least squares objective function for T1 estimation can be written as: f =

1 2

∑ (s

i

1− exp( −T / T )

− M 0 sin( α i ) 1−cos( α ) exp(R −T1 / T ) i

R

1

)

2

where s i are the

observed signals, α i are the flip angles, M 0 is the unknown equilibrium longitudinal magnetization, TR is the repetition time, and T1 is the unknown longitudinal relaxation time. The variance of T1 can be shown to be:

Aij =

sin 2 (α i ) sin 2 (α j )(cos(α j ) − 1)(cos(α j ) − cos(α i )) ,

σ T21 ( M 0 , T1 , TR , {α i }) =

σ 2 T14 2

ξ (ξ − 1)TR2 M 02

∑ (sin(α ) /(ξ − cos( α )) / ∑ ∑ A i

i

i

2

i

j

ij

where

ξ = exp(TR / T1 ) and σ is the noise SD. The proposed strategy for selecting a set of optimal flip angles, {α i } , is

(ξ − cos(α i )) 3 (ξ − cos(α j )) 4

by minimizing the sum of all variances of T1 within the brain weighted by the joint density of (M0 , T1), f (m 0 , τ1 ) ; this objective function can be expressed as:



2 ( m0 ,τ1 )∈Ω σ T1 ( m0 , τ1 , TR , {α i }) f

( m0 , τ1 ) where Ω is the region of interest, e.g. the whole brain, the whole white matter, or any particular region.

RESULTS AND DISCUSSION We tested our approach using SPGR acquisitions in the human brain of healthy volunteers. First we computed M0 and o o T1 maps from two-point SPGR images that were optimized for an assumed T1 of 1200 ms according to Wang [2] ( α 1 = 3 , α 2 = 17 ,TR=8.6 ms). Then we computed the marginal histograms of T1, M0, and the smoothed joint histogram of T1 and M0, which are shown respectively in Fig. 3A-3C, for the brain shown in Fig. 1 and 2.

Figure 1. T1 Map

Figure 2. M0 Map

Figure 3A. Histogram of T1

Figure 3B Histogram of M0 Figure 3C. Joint Histogram of T1 and M0

Finally, we recomputed optimal angles with the strategy proposed above. In the example presented, at TR=10 ms, we obtained the following optimal angles : (2.83°, 16.48°), (3.08°, 18.30°, 18.30°), (2.83°, 2.83°, 16.48°, 16.48°), (2.98°, 2.98°, 17.48°, 17.48°, 17.48°) and (2.83°, 2.83°, 2.83°, 16.48°, 16.48°, 16.48°) for a 2-,3-,4-, 5- and 6-point acquisitions, respectively. The mean value of T1 over the entire brain excluding the lateral vectricles was about 1279 ms. The first finding is that for multiple-point acquisitions, the optimal solution is represented by pairs of angles, rather than by a range of angles, as one may have expected. In particular, acquisitions with even number of points, are essentially constructed by “evenly” replicating the two fundamental angles from the two-point acquisition, a finding in line with that of Wang et al.[2] found for optimizing a single value of T1. The second finding is that the pairs of angles found here would have been optimal for a single T1 at about 1389 to 1405 ms, a value much higher than the average value of T1 in the brain studied. CONCLUSION We have presented a simple framework for finding optimal flip angles in computing T1 from SPGR images that is weighted by the joint density of (M0 , T1) at a single TR. Our results suggest that when the proposed optimal acquisition strategy is applied to imaging tissues with a range of T1 and M0 values, it is optimal, in the sense of having lower overall variance of T1, to replicates “evenly” the two fundamental angles in a two-point acquisition — as in the case of a single T1. However, the angles should be set for a T1 higher than the average T1 of the tissue. We believe that our approach represents a first step in defining optimal acquisition parameters for clinical MRI studies aimed at assessing a range of T1 values in tissues from SPGR signals. REFERENCES [1] Kurland RJ. Magn Reson Med. 1985; 2: 136-158. [2] Wang HZ et al. Magn Reson Med. 1987; 5: 399-416. [3] Imran J et al. Magn Reson Imag. 1999; Vol 17: 1347-1356. [4] Deoni SCL et al. Magn Reson Med. 2003; 49: 515-526. [5] Deoni SCL et al. Magn Reson Med. 2004; 51: 194-199.

Proc. Intl. Soc. Mag. Reson. Med. 15 (2007)

1794

An Optimal Framework for T1 Estimation in an SPGR ...

M s f where i s are the observed signals, i α are the flip angles,. 0. M is the unknown equilibrium longitudinal magnetization, R. T is the repetition time, and 1. T is the unknown longitudinal relaxation time. The variance of T1 can be shown to be: (. ) ∑ ∑. ∑ α. −ξ α. −ξξ σ. = α σ i j ij i i i. R i. R. T. A. MT. T. TT. M. /) cos(. /() sin(. )1.

220KB Sizes 1 Downloads 149 Views

Recommend Documents

optimal tax portfolios an estimation of government tax revenue ...
tax.4 Wages and profits are assumed to be stochastic, resulting in stochastic ... Consumption and wage income will not be perfectly correlated as long as wages ...

optimal tax portfolios an estimation of government tax revenue ...
frontiers allows for across state analysis of the relative mean-variance tradeoffs. ...... The arch formed by the actual portfolios held by California in the past 48 .... The corporate profit base, tax sheltering activity, and the changing nature of

An Architectural Framework for Interactive Music Systems
Software Architecture, Interactive Systems, Music soft- ... synthesis of data media of different nature. ... forms (e.g. Max/MSP [19] and Pure Data [24]), and oth-.

AN EVIDENCE FRAMEWORK FOR BAYESIAN ...
generalization, and achieve desirable recognition performance for unknown test speech. Under this framework, we develop an EM iterative procedure to ...

An Argumentation-based Framework for Deliberation in ...
eration policy, and the counterargument generation policy are case-based tech- niques. For join deliberation .... like generation and selection of arguments and counterarguments. In our approach, the ...... and languages that support argumentation, b

An Energy Aware Framework for Virtual Machine Placement in Cloud ...
Authors: Corentin Dupont (Create-Net); Giovanni Giuliani (HP Italy);. Fabien Hermenier (INRIA); Thomas Schulze (Uni Mannheim); Andrey. Somov (Create-Net). An Energy Aware Framework for Virtual. Machine Placement in Cloud Federated. Data Centres. Core

Optimal Training Design for Channel Estimation in ...
Apr 15, 2008 - F. Gao is with the Institute for Infocomm Research, A*STAR, 21 Heng ... California Institute of Technology, Pasadena, CA 91125, USA (Email:.

Optimal Training Design for Channel Estimation in ...
Apr 15, 2008 - Unfortunately, packing more than one antenna onto a small mobile ... Notations: Vectors and matrices are boldface small and capital letters, ...

An Estimation Model for the Savings Achievable by ...
tool chain. Keywords-Cost Estimation; Tool Integration; Software Pro- cess Improvement ... is the integration of tools from different tool vendors and across different ... historical project data. Most algorithmic ..... B. Steece, “COCOMO II Model

Nonparametric Estimation of an Instrumental ...
in the second step we compute the regularized bayesian estimator of ϕ. We develop asymptotic analysis in a frequentist sense and posterior consistency is ...

Toward an Optimal Fusion Scheme for Multisource ...
boosted decision trees and support vector machines (SVM) for ... Cloud forest 60% of the native flora is found in CF ... 2.3 Support vector machine method.

An Optimal Online Algorithm For Retrieving ... - Research at Google
Oct 23, 2015 - Perturbed Statistical Databases In The Low-Dimensional. Querying Model. Krzysztof .... The goal of this paper is to present and analyze a database .... applications an adversary can use data in order to reveal information ...

An optimal explicit time stepping scheme for cracks ...
of element degrees of freedom (in space and time as the crack is growing); ...... Réthoré J., Gravouil A., Combescure A. (2004) Computer Methods in Applied.

NeNMF: An Optimal Gradient Method for Nonnegative ...
IRT1012). N. Guan and Z. Luo are with School of Computer Science, National Univer- ... B. Yuan is with Department of Computer Science and Engineering, Shanghai. Jiao Tong ...... He is currently pursuing the Ph.D. degree in the. School of ...

Nonparametric Estimation of an Instrumental ...
Oct 6, 2009 - ϕ(Z) is not the conditional expectation function E(Y |Z). ... Integral equation of the first kind and recovering its solution ϕ is an ill-posed inverse.

An Optimal Lower Bound for Anonymous Scheduling Mechanisms
An easy observation made by [13] is that the well-known VCG mechanism ... of at most m times the optimal makespan, while making it the dominant strategy ..... Figure 1: An illustration of an instance that is a ({1, ..., j},i)-projection of t, as in D

DESIGN METHOD OF AN OPTIMAL INDUCTION ... - CiteSeerX
Page 1 ... Abstract: In the design of a parallel resonant induction heating system, choosing a proper capacitance for the resonant circuit is quite ..... Wide Web,.

DETERMINING AN OPTIMAL SUPPLY CHAIN STRATEGY INTAHER ...
Hence, these companies find it difficult to manufacture at a competitive cost ... the extremely influential work of Fisher (1997), a company can choose one of ...

An Optimal Lower Bound for Anonymous Scheduling Mechanisms
scheduling algorithms are anonymous, and all state-of-the-art mechanisms ..... Figure 1: An illustration of an instance that is a ({1, ..., j},i)-projection of t, as in Def.

An Optimal Capacity Planning Algorithm for ...
a three-tier web-based service system with multiple server clusters. To the best ..... service deployment. The service provisioning network supports 5 types of ab-.

An Agent Based Model for Studying Optimal Tax ...
Nov 24, 2008 - ... the collection of taxes across the T periods. Formally we can express the government problem as the maximization of the net revenue defined.

An Optimal Lower Bound for Anonymous Scheduling Mechanisms
Mu'alem and Schapira [12] ...... each job independently using some non-affine-maximizer mechanism for single-dimensional domains. (those are abundant).

Is There an Optimal Constitution? - Springer Link
of citizens, while the Brennan-Buchanan equilibrium is the best way to deter the ambitions of self-interested politicians. .... Notice that the Frey equilibrium is a saddle point (L. ∗, P∗. ) .... An optimal control problem that takes into accoun