Image Reconstruction from Projections - PowerPoint PPT Presentation

View by Category
About This Presentation
Title:

Image Reconstruction from Projections

Description:

Image Reconstruction from Projections ... Estimation of Tissue Components with CT Manual segmentation of tumor by radiologist Parametric model for the tissue ... – PowerPoint PPT presentation

Number of Views:942
Avg rating:3.0/5.0
Slides: 35
Provided by: Jai7110
Learn more at: http://www.cis.hut.fi
Category:

less

Write a Comment
User Comments (0)
Transcript and Presenter's Notes

Title: Image Reconstruction from Projections


1
Image Reconstruction from Projections
  • Antti Tuomas Jalava
  • Jaime Garrido Ceca

2
Overview
  • Reconstruction methods
  • Fourier slice theorem Fourier method
  • Backprojection
  • Filtered backprojection
  • Algebraic reconstruction
  • Diffractive tomography
  • Display of CT images
  • Tissue characterization with CT

3
Projection Geometry
  • Problem Reconstructing 2D Image.
  • Given parallel-ray projections.
  • 1D projection (Radon transform).
  • Density distribution
  • Ray AB
  • Integral evaluated for different values of the
    ray offset t1.
  • 1D projection or Radon transform.

4
(No Transcript)
5
The Fourier Slice Theorem
  • 1D Fourier Transform of 1D projection of 2D image
  • is equal to the radial section (slice or
    profile) of the 2D Fourier Transform of the 2D
    image at the angle of the projection.

6
(No Transcript)
7
The Fourier Slice Theorem
  • How to obtain f(x,y) applying Fourier Slice
    Theorem
  • Assumption we have projections available at all
    angles from 0º to 180º.
  • From projections, we take their 1D Fourier
    transform.
  • Fill the 2D Fourier Space with the corresponding
    radial sections.
  • Take an inverse 2D Fourier transform to obtain
  • Problem finite number of projections available
  • Solution Interpolation is needed in 2D Fourier
    space.

8
Backprojection
  • Simplest reconstruction procedure
  • Assumptions
  • Rays Ideal straight lines.
  • Image dimensionless points.
  • Procedure
  • Estimate of the density at a point by simply
    summing (integrating ) all the rays that pass
    through it at various angles.
  • Problem
  • Finite number of rays per projection
  • Finite number of projections
  • Interpolation is required.

9
Backprojection
  • BP produces a spoke-line pattern blurring
    details.
  • Finite number of projections produces streaking
    artifacts.
  • Reconstructed image modeled by convolution
    between PSF (impulse response) and the original
    image.
  • Solution
  • Applying deconvolution filters to the
    reconstructed image.
  • Filtered BP technique.

10
Point density function
11
Filtered Backprojection
  • After some manipulations, we get
  • where
  • In practice, smoothing window should be applied
    to reduce the amplification of high-frequency
    noise.

12
(No Transcript)
13
Discrete Filtered Backprojection
  • Projection in frequency domain is
    manipulated

14
Discrete Filtered Backprojection
  • The filtered projection may then be
    obtained as

15
Discrete Filtered Backprojection
  • Finally, we get this expression
  • Algorithmic
  • Measure projection.
  • Compute filtered projection.
  • Backproject the filtered.
  • Repeat 1-3 all projection angles

16
Filtered back projection 10
Original
Filtered back projection 1
Back projection 1
17
Algebraic Reconstruction Techniques
  • Projections seen as set of simultaneous
    equations.
  • Kaczmarz method
  • Iterative method.
  • Implemented easily.
  • Assumptions
  • Discrete pixels.
  • Image density is constant within each cell.
  • Equations

18
(No Transcript)
19
Algebraic Reconstruction Techniques
  • Karzmarz method take the approach of successively
    and iteratively projecting an initial guess and
    its successors from one hyperplane to the next.
  • In general, the mth estimate is obtained from the
    (m-1)th estimate as
  • Because the image is updated by altering the
    pixels along each individual ray sum, the index
    of the updated estimate or of the iteration is
    equal to the index of the latest ray sum used.

20
Algebraic Reconstruction Techniques
  • Characteristics worth
  • ART proceed ray by ray and it is iterative
  • Small angles between hyperplanes
  • Large number or iterations
  • It should be reduced by using optimized
    ray-access schemes.
  • MgtN noisy measurements oscillate in the
    neighborhood of the intersections of the
    hyperplanes.
  • MltN under-determined.
  • Any a priori information about image is easily
    introduced into the iterative procedure.

21
Approximations to the Kaczmarz method
  • We could rewrite reconstruction step at the nth
    pixel level as
  • Corrections could also be multiplicative

22
Approximations to the Kaczmarz method
  • Generic ART procedure
  • Prepare an initial estimate
  • Compute ray sum
  • Obtain difference between true ray sum and the
    computed ray sum and apply the correction.
  • Perform Steps 2 and 3 for all rays available.
  • Repeat Steps 2-4 as many times as required.

23
Original
1. 178 angles dt 1 voxel width
3.
2.
24
4.
5.
  • Original again

6.
25
Imaging with Diffraction Sources
  • Non ionizing radiation
  • Ultrasonic
  • Electromagnetic (optical or thermal)
  • Refraction and diffraction
  • Fourier diffraction theorem

26
Imaging with Diffraction Sources
  • When an object, f(x,y), is illuminated with a
    plane wave the Fourier transform of the forward
    scattered fields measured on line TT gives the
    values of the 2-D transform, F(w1,w2), of the
    object along a circular arc in the frequency
    domain, as shown in the right half of the figure.

27
Display of CT Images
  • measured attenuation coefficient.
  • attenuation coefficient of water
  • When K 1000 units are called Hounsfield Units
  • Air -1000 HU
  • Water 0 HU
  • Bone 1000 HU
  • Study
  • 86 healthy infants aged 0-5 years
  • White matter 15 HU to 22 HU
  • Gray matter 23 HU to 30 HU
  • Difference between grey and white matter exactly
    8 HU (In all measurements)
  • Boris P, Bundgaard F, Olsen A. Childs Nerv Syst.
    19873(3)175-7

28
Microtomography
  • µ-scale CT
  • Volume few
  • Nanotomography already introduced.
  • Biomedical use
  • Both dead and alive (in-vivo) rat and mouse
    scanning.
  • Human skin samples, small tumors, mice bone for
    osteoporosis research.

29
Estimation of Tissue Components with CT
  • Manual segmentation of tumor by radiologist
  • Parametric model for the tissue composition
  • Gaussian mixture model
  • Method to estimate the parameters of the model
  • EM algorithm

30
Gaussian Mixture Model (i)
  • Fit M gaussian kernels to intensity histogram

31
Gaussian Mixture Model (ii)
  • Intensity value for voxel is a Gaussian random
    variable.
  • Parameters for ith tissue
  • Probability that voxel belonging to that tissue
    gets value x
  • M number of different tissues in tumor
  • the fraction of belonging to ith tissue
    (probability).
  • Tumor as whole PDF is a mixture of M Gaussians

32
Gaussian Mixture Model (iii)
  • Tumor as whole PDF is a mixture of M Gaussians
  • Probability of parameter set
  • If nothing is known about
  • Find that maximizes likelihood

33
Gaussian Mixture Model (iv)
  • Probability that jth voxel with value
    belongs to the ith tissue type
  • EM algorithm (iterative, chapter 8) -gt

34
Ending Remarks
  • Some image manipulation tasks can be performed in
    1D in radon domain (edge detection etc.).
  • Reconstruction heavily dependent on
    reconstruction algorithm (method).
  • MRI images are usually reconstructed with Fourier
    method (according to book).
  • CT allows fast 3D imaging
  • So does MRI. MRI has better sensitivity
    especially with soft tissues.
About PowerShow.com