Theory of Reconstruction Schematic Representation o f the Scanning Geometry of a CT System What are inside the gantry?

Slides:



Advertisements
Similar presentations
Image Reconstruction.
Advertisements

Computer Vision Lecture 7: The Fourier Transform
Presented by Scott Lichtor Introduction to Tomography.
Mark Mirotznik, Ph.D. Associate Professor The University of Delaware
Chap 4 Image Enhancement in the Frequency Domain.
Equations. More Organized Proof of The Central Slice Theorem.
Image Reconstruction T , Biomedical Image Analysis Seminar Presentation Seppo Mattila & Mika Pollari.
IPIM, IST, José Bioucas, X-Ray Computed Tomography Radon Transform Fourier Slice Theorem Backprojection Operator Filtered Backprojection (FBP) Algorithm.
Medical Image Analysis Image Formation Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Chapter 2 Signals and Systems
CT Physics V.G.Wimalasena Principal School of radiography.
Computed Tomography III
IMAGE, RADON, AND FOURIER SPACE
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 2.
Digital Image Processing
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 3.
The 2D Fourier Transform F (2) {f(x,y)} = F(k x,k y ) = f(x,y) exp[-i(k x x+k y y)] dx dy If f(x,y) = f x (x) f y (y), then the 2D FT splits into two 1D.
lecture 5, Sampling and the Nyquist Condition Sampling Outline  FT of comb function  Sampling Nyquist Condition  sinc interpolation Truncation.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
tomos = slice, graphein = to write
Back Projection Reconstruction for CT, MRI and Nuclear Medicine
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
Application of Digital Signal Processing in Computed tomography (CT)
…….CT Physics - Continued V.G.WimalasenaPrincipal School of radiography.
LEC ( 2 ) RAD 323. Reconstruction techniques dates back to (1917), when scientist (Radon) developed mathematical solutions to the problem of reconstructing.
Basic Principles of Computed Tomography Dr. Kazuhiko HAMAMOTO Dept. of Infor. Media Tech. Tokai University.
Image Processing in Freq. Domain Restoration / Enhancement Inverse Filtering Match Filtering / Pattern Detection Tomography.
G Practical MRI 1 The Fourier Transform
These slides based almost entirely on a set provided by Prof. Eric Miller Imaging from Projections Eric Miller With minor modifications by Dana Brooks.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
Chapter 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Seeram Chapter 7: Image Reconstruction
Schematic Representation o f the Scanning Geometry of a CT System
Filtered Backprojection. Radon Transformation Radon transform in 2-D. Named after the Austrian mathematician Johann Radon RT is the integral transform.
Computed Tomography Q & A
PRINCIPLE AND BASIC PHYSICS OF COMPUTED TOMOGRAPHY
Computed Tomography References The Essential Physics of Medical Imaging 2 nd ed n. Bushberg J.T. et.al Computed Tomography 2 nd ed n : Seeram Physics of.
Medical Image Analysis Image Reconstruction Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Image Reconstruction from Projections Antti Tuomas Jalava Jaime Garrido Ceca.
Extended (Finite) Sources. I d (x d,y d ) = I i exp [ - ∫ µ o ((x d /d)z, (y d /d)z, z) dz] I d (x d,y d ) = I i exp [ - ∫ µ o (x d /M, (y d /M, z) dz]
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
ENG4BF3 Medical Image Processing Image Enhancement in Frequency Domain.
Digital Image Processing (Digitaalinen kuvankäsittely) Exercise 2
Computed Tomography Diego Dreossi Silvia Pani University of Trieste and INFN, Trieste section.
If F {f(x,y)} = F(u,v) or F( ,  ) then F( ,  ) = F { g  (R) } The Fourier Transform of a projection at angle  is a line in the Fourier transform.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
1 Reconstruction Technique. 2 Parallel Projection.
High density (& high z material (eg. Calcium Tangstate) photoelectric absorption Screen creates light fluorescent photons. These get captured or trapped.
Single-Slice Rebinning Method for Helical Cone-Beam CT
Ultrasound Computed Tomography 何祚明 陳彥甫 2002/06/12.
Fourier Transform.
Modulation Transfer Function (MTF)
Electromagnetism Around 1800 classical physics knew: - 1/r 2 Force law of attraction between positive & negative charges. - v ×B Force law for a moving.
Lecture 39: Review for Final Final Thursday, May 6 __ Time 4:30 to 6:30 Location Research Room, First Floor, ECB Open book Open note Calculator may be.
Ultrasound Computed Tomography
X-Ray Learning Objectives State general assumptions class makes Understand energy profile of X-ray source Duality Ideal projection X-ray imaging equation.
Jean Baptiste Joseph Fourier
Central Section Theorem
Degradation/Restoration Model
Sample CT Image.
Image Enhancement in the
Modern imaging techniques in biology
CT Learning Objectives
Basic Principles of Computed Tomography
4. Image Enhancement in Frequency Domain
Basic Image Processing
Presentation transcript:

Theory of Reconstruction

Schematic Representation o f the Scanning Geometry of a CT System What are inside the gantry?

2 % attenuation change detectable in film 0.2 % change in attenuation coefficient ∑ ∑ ∑ ∑ ∑ CT, like X-ray measure line integrals x y f(x,y) g(R) = CT detector array output g(R)

Radon Transform 1917 Central Section Theorem - Bracewell The transform of each projection forms a line, at that angle, in the 2D FT of f(x,y) f(x,y) g(R) g(R) = ∫ f(x,y) dy We will skip the Algebraic Reconstruction Technique

{f(x,y)} => F (u,v) = ∫∫ f(x,y) e -i 2π (ux +vy) dx dy F(u,0) = ∫ [ ∫ f(x,y) dy] e -i 2π ux dx So F(u,0) is the Fourier transform of the projection formed from line integrals along the y direction. v u F(u,0) First, let’s think of our experience on the meaning of F(u,0) in the Fourier transform.

Incident x-rays pass through the object f(x,y) from upper left to lower right at the angle 90 + . For each point R, a different line integral describes the result on the function g  (R). g  (R) is measured by an array of detectors or a moving detector. The thick line (in next slice) is described by x cos  + y sin  = R I have just drawn one thick line to show one line integral, but the diagram is general and pertains to any value of R.

The 1D Fourier Transform of a projection at angle  forms a line in the 2D Fourier space of the image at the same angle. y x r R Incident X-rays  ø f(x,y) Detected g  (R) R

F(u,v) u v 1D Fourier Transforms of all projections at angles  =1-360 forms a 2D Fourier space of the image.

The projection g  (R) can thus be calculated as a set of line integrals, each at a unique R. g  (R) = ∫ ∫ f(x,y)  (x cos  + y sin  - R) dx dy 2π ∞ g  (R) = ∫ ∫ f(r,  )  (r cos (  -  ) - R) r dr d  0 0 In the second equation, we have translated to polar coordinates. Again g  (R) is a 1D function of R.

In CT, the recon algorithm calculates the  of each pixel. x-ray = N o e -∫  dz recorder intensity For each point along a projection g  (R), the detector calculates a line integral. n 0 =Incoming photon density  (x,y) Detector i th line integral NiNi X-ray Source of area A

N i = n 0 A exp ∫ i -  dl = N 0 exp ∫ i -  dl N 0 = n 0 A where A is area of detector and The calculated line integral is ∫ i  dl = ln (N 0 /N i ) Mean =  ≈ ln (N 0 /N i )  2 (measured variance) ≈ 1/N i Now we use these line integrals to form the projections g  (R). These projections are processed with convolution back projection to make the image. SNR = C  /  

M  (x,y) = ∑ g  (R) * c(R) *  (R-R’) ∆  i = 1 add projections convolution back projection Where: R’ = r cos (  -  ) ∆  = π/M (usually) π   = M/π ∫ g  (R) * c(R)*  (R-R’) d  0 Discrete Backprojection over M projections

Recall  = M/π ∫ g  (R) * c(R)*  (R-R') d  H(u) = (M/π) (C(  ) / |  |) is system impulse response of CT system C(  ) is the convolution filter that compensates for the 1/|  | weighting from the back projection operation Let’s get a gain (DC) of 1. Find a C(  ) to do this. We can consider C(  ) = |  | a rect(  / 2  0 ). Find constant a If we set H(0) = 1, DC gain is 1. H(0) = (M/π) a  a = π/M Therefore, C(u) = (π/M) |  | rect(  / 2   ). C(u) u0u0 This makes sense – if we increase the number of angles M, we should attenuate the filter gain to get the same gain.

At this point, we have selected a filter for the convolution-back projection algorithm. It will not change the mean value of the CT image. So we just have to study the noise now. The noise in each line integral is due to differing numbers of photons. The processes creating the difference are independent. - different section of the tube, body paths, detector

Recall π  = M/π ∫ g  (R) * c(R)*  (R-R’) d  0 Then the variance at any pixel π   2 = M/π ∫  g 2 (R)  (R) * [c 2 (R)] d  0 variance of any one detector measurement Assume with n = average number of transmitted photons per unit beam width and h = width of beam convolution

π   2 = (M/π) (1/ (nh)) ∫ d  ∫ c 2 (R) dR = M/nh ∫ c 2 (R) dR 0 Easier to evaluate in frequency domain. Using Parseval’s Rule ∞   2 = M/(nh) ∫ |C(  )| 2 d  -∞ C(u) u0u0  /M

The cutoff for our filter C(  ) will be matched to the detector width w. Let’s let u 0 = K/w where K is a constant Combine all the constants n was defined over a continuous projection Let N = nA = nwh = average number of photons per detector element.

In X-ray, SNR  √N For CT, there is an additional penalty. To see this, cut w in ½. What happens to SNR? Why  Due to convolution operation