Journal Club: mcDESPOT with B0 & B1 Inhomogeneity.

Slides:



Advertisements
Similar presentations
July 31, 2013 Jason Su. Background and Tools Cramér-Rao Lower Bound (CRLB) Automatic Differentiation (AD) Applications in Parameter Mapping Evaluating.
Advertisements

Uncertainty and Information Integration in Biomedical Applications Claudia Plant Research Group for Bioimaging TU München.
More MR Fingerprinting
1 Finite-Length Scaling and Error Floors Abdelaziz Amraoui Andrea Montanari Ruediger Urbanke Tom Richardson.
Relaxometry & Image Processing Technical Update Clinical Findings/Product Need Competitive Info Recommendations T1 (DESPOT1 and LL) parameter fitting via.
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
The loss function, the normal equation,
Planning under Uncertainty
MSmcDESPOT A look at the road behind and ahead October 30, 2009.
Introduction: The lesion-centered view on MS __________________________________________________________________ RRI/TUD/StanU – HH Kitzler Specific Aims:
MSmcDESPOT: Follow-Ups November 1, Where We Are Baseline cross-section conclusions: – DVF is sensitive to early stages of MS where other measures.
Declaration of Conflict of Interest or Relationship I have no conflicts of interest to disclose with regard to the subject matter of this presentation.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Optimization Methods Unconstrained optimization of an objective function F Deterministic, gradient-based methods Running a PDE: will cover later in course.
Optimization Methods One-Dimensional Unconstrained Optimization
MSmcDESPOT: Baseline vs. 1- year Diagnosis. N008 Baseline SPGR.
EDA (CS286.5b) Day 7 Placement (Simulated Annealing) Assignment #1 due Friday.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
The Calibration Process
Optimization Methods One-Dimensional Unconstrained Optimization
Major Points Formal Tests of Mean Differences Review of Concepts: Means, Standard Deviations, Standard Errors, Type I errors New Concepts: One and Two.
Optimization via Search CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
By Rohit Ray ESE 251.  Most minimization (maximization) strategies work to find the nearest local minimum  Trapped at local minimums (maxima)  Standard.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Introduction to Adaptive Digital Filters Algorithms
Computation of the Cramér-Rao Lower Bound for virtually any pulse sequence An open-source framework in Python: sujason.web.stanford.edu/quantitative/ SPGR.
1 IE 607 Heuristic Optimization Simulated Annealing.
ISMRM2012 Review Jun 4, 2012 Jason Su. Outline Parametric Mapping – Kumar et al. A Bayesian Algorithm Using Spatial Priors for Multi-Exponential T2 Relaxometry.
EE369C Final Project: Accelerated Flip Angle Sequences Jan 9, 2012 Jason Su.
Heuristic Optimization Methods
Simulated Annealing.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
J OURNAL C LUB : Lankford and Does. On the Inherent Precision of mcDESPOT. Jul 23, 2012 Jason Su.
Applications of Dynamic Programming and Heuristics to the Traveling Salesman Problem ERIC SALMON & JOSEPH SEWELL.
A CCELERATED V ARIABLE F LIP A NGLE T 1 M APPING VIA V IEW S HARING OF P SEUDO -R ANDOM S AMPLED H IGHER O RDER K-S PACE J.Su 1, M.Saranathan 1, and B.K.Rutt.
MSmcDESPOT A Brief Summary April 2, The Technique mcDESPOT (multi-component driven equilibrium single pulse observation of T1/T2) is a quantitative.
B. Stochastic Neural Networks
Jeff J. Orchard, M. Stella Atkins School of Computing Science, Simon Fraser University Freire et al. (1) pointed out that least squares based registration.
J OURNAL C LUB : Deoni et al. One Component? Two Components? Three? The Effect of Including a Nonexchanging ‘‘Free’’ Water Component in mcDESPOT. Jan 14,
Introduction to Simulated Annealing Study Guide for ES205 Xiaocang Lin & Yu-Chi Ho August 22, 2000.
Local Search and Optimization Presented by Collin Kanaley.
A multiline LTE inversion using PCA Marian Martínez González.
Optimal Design with Automatic Differentiation: Exploring Unbiased Steady-State Relaxometry Jan 13, 2014 Jason Su.
Alice E. Smith and Mehmet Gulsen Department of Industrial Engineering
J OURNAL C LUB : Lin and Song. (Philips and UPenn) Improved Signal Spoiling in Fast Radial Gradient-Echo Imaging: Applied to Accurate T1 Mapping and Flip.
Large-Scale Matrix Factorization with Missing Data under Additional Constraints Kaushik Mitra University of Maryland, College Park, MD Sameer Sheoreyy.
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
Artificial Intelligence in Game Design Lecture 20: Hill Climbing and N-Grams.
Non-parametric Methods for Clustering Continuous and Categorical Data Steven X. Wang Dept. of Math. and Stat. York University May 13, 2010.
A CCELERATED V ARIABLE F LIP A NGLE T 1 M APPING VIA V IEW S HARING OF P SEUDO -R ANDOM S AMPLED H IGHER O RDER K-S PACE J.Su 1, M.Saranathan 1, and B.K.Rutt.
Optimization via Search
Heuristic Optimization Methods
Fisher Information Matrix of DESPOT
Examining mcDESPOT Mar 12, 2013 Jason Su.
Classification of unlabeled data:
Iterative Optimization Method for Accelerated Acquisition and Parameter Estimation in Quantitative Magnetization Transfer Imaging # Computer Henrik.
Collaborative Filtering Matrix Factorization Approach
Introduction to Simulated Annealing
BSSFP Simulations The goal of these simulations is to show the effect of noise on different pcSSFP reconstruction schemes Further examine the uniformity.
ISMRM 2012 Prelim. Abstracts Oct 17, 2011 – Jason Su
More on Search: A* and Optimization
The loss function, the normal equation,
Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014
Mathematical Foundations of BME Reza Shadmehr
Neural Network Training
Area Coverage Problem Optimization by (local) Search
Simulated Annealing & Boltzmann Machines
DISCO-mcDESPOT Nov. 6, 2011 Jason Su.
Presentation transcript:

Journal Club: mcDESPOT with B0 & B1 Inhomogeneity

Papers Deoni et al. Gleaning multicomponent T1 and T2 information from steady-state imaging data. Magn. Reson. Med. (2008) vol. 60 (6) pp Deoni. Correction of main and transmit magnetic field (B0 and B1) inhomogeneity effects in multicomponent-driven equilibrium single-pulse observation of T1 and T2. Magn. Reson. Med. (2010)

mcDESPOT A whole-brain quantitative mapping technique Idea: collect SPGR and SSFP scans at several flip angles – These have a known theoretical steady-state signal equation – Fit the equation as it varies with flip angle to the collected data at each voxel – Gives us: T1, T2, and more Uses a two-compartment model for the signal equation: a fast and slow relaxing species in exchange

scDESPOT Theory DESPOT1: SPGR equation – Find M0 and T1, minimize (S SPGR -Ŝ SPGR ) 2 DESPOT2: SSFP equation – Given T1, find M0 and T2, minimize (S SSFP -Ŝ SSFP ) 2

mcDESPOT Theory 2 component SPGR equation – Find f F, f S, T 1,F, T 1,S, k FS =1/τ F, k SF =1/τ S

mcDESPOT Theory 2 component SSFP equation – Find M0 and T1, minimize (S SPGR -Ŝ SPGR ) 2

mcDESPOT Theory

Simplifying Assumptions 2 component model – Only need to find f F (the fast volume fraction) Chemical equilibrium – Allows us to eliminate finding k SF =1/τ S Both components are on the same resonance

Fitting Method Genetic Algorithm – Previous method, proved to be too slow Stochastic Region of Contraction – Current method, processing time is still substantial (about 24 hrs. for a 2mm isotropic brain) – Supposedly good for avoiding local minima – Not much literature on it (Berger and Silverman. Microphone Array Optimization by Stochastic Region Contraction.)

Stochastic Region of Contraction Has been offered as an alternative to simulated annealing, which can be slow but is very general SRC is good for objective functions with these characteristics: – Few large valleys, many small local minima is fine – The neighborhood around the global minimum is still lower than any other local minima – Depends on <100 variables

Stochastic Region of Contraction Given an initial N-dimensional, rectangular, search volume containing the global optimum – Explore the objective function with random points in the space – Systematically contract the volume until it reaches a satisfactorily small region that traps the global optimum

Stochastic Region of Contraction Algorithm – Define initial search space for: T 1,F&S, T 2,F&S, f F, τ F, Δω s – Treat this rectangular box as a uniform distribution and sample N times – Compute the objective function for each sample – Keep M of the best samples and define the new box based on the ranges of the variables in these samples – Rinse and repeat until convergence

Stochastic Region of Contraction

When Things Go Wrong Simulation of artifacts – B0 effects – B1 and slab profile effects The key assumption of mcDESPOT is that the prescribed flip angle is achieved everywhere in the volume Need to account for this if not the case In vivo at 1.5T (and some proof of concept 3T) – 4 normal volunteers

B0 Solutions B0 mapping DESPOT2-FM with phase-cycled SSFP – Requires collection of another set of 9 SSFP images – Modified signal equation and objective function as presented earlier

When Things Go Wrong: B0 Artifacts

B1 Solutions B1 mapping – AFI, niDALL, Bloch-Siegert DESPOT1-HIFI with IR-SPGR (1 component) – Requires addition of 1 IR-prepped scan – Details of signal equation to derive B1 map not covered here – Gives κ(r):

When Things Go Wrong: B1 Artifacts

In Vivo

B0 and B1 effects are not enough to account for the difference in MWF between mcDESPOT and T2-MCRI (usu. in range of 8-9%)

Conclusions DESPOT1-HIFI does well even thought slab profile changes with angle and assumes single component – Alternatives should be considered though since anatomical structures are visible on the maps: not the best B1 map – Bloch-Siegert seems compelling but need a way to incorporate slab profile as well DESPOT2-FM and phase-cycled SSFP has been a part of the protocol at 1.5T and should also stay when we move to 3T+ – Alternative B0 mapping methods should be considered if they offer a significant benefit in acquisition time

Other Avenues to Explore 3 component model, is another pool skewing the MWF? Are the 2 components actually on the same resonance?