Principles of MRI EE225E / BIO265. Lecture 10. Instructor: Miki Lustig UC Berkeley, EECS. M. Lustig, EECS UC Berkeley

Similar documents
In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

MRI Physics II: Gradients, Imaging

NEWTON S SECOND LAW OF MOTION

k y 2k y,max k x 2k x,max

4.1 3D GEOMETRIC TRANSFORMATIONS

(a Scrhon5 R2iwd b. P)jc%z 5. ivcr3. 1. I. ZOms Xn,s. 1E IDrAS boms. EE225E/BIOE265 Spring 2013 Principles of MRI. Assignment 8 Solutions

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

EE225E/BIOE265 Spring 2011 Principles of MRI. Assignment 5. Solutions

CS 152 Computer Architecture and Engineering. Lecture 7 - Memory Hierarchy-II

Low-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany

EP2200 Queueing theory and teletraffic systems

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.

Sampling, Ordering, Interleaving

Advanced Imaging Trajectories

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

CENG 477 Introduction to Computer Graphics. Modeling Transformations

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

COSC 3213: Computer Networks I Chapter 6 Handout # 7

Digital Geometry Processing Differential Geometry

EECS 487: Interactive Computer Graphics

Scattering at an Interface: Normal Incidence

STEREO PLANE MATCHING TECHNIQUE

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

An Improved Square-Root Nyquist Shaping Filter

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Fast Imaging Trajectories: Non-Cartesian Sampling (1)

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.

the marginal product. Using the rule for differentiating a power function,

Motion along a Line. Describing Motion along a Line

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

Steen Moeller Center for Magnetic Resonance research University of Minnesota

Outline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state

1.4 Application Separable Equations and the Logistic Equation

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES

k y 2k y,max k x 2k x,max

Ray Tracing II. Improving Raytracing Speed. Improving Computational Complexity. Raytracing Computational Complexity

MOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi:

MOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018

Projection & Interaction

Sparse sampling in MRI: From basic theory to clinical application. R. Marc Lebel, PhD Department of Electrical Engineering Department of Radiology

A Fast Stereo-Based Multi-Person Tracking using an Approximated Likelihood Map for Overlapping Silhouette Templates

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

4. Minimax and planning problems

THERMAL PHYSICS COMPUTER LAB #3 : Stability of Dry Air and Brunt-Vaisala Oscillations

NUFFT for Medical and Subsurface Image Reconstruction

Project #1 Math 285 Name:

Chapter 4 Sequential Instructions

Algorithm for image reconstruction in multi-slice helical CT

Motor Control. 5. Control. Motor Control. Motor Control

Ray Casting. Outline. Outline in Code

Gauss-Jordan Algorithm

Field Maps. 1 Field Map Acquisition. John Pauly. October 5, 2005

MFEL Ultrasound in Medicine Part 2 Ultrasound imaging in 2D and 3D

Definition and examples of time series

Coded Caching with Multiple File Requests

CHAPTER 9: Magnetic Susceptibility Effects in High Field MRI

Partial k-space Reconstruction

Optimal Crane Scheduling

Parametric equations 8A

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR

Partial k-space Recconstruction

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time

Traditional Rendering (Ray Tracing and Radiosity)

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)

A METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS

Real-Time Non-Rigid Multi-Frame Depth Video Super-Resolution

A new algorithm for small object tracking based on super-resolution technique

Image warping Li Zhang CS559

Page 1 of 9. Protocol: adult_other_adni3basichumanprotocol25x_ _ _1. 3 Plane Localizer. 3 Plane Localizer PATIENT POSITION

Chapter 3 MEDIA ACCESS CONTROL

Real Time Integral-Based Structural Health Monitoring

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models

Exercise 3: Bluetooth BR/EDR

Video Content Description Using Fuzzy Spatio-Temporal Relations

An Accelerated ISAF Algorithm with the Fast Mapping Strategy

Section 2. Mirrors and Prism Systems

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );

geometric transformations

Reinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi

Evaluations of k-space Trajectories for Fast MR Imaging for project of the course EE591, Fall 2004

Mobile Robots Mapping

Image Content Representation

Optimal trajectory approximation by cubic splines on fed-batch control problems

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks

Lecture 4. Programming with Message Passing: Applications and Performance

Assignment 2. Due Monday Feb. 12, 10:00pm.

Integro-differential splines and quadratic formulae

Midterm Exam Announcements

4 Error Control. 4.1 Issues with Reliable Protocols

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Sampling, Ordering, Interleaving

Tracking a Large Number of Objects from Multiple Views

REDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.

Collision-Free and Curvature-Continuous Path Smoothing in Cluttered Environments

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

Tracking a Large Number of Objects from Multiple Views

Transcription:

Principles of MRI Lecure 0 EE225E / BIO265 Insrucor: Miki Lusig UC Berkeley, EECS

Bloch Eq. For Recepion No B() : 2 4 Ṁ x Ṁ y Ṁ z 3 5 = 2 6 4 T 2 ~ G ~r 0 ~G ~r T 2 0 0 0 T 3 2 7 5 4 M x M y M z 3 5 + 2 4 0 0 T 3 5 M 0 2

Bloch Eq. For Recepion No B() : 2 4 Ṁ x Ṁ y Ṁ z 3 5 = 2 6 4 ~ T 2 G() ~r 0 ~G() ~r T 2 0 0 0 T 3 2 Decouples ino wo independen eqns. 7 5 4 M x M y M z 3 5 + 2 4 0 0 T 3 5 M 0 3

Soluion for Recepion Mz: (2) is already solved! 4

Soluion for Recepion M xy (~r, )=M xy (~r, 0)e T 2 e i~r R 0 ~G( )d Define a Spaial frequency vecor: ~ k() =[kx (),k y (),k z ()] T ~ k() =2 Z ~G( )d 0 5

Soluion for Recepion Transverse Magneizaion Mxy is hen: M xy (~r, )=M xy (~r, 0)e T 2 e i2 ~ k() ~r Received Signal is proporional o Mxy inegraed over volume: Fourier kernel s() = Z ~R M xy (~r, 0)e T 2 e i2 ~ k() ~r d~r Also a funcion of r! 6

Signal Equaion Assume ha T2 is LARGE Z So, s() ~R M xy (~r, 0)e i2 ~ k() ~r d~r 7

k-space 8

Slice Selecive 2D Example Slice Selec in Z Resolve in x,y Need Gx(), Gy() Acquire kx(),ky() 9

k-space Trajecory k ymax k xmax k xmax Exen Resoluion Densiy FOV (nex ime) k ymax Ofen Square coverage Someimes circle Wha are some opions? 0

Radial Scanning (Projecion Reconsrucion) Image opional k-space wha is k-space rajecory? wha is s() A/D oupu?

Radial Scanning (Projecion Reconsrucion) Image 2 3 opional k-space wha is s() A/D oupu? 2

Radial Scanning (Projecion Reconsrucion) Image 2 3 opional k-space 3

Radial Scanning (Projecion Reconsrucion) k-space Repea for each diameer Peak a k()=0 4

2DFT (Spin Warp) k-space k x () k y () 5

2DFT (Spin Warp) k-space 2 pre-winder phase-encode readou/freq.-encode k x () 2 echo-ime (TE) k y () 6

2DFT (Spin Warp) k-space Repea for each line Obain 2D Caresian Grid By far he mos common rajecory! 7

2DFT (Spin Warp) k-space Repea for each line Obain 2D Caresian Grid Overlap prewinders wih slice refocus By far he mos common rajecory! 8

2DFT (Spin Warp) Gy gradien is Phase-Encode gradien Esablishes fixed linear-phase before readou Gx gradien is Frequency-Encode gradien, or Readou = 9

Wha Does This Sequence Do? k x () k y () 20

Muli-Echo 2DFT Echo-Time is when kx()=0 k x () TE TE 2 TE 3 k y () TE TE 2 TE 3 2

Echo Planar Imaging (EPI) More phase encode for each exciaion k x () TE TE 2 TE 3 k y () TE TE 2 TE 3 22

Echo Planar Imaging (EPI) More phase encode for each exciaion phase-encode k x () TE TE 2 TE 3 k y () TE TE 2 TE 3 23

Spiral k-space k x () k y () 24

EPI and Spiral EPI: Mos common high-speed acq. fmri, diffusion, real-ime Can use inerleaved muliple shos Easy DFT reconsrucion Spiral Very hardware efficien Useful for flow/ hears, also used for fmri Ofen muliple inerleaved shos Uses gridding for non-uniform FT reconsrucion 25

Sampling, Resoluion and FOV Signal is sample of FT of objec sampled a discree imes! small m s(n ) =M xy ( ~ k(n )) 26

2DFT Case k x k-space 2 k y 2kymax = Wky Nr - # readou samples Np - # phase encodes k ymax = G y 2 2k xmax = W kx W kx = G x 2 2 k x = W kx N r k y = W ky N p 27

Sampled Fourier Transform In k-space In Image space 28

FOV and Aliasing Assume infinie resoluion (for now...) hen, has an impulse when: 29

FOV and Aliasing k y k x k x no aliasing as long as objec is smaller han FOV k y 30

FOV and Aliasing k y k x k x no aliasing as long as objec is smaller han FOV k y 3

FOV and Aliasing k y k x k x no aliasing as long as objec is smaller han FOV k y 32

From HW Face 4 20 40 60 80 00 20 40 60 80 50 00 50 33

Aliasing in 2DFT k-space Readou is sampling a coninuous ime signal Phase encode is inherenly discree! Aliasing does no occur in frequency encode direcion 34

In pracice: No Aliasing Along Readou s() LPF x s(nδ) Ш(/Δ) ani-aliasing - -/2 FOV x /2 /2 FOV x /2 f[hz],x[cm] no aliasing -/2 /2 f[hz],x[cm] 35

FOV In readou/frequency-encode direcion Increase FOV by increasing sampling rae No change in acquisiion gradiens Jus more daa FOVx is free (almos) no aliasing In phase encode, aliasing can occur Phase-encodes are fundamenally discree FOV y * ) k y = W ky ) N p * N p More acquisiions more scan ime FOVy coss scan ime! 36

Aliasing FOVx pe FOVy fe Q: Wha would he reconsrucion image look like? 37

Aliasing Q: Wha is he difference in acquisiion beween he wo images? phase encode A/P frequency encode L/R frequency encode L/R phase encode A/P 38

r rouine use, now wih 6.3 fold acceleraion. ored delineaion of growh plae (arrowhead) and Aliasing II ying fibroma wih SPIR-iT. small FOV large FOV aliased IV ube resoluion wih Poisson-disc sampling and 5-fold 39

Aliasing in Radial Trajecory Nyquis crieria sill deermined by FOV Cos π imes more han Caresian However: Aliasing is incoheren Degrades gracefully wih reducion of spokes k< FOV 40

Aliasing in Radial 20cm objec, mm resoluion 256 spokes 28 spokes 64 spokes Poin Spread funcion: Reconsucion 4

Differen Samplings rajecory PSF x-secion 42