Scribd
Upload
49 views30 pages

CT Image Reconstruction

Ct images

Uploaded by

Waqas Mahmood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
49 views30 pages

CT Image Reconstruction

Ct images

Uploaded by

Waqas Mahmood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 30
INTRODUCTION TO COMPUTED TOMO » Computed tomography was invented in 1972 by British engineer Godfrey Hounsfield of EMI laboratories, England and by South African born physicist Allan Cormack of Tufts University, Massachusetts. > The term “computed tomography” (CT) or Computed Axial Tomography (CAT), refers to a computerized x-ray imaging procedure in which a narraw beam of X-rays is aimed at a patient and quickly rotated around the body, producing signals that are detected by series of detectors which are processed by machine's computer to generate cross sectional images or “slices” of the body. > CT is based on the fundamental principle that the density of tissue passed by x-ray beam can be measured from calculation of attenuation caefficient. The first CT scanner was installed between 1974 and 1976, Over time many improvements are done in speed, patients comfort and resolution. GENERATIONS OF CT » 15’ Generation - X-ray tube and two detectors are connected and move together by translation and then rotation, pencil beam used, > 2% Generation - Multiple detectors (around 30) arranged in a row, Translation and rotation movement, fan beam used. » 3* Generation -Multiple detectors (30 9 -40° arc) arranged in row, complete rotation of tube and detectors around the patient, 30° -40° arc. > 4™ Generation - The rotating x-ray tube is positioned within stationary, circular array of detectors. » 5™ Generation - EBCT scanner > 6™ Generation - > 7™ Generation STEPS FOR CT IMAGE FORMATION Image reconstruction is a mathematical process that generates tomographic images from x-ray projection data acquired at many diff les around the patient, tan ecanstruction process is based on use of an algorithm that uses the attenuation data measured by detectors to systematically bulld up the image fo g and interpretation Image reconstruction has fundamental impacts on image quality and radiation dose BASIC TERMS ‘ALGORITHMS » Defined as “set of rules or directions for getting a specific output from specific input”. » Algorithm must always terminate after a finite number of steps. » Algorithms can be represented in form of Flow chart, listing the series of ‘Steps combined altogether by programming language like C++, Java etc. to form a software to do a specific job, > CT reconstruction algorithms converts each attenuation coefficient values obtained splits it into intensity and location at abject, Forming an image with specific grayscale. IMAGE DOMAIN » Images can be represented in two demain on the basis of how they are acquired. 9) SPATIAL LOCATION DOMAIN fo ‘All images displayed for viewing by humans are in spatial location domain. I.e. General radiography and CT acquire images in spatial domain, = Dhkthmrce eordale item. 4 UX Weapuot coset FOURE.7 A righetunded copediaate acm sil 10 exert dal rages in the pail bociton demain. The emer loon of 2 rad «an be Gund wane ‘chun eed pve b) FREQUENCY DOMAIN ‘Small structures within a Object produce higher frequencies that represent detail Images can also be acquired in spatial frequency domain in image, large structure produces low frequencies and represent contrast. ie. MRE information in image. Represented as wave, number of signal changes per unit length Spatial Ui signals ‘tom the MRE signal aquisition trom the patient FIGURE 3-26 ‘The major y aie acquledl \NFtimage reconstruction yess oF MRI signal acquisition to image cisplay. Fir, magnetic resonance (MR) signals who is placed in the inagnet suring the imaging procedure. These the pativar, The signals are subsequeny digitized and stoned in w space. (Lage courtesy Philips Medical Systems.) won the p low frequenctes During convolution, the Kemel maves across the image plsel by piel. Each pbx in input image, its surrounding and kernel are used to compute the value corresponding output » Various convolution filters include: (> High pass filter (Edge enhancement or sharpness) Low pass filter (smoothing) > Un sharp masking (Image restoration) INTERPOLATION Estimation of unknown value between known values is called interpolation techniq Used in spiral CT images reconstruction. A transverse planer image can be reconstructed at any position along the axis of pati vw Interpolation can be used in frequency domain to re-grid the radial sampling to unifon sampting. » Image interpolation creates a number of new slices between known slices in order to isotropic volume image. ‘typical slice plane TYPES OF IMAGE RECONSTRUCTION Simple Back projection 2. Iterative method 3 Analytic method \ Fourier reconstruction algorithms: \\ Filtered back projections 1. SIMPLE BACK PROJECTION METHOD » Also called as “summation method" or “Linear superposition method” (1961), Khul and Edwards (1963). » Not used in commercial CT scanners. » This involves “smearing back" the projection across the image at the angle it was acquit > Rays from two or more projections are superimposed or back projected they produce a reproduction of ariginal object. » Some produced images are ‘starred’ and ‘blurred’ that makes it unsuitable for medical diagnosis. > Inorder to reconstruct the image 180° data is required with fan beam angle. The remain 180° are the mirror of first. (It does not matter which way a photon travels through tissu be attenuated the same amount) » Can be best explained with a Graphical iL il or numerical approach. a es Xray a Fig : Graphical representation of Back projection Reconstruction Technique = 1 Ss me o 2 0 Projected Data Divided by subtract common Constant 1,5,0,3,3,2,4,2,3,2 divisor 3, value6 Fig : Mathematical representation of Back projection Reconstruction Technique ® Problem with back projection includes mainly severe blurring in computed image Appearance of star like structure 2. Iterative reconstruction » Successful approximation method. > An iterative reconstruction starts with an assumption ( all points in matric have same value) and compares this assumption with measured value, make corrections to bring two into agreement and repeats the process over and over again until assumed and measured vatue are same or within acceptable limits’. > Techniques includes:- » Simultaneous iterative reconstruction technique » Iterative least square technique » Algebraic reconstruction technique. roo sean terme | ¢ | 2 [2 Aecragoatont | 23 | UR | ween Pe} 7 ste} > T 4 pdm a — reat Hg Ele Fraime ein | ses conection “treme Fig : Mathematical representation of Iterative Reconstruction Technique Limitations of iterative reconstruction me’ » Difficult to obtain accurate ray sum because of quantum noise and patient motion. » Takes too long to generate the reconstructed image because the iteration can be done only after all projection data sets have been obtained. 3. Analytical method » Current commercial scanner uses this method » Amathematical technique known as Convolution or filtering is used. > Technique employs a spatial filter to remove blurring artifacts, » Two major types- |. Filtered baek projection 2. Fourier Reconstruction Algorithms 1. Filtered back projection » Filtered back projection is also referred as Convolution method. » The projection profile is filtered to remove the typical star like blurring thal characteristic of simple back projection. (io Gece cen components are then cancelled, Image free of Pianeta Fi + Flowchart showing steps in filtered back projection » Filtering refers to altering the projection data before we do the back- projections. » This type of filter picks up sharp edges within the projection (and thus, in the underlying stice) and tends to ignore flat areas. Because the high pass filter actually creates negative pixels at the edges, it subtracts out the extra smearing caused by back projection. sie A the Rg Se ere a ar » The optimal way of eliminating the star like pattern is by use of Ramp filter. » Ramp filter has the effect of filtering out low frequencies and passing high frequencies, with a linear behaviour in between. Thus with this filter, contrasting features (high-frequencies) are accentuated, while blurring (low- frequencies) is minimized. 8 » The combination of ramp filter and back projection is filtered back projection. 2. Fourier Reconstruction Algorithms » Aproperty of Fourier transform, Relates the projection data in spatial location domain to spatial frequency domain. ¥ ¥ Used in MRI image reconstruction. Unlike filtered back projection, this algorithm does not use any filtering as interpotation does the work of rearranging the image components in rectangular grid. » Based on Fourier Slice Theorem. ¥ Fourier Slice Theorem » Fourier slice theorem states that “The Fourier transform of the projection of an object at angle @ is equal to a slice of the Fourier transform of object. along angle @”. P(O,t) Fourier Slice Theorem Projection data obtained in Regrid in uniform sample pattern radial pattern FOURIER TRANSFORM » Developed by a mathematician Baron Jean-Baptiste-Joseph Fourier in 1807 © Used in Radiology for image reconstruction in CT and MRL » Fourier transform is a “mathematical function that converts a signal in spatial domai in frequency domgin”. Ir eee ric Fourier transform Why ? ¥ ‘The image in frequency domain can be manipulated (edge enhancement ‘or smoothing) by changing amplitude of frequency components without lasing the actual signal intensity. 7 Computer can perform manipulations (digital image processing) i.e. MPR, VRT, MIP etc. » Frequency information can be used to measure image quality through the point spread function, line spread function and modulation transfer function, eee ee tacts Cae) GO ec me aos Err ret ee ee eum ane Tae Reon LY etme eau! Geet ick eu uke ae radial pattern thus imust be converted into rectangular grid by Dice Coulee Interpolated image is transformed into spatial domain image eer MATa ct Fig: Flowchart showing steps in Fourier reconstruction algorithm; Thank You

You might also like