Beruflich Dokumente
Kultur Dokumente
4426
Medical Imaging
Computed Tomography
(Part 1)
Yao Wang
Polytechnic School of Engineering
New York University, Brooklyn, NY 11201
Based on Prince and Links, Medical Imaging Signals and Systems and
Lecture Notes by Prince. Figures are from the book.
Lecture Outline
Instrumentation
CT Generations
X-ray source and collimation
CT detectors
Image Formation
Line integrals
Parallel Ray Reconstruction
F14
Radon transform
Back projection
Filtered backprojection
Convolution backprojection
Implementation issues
F14
F14
2nd Generation
F14
F14
4G
Fast
Cannot use
collimator at
detector, hence
affected by
scattering
F14
6G: Helical CT
F14
7G: Multislice
From http://www.kau.edu.sa/Files/0008512/Files/19500_2nd_presentation_final.pdf
F14
10
From http://www.kau.edu.sa/Files/0008512/Files/19500_2nd_presentation_final.pdf
Reduced scan time and increased Z-resolution (thin slices)
Most modern MSCT systems generates 64 slices per rotation, can image
whole body (1.5 m) in 30 sec.
F14
11
Generation
Source
Source Collimation
Detector
1st
Pencil Beam
Single
2nd
Multiple
3rd
Many
Stationary
Ring of
Detectors
4th
5th
Many tungsten
anodes in single
large tube
Fan Beam
Stationary
Ring of
Detectors
6th
3G/4G
3G/4G
3G/4G
Cone Beam
Multiple
array of
detectors
7th
From http://www.kau.edu.sa/Files/0008512/Files/19500_2nd_presentation_final.pdf
F14
12
From http://www.kau.edu.sa/Files/0008512/Files/19500_2nd_presentation_final.pdf
F14
13
X-ray Source
F14
14
Dual Energy CT
Recall that linear attenuation coefficient depends on the
X-ray energy
Dual energy CT enables simultanious acquisition to two
images of the organ, reflecting their attenuation profiles
corresponding to different energies
The scanner has two x-ray tubes using two different
voltage levels to generate the x-rays.
F14
15
X-ray Detectors
Convert detected photons to lights
Convert light to electric current
F14
16
CT Measurement Model
F14
17
18
CT Number
F14
19
Parameterization of a Line
Each projection line is
defined by (l,)
y
Option 2:
=l
F14
20
F14
21
F14
22
F14
23
What is g(l,)?
F14
24
Example
Example 1: Consider an image slice which contains a
single square in the center. What is its projections along
0, 45, 90, 135 degrees?
Example 2: Instead of a square, we have a rectangle.
Repeat.
F14
25
Sinogram
Bottom row: =0 (vertical proj), middle =/2 (horizontal proj), top =-d
F14
26
Backprojection
The simplest method for reconstructing an image from a
projection along an angle is by backprojection
Assigning every point in the image along the line defined by (l,) the
projected value g(l, ), repeat for all l for the given
s
x
F14
27
F14
28
Example
Continue with the example of the image with a square in
the center. Determine the backprojected image from
each projection and the reconstruction by summing
different number of backprojections
F14
29
F14
30
Backprojection Summation
Replaced by a
sum in practice
F14
31
Implementation Issues
g(:,phi) stores the projection data at angle phi corresponding to excentricities stored in s_n
From L. Parra at CUNY, http://bme.ccny.cuny.edu/faculty/parra/teaching/med-imaging/lecture4.pdf
F14
32
Implementation: Projection
F14
33
F14
34
G( , ) = g (l , ) exp{ j 2l}dl
35
F14
36
Proof
Go through on the board
Using the set form of the line integral
See Prince&Links, P. 203 (2nd edition)
G( , ) = g (l , ) exp{ j 2l}dl
F14
37
F14
38
Filtered Backprojection
Inverse 2D FT in Cartesian coordinate:
f ( x, y ) =
F (u , v)e j 2 ( xu + yv ) dudv
f ( x, y) =
=G(,)
=l
0 > 2 0 >
F14
39
F14
40
F14
41
Convolution Backprojection
The Filtered backprojection method requires taking 2 Fourier
transforms (forward and inverse) for each projection
Instead of performing filtering in the FT domain, perform convolution
in the spatial domain
Assuming c(l) is the spatial domain filter
|| <-> c(l)
||G(,) <-> c(l) * g(l,)
For each :
Convolve projection g(l,) with c(l): q(l,)= g(l,) * c(l)
Backprojecting q(l,) to image domain -> b(x,y)
Add b(x,y) to the backprojection sum
F14
42
F14
43
Step 1: Convolution
F14
44
Step 2: Backprojection
F14
45
Step 3: Summation
F14
46
F14
47
F14
48
Common Filters
Ram-Lak: using the rectangular window
Tend to amplify noise
F14
49
Practical Implementation
1 / 4 2 ;
2
c(n) = 1 / (n ) ;
0;
F14
n=0
n = odd
n = even
50
Matlab Implementation
MATLAB (image toolbox) has several built-in functions:
phantom: create phantom images of size NxN
I = PHANTOM(DEF,N) DEF=Shepp-Logan,Modified Shepp-Logan
Can also construct your own phantom, or use an arbitrary image
F14
51
I=phantom(def,N),
DEF='Shepp-Logan, 'Modified Shepp-Logan (default)
R = RADON(I,THETA), e.g. THETA=0:179 or 0:2:179
I = IRADON(R,THETA,INTERPOLATION,FILTER)
Interpoltation filters: used for backprojection
'nearest' - nearest neighbor interpolation,
'linear' - linear interpolation (default),
'spline' - spline interpolation
Reconstruction filter: Ram-Lak (default), 'Shepp-Logan, 'Cosine
F14
52
F14
53
Summary
Different generations of CT machines:
Difference and pros and cons of each
Reconstruction methods
Backprojection summation
Fourier method (projection slice theorem)
Filtered backprojection
Convolution backprojection
F14
54
Reference
Prince and Links, Medical Imaging Signals and Systems,
Chap 6.
Webb, Introduction to biomedical imaging, Appendix B.
Kak and Slanley, Principles of Computerized
Tomographic Imaging, IEEE Press, 1988. Chap. 3
Electronic copy available at
http://www.slaney.org/pct/pct-toc.html
55
Homework
Reading:
Prince and Links, Medical Imaging Signals and Systems, Chap
6, Sec.6.1-6.3.3
F14
56
Added problem
Consider a 4x4 discrete image that contains a diagonal line
I=[1,0,0,0;0,1,0,0;0,0,1,0;0,0,0,1];
a) determine its projections in the directions: 0, 45,90,135 degrees.
b) determine the backprojected image from each projection;
c) determine the reconstructed images by using projections in the 0 and 90
degrees only.
d) determine the reconstructed images by using all projections. Comment on
the difference from c).
Note that for back-projection, you should normalize the backprojection in
each direction based on the total length of projection along that direction in
the square area.
F14
57
Computer Assignment
Due: Two weeks from lecture date
1.
2.
3.
4.
F14
58