EE369C: Assignment 4 Solutions

Similar documents
G Practical Magnetic Resonance Imaging II Sackler Institute of Biomedical Sciences New York University School of Medicine. Compressed Sensing

Compressed Sensing Reconstructions for Dynamic Contrast Enhanced MRI

Accelerated MRI Techniques: Basics of Parallel Imaging and Compressed Sensing

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

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

Assignment 2. Due Feb 3, 2012

White Pixel Artifact. Caused by a noise spike during acquisition Spike in K-space <--> sinusoid in image space

EE369C: Assignment 6

Nuts & Bolts of Advanced Imaging. Image Reconstruction Parallel Imaging

2 Michael E. Leventon and Sarah F. F. Gibson a b c d Fig. 1. (a, b) Two MR scans of a person's knee. Both images have high resolution in-plane, but ha

Classification of Subject Motion for Improved Reconstruction of Dynamic Magnetic Resonance Imaging

Parallel Imaging. Marcin.

Compressed Sensing for Rapid MR Imaging

An Introduction to Image Reconstruction, Processing, and their Effects in FMRI

M R I Physics Course

Optimisation of Toshiba Aquilion ONE Volume Imaging

A Bayesian Approach to SENSE Image Reconstruction in FMRI

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

Module 4. K-Space Symmetry. Review. K-Space Review. K-Space Symmetry. Partial or Fractional Echo. Half or Partial Fourier HASTE

Marquette University Iain P. Bruce Marquette University, M. Muge Karaman Marquette University

Fmri Spatial Processing

Supplemental Material for Efficient MR Image Reconstruction for Compressed MR Imaging

6 credits. BMSC-GA Practical Magnetic Resonance Imaging II

Lab Assignment 3 - CSE 377/594, Fall 2007

Improved 3D image plane parallel magnetic resonance imaging (pmri) method

(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

Partial k-space Recconstruction

Error diffusion using linear pixel shuffling

Parallel Magnetic Resonance Imaging (pmri): How Does it Work, and What is it Good For?

29 th NATIONAL RADIO SCIENCE CONFERENCE (NRSC 2012) April 10 12, 2012, Faculty of Engineering/Cairo University, Egypt

Image Compression With Haar Discrete Wavelet Transform

Slide 1. Technical Aspects of Quality Control in Magnetic Resonance Imaging. Slide 2. Annual Compliance Testing. of MRI Systems.

XI Signal-to-Noise (SNR)

Controlled Aliasing in Parallel Imaging Results in Higher Acceleration (CAIPIRINHA)

SIEMENS MAGNETOM Skyra syngo MR D13

Lab Location: MRI, B2, Cardinal Carter Wing, St. Michael s Hospital, 30 Bond Street

EE123 Digital Signal Processing

Chapter 32 3-D and 4-D imaging in Obstetrics and Gynecology

Writing Kirchhoff migration/modelling in a matrix form

Enhancement Image Quality of CT Using Single Slice Spiral Technique

Basic principles of MR image analysis. Basic principles of MR image analysis. Basic principles of MR image analysis

Compressed Sensing Algorithm for Real-Time Doppler Ultrasound Image Reconstruction

Sparse Reconstruction / Compressive Sensing

Partial k-space Reconstruction

GE Healthcare CLINICAL GALLERY. Discovery * MR750w 3.0T. This brochure is intended for European healthcare professionals.

Theoretically Perfect Sensor

Camera Calibration. Schedule. Jesus J Caban. Note: You have until next Monday to let me know. ! Today:! Camera calibration

SYSTEM LINEARITY LAB MANUAL: 2 Modifications for P551 Fall 2013 Medical Physics Laboratory

Corso di laurea in Fisica A.A Fisica Medica 4 TC

Medical Image Processing: Image Reconstruction and 3D Renderings

Higher Degree Total Variation for 3-D Image Recovery

THE STEP BY STEP INTERACTIVE GUIDE

Theoretically Perfect Sensor

Iterative SPECT reconstruction with 3D detector response

What is pmri? Overview. The Need for Speed: A Technical and Clinical Primer for Parallel MR Imaging 8/1/2011

CHAPTER 2 TEXTURE CLASSIFICATION METHODS GRAY LEVEL CO-OCCURRENCE MATRIX AND TEXTURE UNIT

New Technology Allows Multiple Image Contrasts in a Single Scan

A Virtual MR Scanner for Education

Machine Learning for Medical Image Analysis. A. Criminisi

Combination of Parallel Imaging and Compressed Sensing for high acceleration factor at 7T

CT NOISE POWER SPECTRUM FOR FILTERED BACKPROJECTION AND ITERATIVE RECONSTRUCTION

Rain Removal in a Video Sequence

ADAPTIVE GRAPH CUTS WITH TISSUE PRIORS FOR BRAIN MRI SEGMENTATION

MRI image formation 8/3/2016. Disclosure. Outlines. Chen Lin, PhD DABR 3. Indiana University School of Medicine and Indiana University Health

Scaling Calibration in the ATRACT Algorithm

Graphics (Output) Primitives. Chapters 3 & 4

Limited view X-ray CT for dimensional analysis

Computational Medical Imaging Analysis Chapter 4: Image Visualization

Lecture 5: Compression I. This Week s Schedule

Biomedical Image Analysis. Spatial Filtering

An Iterative Approach for Reconstruction of Arbitrary Sparsely Sampled Magnetic Resonance Images

Motion Artifacts and Suppression in MRI At a Glance

Limited View Angle Iterative CT Reconstruction

Medical Image Processing using MATLAB

Multiview Reconstruction

Uniqueness in Bilinear Inverse Problems with Applications to Subspace and Sparsity Models

A Study of Medical Image Analysis System

Frequency analysis, pyramids, texture analysis, applications (face detection, category recognition)

Chapter 3 Set Redundancy in Magnetic Resonance Brain Images

Augmented Lagrangian with Variable Splitting for Faster Non-Cartesian L 1 -SPIRiT MR Image Reconstruction: Supplementary Material

Joint SENSE Reconstruction for Faster Multi-Contrast Wave Encoding

Partially Parallel Imaging With Localized Sensitivities (PILS)

The Problem of Calculating Vertex Normals for Unevenly Subdivided Smooth Surfaces

VD-AUTO-SMASH Imaging

Controlled Aliasing in Volumetric Parallel Imaging (2D CAIPIRINHA)

ComputerLab: compressive sensing and application to MRI

Clinical Importance. Aortic Stenosis. Aortic Regurgitation. Ultrasound vs. MRI. Carotid Artery Stenosis

Efficient MR Image Reconstruction for Compressed MR Imaging

Mapping of Hierarchical Activation in the Visual Cortex Suman Chakravartula, Denise Jones, Guillaume Leseur CS229 Final Project Report. Autumn 2008.

A Novel Iterative Thresholding Algorithm for Compressed Sensing Reconstruction of Quantitative MRI Parameters from Insufficient Data

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

GPU acceleration of 3D forward and backward projection using separable footprints for X-ray CT image reconstruction

Matrices. A Matrix (This one has 2 Rows and 3 Columns) To add two matrices: add the numbers in the matching positions:

Sampling, Ordering, Interleaving

HST.583 Functional Magnetic Resonance Imaging: Data Acquisition and Analysis Fall 2008

Enhao Gong, PhD Candidate, Electrical Engineering, Stanford University Dr. John Pauly, Professor in Electrical Engineering, Stanford University Dr.

The Benefit of Tree Sparsity in Accelerated MRI

Elastic registration of medical images using finite element meshes

Spiral keyhole imaging for MR fingerprinting

Sparse MRI: The Application of Compressed Sensing for Rapid MR Imaging

Transcription:

EE369C Fall 2017-18 Medical Image Reconstruction 1 EE369C: Assignment 4 Solutions Due Wednesday, Oct. 25 The problems this week will be concerned with 2DFT SENSE reconstruction. The data is an axial brain scan with an eight channel head coil. It is available here: http://ee369c.stanford.edu/data/brain_8ch.mat The sensitivities were estimated from the data. The data and coil sensitivities are in the following variables im(160,220,8) the complex, fully encoded images for each channel map(160,220,8) the estimated complex sensitivities for each channel This data and the maps were generated by Miki Lustig. 1. Displaying the Data We have lots of channels, so you will want to display images as an array. One way to do this is use the montage function which is in the image toolbox. Unfortunately, montage wants a 4D array. You can do this with reshape like this: >> montage(reshape(abs(im),160,220,1,8), [0 imax]); where we are displaying the absolute value of im over a range of 0 to imax. Note that the phase encoding direction of the data is the up/down direction, since it is usually taken to be the shortest dimension. If we were displaying this image for clinical purposes, we would rotate it by 90 degrees, to get it into the standard orientation. Show the coil data, and the image data using and appropriate range to see the brain (the subcutaneous fat around the edge of the head should be saturated). Note the variation in coil sensitivities. Solution The image and map data are shown in Figs.?? and??. 2. Multicoil Reconstruction The next task is to compute a reconstruction of the data using the full multicoil reconstruction we described in class, and the square root of the sum of squares reconstruction. Each of these should only require about one line of matlab code! A useful command here is sum(x,nd) which sums an array x along the nd dimension. Display both reconstructions. Ideally the multicoil reconstruction should have slightly better SNR, and be more uniform, although it is hard to tell here. Solution The matlab code to generate the full multicoil reconstruction mcim and the square root of the sum of squares reconstruction sqim are >> mcim = sum(im.*conj(map),3)./sum(map.*conj(map),3); >> sqim = sqrt(sum(im.*conj(im),3)); These are displayed in Fig.??

2 Figure 1: Image data, windowed from 0 to 900 Figure 2: Image data, windowed from 0 to 6

3 Figure 3: Full multicoil reconstruction (left) and the sum of squares reconstruction (right). 3. g-factor Maps The most important characteristic of a SENSE acquisition is the geometry factor g. This tells you how well conditioned the reconstruction problem will be. Write an matlab function that determines the g-factor when undersampling in the x and/or y dimensions: g = gfactor(map,rx, Ry) where map are the coil sensitivities, and Rx and Ry are the acceleration factors in the x and y dimensions. For convenience, assume that Rx and Ry divide evenly into the image dimensions. Since the coil sensitivities were estimated from the data, the sensitivity maps only exist over the head itself. This means that a given voxel can be aliased with a variable number of other voxels, and this can be confusing to keep straight. One option is doing the calculation for each source voxel indepently. This takes longer, but is easier to keep straight. Make the sensitivity of the voxel you are interested in the first column in the C matrix. The aliased voxels are separated in the image by multiples of Nx/Rx and Ny/Ry if the image is Nx by Ny in size. App the sensitivities of any aliased voxels that have non-zero sensitivities to the C matrix. Then when you compute the g factor, just look at the (1,1) element that corresponds to the source voxel you are interested in. That way you don t have to explicitly keep track of how many other voxels are aliased, and where they are. Compute and display the g-factor maps for Rx for 2, 3, and 4, for Ry for 2, 3, and 4, and for Rx=Ry=2. For the factor of 3, reduce the size of the coil data by one to make it evenly divide by 3. Display the results on a scale of [0 5]. Display 0 if there is no sensitivity map at a voxel. Solution The code to generate the g-factor maps is given below function [g, nc] = gfactor(c,rx,ry) [g, nc] = gfactor(c,rx,ry) Compute the g-factor map for a set of coil sensitities and accelerations C -- array of coil sensitivities, Nx x Ny X Nc

4 Ry -- x acceleration Ry -- y acceleration g -- g-factor map nc -- number of coils contributing written by John Pauly (c) Board of Trustees, Leland Stanford Jr University, 2011 [NX NY L] = size(c); NRX = NX/RX; NRY = NY/RY; g = zeros(nx,ny); nc = zeros(nx,ny); for ii=1:nx, for jj=1:ny, if abs(c(ii,jj,1)) < 1e-6, g(ii,jj) = 0; else for LX=0:RX-1, for LY=0:RY-1, ndx = mod((ii-1)+lx*nrx,nx)+1; ndy = mod((jj-1)+ly*nry,ny)+1; CT = C(ndx, ndy, :); CT = CT(:); if ((LX==0) & (LY==0)), s = CT; else if abs(ct(1)) > 1e-6, s = [s CT]; nc(ii,jj) = nc(ii,jj)+1; scs = s *s; scsi = inv(scs); g(ii,jj) = sqrt(scs(1,1)*scsi(1,1)); It take the full maps, and then for each pixel, computes which pixels interfere, and what the g-

5 Figure 4: g-factor maps for accelerations of 2, 3, and 4 in the x and y directions, as well as a an acceleration of 2 in both. The scale here is from 0 to 5. factor is for that set of pixels. It also keeps track of him many pixels are interfering. The g-factors for the various accelerations are shown in Fig.??. 4. Generate Undersampled Images Write a matlab function that takes the fully sampled data, and generates the undersampled aliased images. ima = undersample(im,rx,ry); This will take the image data, do a 2D DFT, zero out lines in the frequency domain, and then inverse transform to produce the aliased images. For a factor of 4, you will zero out three out of every four lines. For Rx=Ry=2 you will zero out every other row and column. Test your routine on the Rx = Ry = 2 case, and display your result.

6 Solution The matlab code that subsamples the data is shown below: function [ima ma] = undersample(im,rx,ry) [ima ma] = undersample(im,rx,ry) generate an accelerated data set im -- original images Rx -- acceleration in x Ry -- acceleration in y ima -- aliased image data ma -- undersampled k-space data (optional) written by John Pauly (c) Board of Trustees, Leland Stanford Jr University, 2011 [Nx Ny L] = size(im); ima = zeros(nx,ny, L); ma = zeros(nx,ny,l); msk = zeros(nx,ny); for ii=1:rx:nx, for jj=1:ry:ny, msk(ii,jj) = 1; for each coil for ll=1:l ma(:,:,ll) = fft2c(im(:,:,ll)).*msk; ima(:,:,ll) = ifft2c(ma(:,:,ll)); The aliased data for accelerations of 2 in x and y is shown in Fig.??. 5. SENSE Reconstruction Finally, write a matlab function that takes the coil sensitivity maps and the aliased, undersampled images from the previous part, and computes the SENSE reconstruction of the image: im = sense(ima, map, Rx, Ry) The program logic is identical to the gfactor function you wrote above. You just have to add the calculation of the image value for each voxel.

7 Figure 5: Image data, windowed from 0 to 900 Reconstruct and display images for Rx of 2 and 4, Ry of 2 and 4, and Rx=Ry=2. As a test, try reconstructing the Rx=Ry=1 case. This should give you exactly the same thing as the multicoil reconstruction for part 2. The full multicoil reconstruction is often called the R = 1 SENSE reconstruction. At low SNR s this does much better than the square root of sum of squares reconstruction. Solution The code for the SENSE reconstruction is shown below. This assumes that the data is tiled to the whole FOV so that it lines up with the maps. It recomputes the decomposition for every pixel, which is inefficient, but simplifies the logic. This looks almost exactly like the g-factor code above. function im = sense( ima, map, RX, RY ) im = sense( ima, map, RX, RY ) ima -- aliased images, undersampled at Rx and Ry, at full FOV map -- maps of the coil sensitivities Rx -- x acceleration factor Ry -- y acceleration factor im -- SENSE reconstruction of ima this assumes that the noise correlation matrix is I

8 written by John Pauly (c) Board of Trustees, Leland Stanford Jr University, 2011 [NX NY L] = size(map ); NRX = NX/RX; NRY = NY/RY; im = zeros(nx,ny); for ii=1:nx, for jj=1:ny, if abs(map(ii,jj,1)) < 1e-6, im(ii,jj) = 0; else for LX=0:RX-1, for LY=0:RY-1, ndx = mod((ii-1)+lx*nrx,nx)+1; ndy = mod((jj-1)+ly*nry,ny)+1; CT = map(ndx, ndy, :); CT = CT(:); if ((LX==0) & (LY==0)), s = CT; else if abs(ct(1)) > 1e-6, s = [s CT]; scs = s *s; scsi = inv(scs); m = ima(ii,jj,:); m = m(:); mr = scsi*s *m; im(ii,jj) = mr(1); The reconstructions are shown in Fig.??. An acceleration of 4 in either dimension causes significant artifacts. A total acceleration of 4 by accelerating by 2 in x and 2 in y does better, but still has noticeable artifacts.

Figure 6: The top two rows are SENSE reconstructions for accelerations of 2 and 4 in x and y. The bottom row shows the acceleration by 2 in both x and y (left), and the R = 1 SENSE reconstruction. 9