Direct Fourier Reconstruction

Slides:



Advertisements
Similar presentations
DFT & FFT Computation.
Advertisements

MATLAB Session 5 ES 156 Signals and Systems 2007 HSEAS Prepared by Frank Tompkins.
Mark Mirotznik, Ph.D. Associate Professor The University of Delaware
Fourier Transform (Chapter 4)
Equations. More Organized Proof of The Central Slice Theorem.
2D and 3D Fourier Based Discrete Radon Transform
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.
IMAGE, RADON, AND FOURIER SPACE
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 2.
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 3.
Project Overview Reconstruction in Diffracted Ultrasound Tomography Tali Meiri & Tali Saul Supervised by: Dr. Michael Zibulevsky Dr. Haim Azhari Alexander.
Chapter 4 Image Enhancement in the Frequency Domain.
Modern Sampling Methods Summary of Subspace Priors Spring, 2009.
Week 14. Review 1.Signals and systems 2.State machines 3.Linear systems 4.Hybrid systems 5.LTI systems & frequency response 6.Convolution 7.Fourier Transforms.
Introduction to Fast Fourier Transform (FFT) Algorithms R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Fast Fourier Transform. Agenda Historical Introduction CFT and DFT Derivation of FFT Implementation.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Image reproduction. Slice selection FBP Filtered Back Projection.
Chapter 12 Fourier Transforms of Discrete Signals.
Discrete Fourier Transform(2) Prof. Siripong Potisuk.
Back Projection Reconstruction for CT, MRI and Nuclear Medicine
Chapter 4 Image Enhancement in the Frequency Domain.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Application of Digital Signal Processing in Computed tomography (CT)
Maurizio Conti, Siemens Molecular Imaging, Knoxville, Tennessee, USA
Medical Image Analysis Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
Medical Imaging Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
ENGI 4559 Signal Processing for Software Engineers Dr. Richard Khoury Fall 2009.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
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.
Image Enhancement in the Frequency Domain Spring 2006, Jen-Chang Liu.
Seeram Chapter 7: Image Reconstruction
Filtered Backprojection. Radon Transformation Radon transform in 2-D. Named after the Austrian mathematician Johann Radon RT is the integral transform.
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.
Flow Chart of FBP.. BME 525 HW 1: Programming assignment The Filtered Back-projection Image reconstruction using Shepp-Logan filter You can use any programming.
CT Image Reconstruction. CT Please read Ch 13. Homework is due 1 week from today at 4 pm.
Signals and Systems Lecture #5 1. Complex Exponentials as Eigenfunctions of LTI Systems 2. Fourier Series representation of CT periodic signals 3. How.
Single Photon Emission Computed Tomography
Pre-Class Music Paul Lansky Six Fantasies on a Poem by Thomas Campion.
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.
Frequency Domain Processing Lecture: 3. In image processing, linear systems are at the heart of many filtering operations, and they provide the basis.
1 Reconstruction Technique. 2 Parallel Projection.
Lecture 13  Last Week Summary  Sampled Systems  Image Degradation and The Need To Improve Image Quality  Signal vs. Noise  Image Filters  Image Reconstruction.
Single-Slice Rebinning Method for Helical Cone-Beam CT
1 CMPB 345: IMAGE PROCESSING DISCRETE TRANSFORM 2.
Fourier Transform.
Lecture 21: Fourier Analysis Using the Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan.
Dr. Abdul Basit Siddiqui FUIEMS. QuizTime 30 min. How the coefficents of Laplacian Filter are generated. Show your complete work. Also discuss different.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Basic idea Input Image, I(x,y) (spatial domain) Mathematical Transformation.
Theory of Reconstruction Schematic Representation o f the Scanning Geometry of a CT System What are inside the gantry?
Digital Image Processing Lecture 8: Image Enhancement in Frequency Domain II Naveed Ejaz.
Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.
Sampling and DSP Instructor: Dr. Mike Turi Department of Computer Science & Computer Engineering Pacific Lutheran University.
Jean Baptiste Joseph Fourier
Stencil-based Discrete Gradient Transform Using
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Degradation/Restoration Model
Sample CT Image.
Wavelets : Introduction and Examples
T. Chernyakova, A. Aberdam, E. Bar-Ilan, Y. C. Eldar
Images reconstruction. Radon transform.
Lecture 13: CT Reconstruction
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Presentation transcript:

Direct Fourier Reconstruction Medical imaging Group 1 Members: Chan Chi Shing Antony Chang Yiu Chuen, Lewis Cheung Wai Tak Steven Celine Duong Chan Samson

Abstract Shepp-Logan Head Phantom Model Radon Transform 1D Fourier transformed projection slices of different angles Convert from polar to Cartesian coordinate Inverse 2D Fourier transform. Reconstructed image

Not that simple!!! Problem 1: Continuous Fourier Transform is impractical Solution: Discrete Fourier Transform Problem 2: DFT is slow Solution: Fast Fourier Transform Problem 3: FFT runs faster when number of samples is a power of two Solution: Zeropad Problem 4: F1D Radon Function (polar)  Cartesian coordinate but the data now does not have equal spacing, which needs for IF2D Solution: Interpolation

Agenda 1.Theory 1.1. Central Slice Theorem (CST) 1.1.1 Continuous Time Fourier Transform (CTFT) - > Discrete Time Fourier Transform (DTFT) -> Discrete Fourier Transform (DFT) -> Fast Fourier Transform (FFT) 1.2. Interpolation 2. Experiments 2.1. Basic 2.1.1. Number of sensors 2.1.2. Number of projection slices 2.1.3. Scan angle (<180, >180) 2.2. Advanced 2.2.1. Noise 2.2.2. Sensor Damage 3. Conclusion 4. References

1. Theory – 1.1. Central Slice Theorem (CST) Name of reconstruction method: Direct Fourier Reconstruction The Fourier Transform of a projection at an angle q is a line in the Fourier transform of the image at the same angle. If (s, q) are sampled sufficiently dense, then from g (s, q) we essentially know F(u,v) (on the polar coordinate), and by inverse transform can obtain f(x,y)[1].

1. Theory – 1. 1. Central Slice Theorem (CST) – 1. 1 1. Theory – 1.1. Central Slice Theorem (CST) – 1.1.1 Continuous Time Fourier Transform (CTFT) - > Discrete Time Fourier Transform (DTFT) -> Discrete Fourier Transform (DFT) -> Fast Fourier Transform (FFT) CTFT -> DTFT Description: DTFT is a discrete time sampling version of CTFT Reasons: fast and save memory space DTFT -> DFT Description: DFT is a discrete frequency sampling version of DTFT sampling all frequencies are not possible DFT -> FFT Description: Faster version of FFT Reasons: even faster

1. Theory – 1. 1. Central Slice Theorem (CST) – 1. 1 1. Theory – 1.1. Central Slice Theorem (CST) – 1.1.1 CTFT - > DTFT -> DFT -> FFT Con’t DFT -> FFT Special requirement : Number of samples should be a power of two Solution: Zeropad How to make zeropad? In the sinogram, add black lines evenly on top and bottom Physical meaning? Scan the sample in a bigger space!

1. Theory – 1.2. Interpolation Why we need interpolation? Reasons : Equal spacing for x and y coordinates are required for IF2D Reasons? 1D Fourier Transform of Radon function is in polar coordinate Convert to 2D Cartesian coordinate system, x = rcos q and y = rsin q Solution: Interpolation

1. Theory – 1.2. Interpolation (con’t)

1. Theory – 1.2. Interpolation (con’t)

2. Experiment – 2.1. Basic – 2.1.1. Number of sensors The number of sensors decreases The resolution of the reconstructed images decreases and with low contrast

2. Experiment – 2.1. Basic – 2.1.1. Number of sensors (con’t)

2. Experiment – 2.1. Basic – 2.1.1. Number of sensors (con’t)

2. Experiment – 2.1. Basic – 2.1.1. Number of sensors (con’t)

2. Experiment – 2.1. Basic – 2.1.2. Number of projection slices As the number of projection slices decreases, the reconstructed images become blurry and have many artifacts The resolution can be better by using more slices

2. Experiment – 2.1. Basic – 2.1.2. Number of projection slices (con’t)

2. Experiment – 2.1. Basic – 2.1.2. Number of projection slices (con’t)

2. Experiment – 2.1. Basic – 2.1.3. Scan angle (<180, >180) The image resolution increases as the scanning angle increases Meanwhile artifacts reduced

2. Experiment – 2.2. Advanced – 2.2.1. Noise The noise is added on the sinogram The more the noise, the more the data being distorted

2. Experiment – 2.2. Advanced – 2.2.2. Sensor Damage From the sinogram, each s value in the vertical axis corresponds to a sensor If there is a sensor damaged, then it will appear as a semi-circle artifact

2. Experiment – 2.2. Advanced – 2.2.2. Sensor Damage (con’t) The more the damage sensors, the lower the quality of the reconstructed images Could we … Replace those sensors? Definitely yes! 2. Scan the object by 360o instead of 180o? No.

3. Conclusion Shepp-Logan Head Phantom Model Radon Transform 1D Fourier transformed projection slices of different angles Convert from polar to Cartesian coordinate Inverse 2D Fourier transform. Reconstructed image Direct Fourier Reconstruction uses short computation time to give a good quality image, with all details in the Phantom can be conserved The resolution is high and even there is little artifact, it is still acceptable. To make the reconstructed images better, we can use more sensors use more projection slices scan the Phantom more than 180o add filters to eliminate noise Replaced all damaged sensors.

4. Reference 1. Yao Wang, 2007, Computed Tomography, Polytechnic University 2. Forrest Sheng Bao, 2008, FT, STFT, DTFT, DFT and FFT, revisited, Forrest Sheng Bao, http://narnia.cs.ttu.edu/drupal/node/46

Thank you