Statistical image reconstruction

Slides:



Advertisements
Similar presentations
Bayesian Learning & Estimation Theory
Advertisements

Pattern Recognition and Machine Learning
Bayesian Belief Propagation
Mobile Robot Localization and Mapping using the Kalman Filter
Scale & Affine Invariant Interest Point Detectors Mikolajczyk & Schmid presented by Dustin Lennon.
Professor Brian F Hutton Institute of Nuclear Medicine University College London An overview of iterative reconstruction applied.
Herhaling titel van presentatie Simultaneous estimation of the attenuation and emission in TOF-PET Joint work VUB (M Defrise), KULeuven (J. Nuyts,
1 Low-Dose Dual-Energy CT for PET Attenuation Correction with Statistical Sinogram Restoration Joonki Noh, Jeffrey A. Fessler EECS Department, The University.
IMAGE QUALITY.
 Nuclear Medicine Effect of Overlapping Projections on Reconstruction Image Quality in Multipinhole SPECT Kathleen Vunckx Johan Nuyts Nuclear Medicine,
Completion of a Truncated Attenuation Image from the Attenuated PET Emission Data Johan Nuyts, Christian Michel, Matthias Fenchel, Girish Bal, Charles.
Iterative reconstruction for metal artifact reduction in CT 1 the problem projection completion polychromatic ML model for CT local models, bowtie,… examples.
Smoothing 3D Meshes using Markov Random Fields
Maximum likelihood separation of spatially autocorrelated images using a Markov model Shahram Hosseini 1, Rima Guidara 1, Yannick Deville 1 and Christian.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
How well can we learn what the stimulus is by looking at the neural responses? We will discuss two approaches: devise and evaluate explicit algorithms.
Lecture 4 Linear Filters and Convolution
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 3.
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 4.
Bayesian Image Super-resolution, Continued Lyndsey C. Pickup, David P. Capel, Stephen J. Roberts and Andrew Zisserman, Robotics Research Group, University.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Lecture 5: Learning models using EM
MSU CSE 803 Stockman Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute.
1 Markov random field: A brief introduction Tzu-Cheng Jen Institute of Electronics, NCTU
Algebraic and Statistic Reconstruction Algorithms Liran Levy Advanced Topics in Sampling (049029), Winter 2008/9.
Computer vision: models, learning and inference
MSU CSE 803 Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute some result.
Rician Noise Removal in Diffusion Tensor MRI
Maurizio Conti, Siemens Molecular Imaging, Knoxville, Tennessee, USA
Seeram Chapter 11: Image Quality
Advanced Image Processing Image Relaxation – Restoration and Feature Extraction 02/02/10.
Supplementary Material Emission Computed Tomography
Binary Variables (1) Coin flipping: heads=1, tails=0 Bernoulli Distribution.
Image Processing in Freq. Domain Restoration / Enhancement Inverse Filtering Match Filtering / Pattern Detection Tomography.
SegmentationSegmentation C. Phillips, Institut Montefiore, ULg, 2006.
© by Yu Hen Hu 1 ECE533 Digital Image Processing Image Restoration.
Design and simulation of micro-SPECT: A small animal imaging system Freek Beekman and Brendan Vastenhouw Section tomographic reconstruction and instrumentation.
1 Physical Fluctuomatics 5th and 6th Probabilistic information processing by Gaussian graphical model Kazuyuki Tanaka Graduate School of Information Sciences,
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.
ECE 8443 – Pattern Recognition LECTURE 07: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Class-Conditional Density The Multivariate Case General.
Forward-Scan Sonar Tomographic Reconstruction PHD Filter Multiple Target Tracking Bayesian Multiple Target Tracking in Forward Scan Sonar.
Professor Brian F Hutton Institute of Nuclear Medicine University College London Emission Tomography Principles and Reconstruction.
Population coding Population code formulation Methods for decoding: population vector Bayesian inference maximum a posteriori maximum likelihood Fisher.
Lecture 12: Linkage Analysis V Date: 10/03/02  Least squares  An EM algorithm  Simulated distribution  Marker coverage and density.
Li HAN and Neal H. Clinthorne University of Michigan, Ann Arbor, MI, USA Performance comparison and system modeling of a Compton medical imaging system.
1 Markov random field: A brief introduction (2) Tzu-Cheng Jen Institute of Electronics, NCTU
Nuclear Medicine: Tomographic Imaging – SPECT, SPECT-CT and PET-CT Katrina Cockburn Nuclear Medicine Physicist.
Bayes Theorem The most likely value of x derived from this posterior pdf therefore represents our inverse solution. Our knowledge contained in is explicitly.
Single-Slice Rebinning Method for Helical Cone-Beam CT
Impact of Axial Compression for the mMR Simultaneous PET-MR Scanner Martin A Belzunce, Jim O’Doherty and Andrew J Reader King's College London, Division.
Machine Learning 5. Parametric Methods.
Statistical Methods for Image Reconstruction
Regularization of energy-based representations Minimize total energy E p (u) + (1- )E d (u,d) E p (u) : Stabilizing function - a smoothness constraint.
GENERATION OF PARAMETRIC IMAGES PROSPECTS PROBLEMS Vesa Oikonen Turku PET Centre
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
G. Cowan Lectures on Statistical Data Analysis Lecture 10 page 1 Statistical Data Analysis: Lecture 10 1Probability, Bayes’ theorem 2Random variables and.
RECONSTRUCTION OF MULTI- SPECTRAL IMAGES USING MAP Gaurav.
Biointelligence Laboratory, Seoul National University
Chapter-4 Single-Photon emission computed tomography (SPECT)
Degradation/Restoration Model
Latent Variables, Mixture Models and EM
Probabilistic Models for Linear Regression
Tianfang Li Quantitative Reconstruction for Brain SPECT with Fan-Beam Collimators Nov. 24th, 2003 SPECT system: * Non-uniform attenuation Detector.
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Iterative Algorithm g = Af g : Vector of projection data
Linear Operations Using Masks
32nd Annual International Conference of the IEEE Engineering in Medicine and Biology Society Denoising of LSFCM images with compensation for the Photoblinking/Photobleaching.
Filtering Removing components from an image is know as “image filtering”. If we remove the high frequency components, we tend to remove the noise. This.
Probabilistic Surrogate Models
Presentation transcript:

Statistical image reconstruction Intro: SPECT, PET, CT MLEM (back) projection model OSEM MAP uniform resolution anatomical prior lesion detection

PET CT SPECT  y  I e y   ( x ) dx e  y   ( x )  e dx T   (  e   (  ) d L  y E   ( x ) dx L  e    d y E   ( x ) L  e    d dx

Sinogram position projection angle

sinogram

MLEM maximum likelihood expectation maximisation

Maximum Likelihood one wishes to find recon that maximizes p(recon | data) recon data computing p(recon | data) difficult inverse problem computing p(data | recon) “easy” forward problem Bayes: p(data | recon) p(recon) p(recon | data) = ~ p(data)

Maximum Likelihood lj p(recon | data) ~ p(data | recon) data recon projection Poisson lj p(data | recon) j = 1..J i = 1..I ln(p(data | recon)) = L(data | recon) = ~

Maximum Likelihood L(data | recon) find recon: Iterative inversion needed

Expectation Maximisation ML-EM algorithm: produces non-negative solution can be written as additive gradient ascent: only involves projections and backprojections (“easy” forward operations) several useful alternative derivations exist

Expectation Maximisation Optimisation transfer L(data | recon) l likelihood L F In every iteration: = F(data | recon) lcurrent l current lnew with L(data | lcurrent) = F(data | lcurrent)

Iterative Reconstruction likelihood iteration MEASUREMENT iteration COMPARE UPDATE RECON REPROJECTION

FBP vs MLEM h00189 FBP MLEM

FBP vs MLEM uniform Poisson

FBP vs MLEM FBP MLEM Poisson FBP MLEM Poisson uniform uniform

MLEM: non-uniform convergence true image 8 iter 100 iter FBP sinogram with noise smoothed

(back) projection model: model for image resolution

resolution model: simulation projection backprojection

resolution model: simulation no noise mlem mlem Poisson noise

resolution model: simulation no noise Poisson noise

resolution model: simulation compute: estimated sinogram – given sinogram = “unexplained part of the data” no noise Poisson noise

resolution model: simulation compute sum of squared differences along vertical lines

(back)projection in SPECT MLEM with single ray projector MLEM with Gaussian diffusion projector

(back)projection in PET 3D-PET FDG: OSEM, no resolution model 3D-PET FDG: OSEM, with resolution model

8 after iterations assume full convergence  likelihood is maximized  first derivatives are zero small change of the data... can be used to estimate impulse response covariance matrix of ML-solution

8 after iterations Simulation: SPECT system with blurring (detector and collimator): about 8 mm. reconstructed with and without resolution modelling post-filter to have same target resolution compare CNR in 4 points gain in contrast to noise ratio due to better resolution model — Point 1 — Point 2 — Point 3 — Point 4 4 2 8 12 16 target resolution

(back) projection model accurate modeling of the physics: larger fraction of the data becomes consistent  better resolution larger fraction of the noise becomes inconsistent  less noise  we gain twice!  but computation time goes up...

expectation maximisation OSEM ordered subsets expectation maximisation Hudson & Larkin, Sydney

OSEM Reference Subsets... 2 4 8 16 25 50 100 200 Hudson and Larkin 1994 Filtered backprojection of the subsets.

OSEM 1 2 3 4 10 40 1 iteration of 40 subsets (2 proj per subset)

OSEM Reference 1 OSEM iteration with 40 subsets 1 2 3 4 10 40 1 2 3 4 1 2 3 4 10 40 1 2 3 4 10 40 MLEM-iterations

OSEM s1 ML s2 no noise (and subset balance) s3 s4 initial image with noise Convergence to limit cycle Solutions: apply converging block-iterative algorithm: sacrifize some speed for guaranteed convergence gradually decrease the number of subsets ignore the problem (you may not want convergence anyway)

OSEM 64x1 1x64 true difference

MAP maximum a posteriori short intro MAP uniform resolution anatomical priors lesion detection

MAP one wishes to find recon that maximizes p(recon | data) recon data computing p(recon | data) difficult inverse problem computing p(data | recon) “easy” forward problem Bayes: p(data | recon) p(recon) p(recon | data) = ~ p(data)

MAP j k Bayes: p(recon | data) ~ p(data | recon) p(recon) ln p(recon | data) ~ ln p(data | recon) + ln p(recon) posterior likelihood prior - penalty local prior or Markov prior: p(reconj | recon) = p(reconj | reconk, k is neighbor of j) j k Gibbs distribution: p(reconj | recon) = ln p(reconj | recon) = -bj Ej(Nj) + constant

MAP ln p(reconj | recon) = -bj Ej(Nj) E(lj – lk) quadratic Huber Geman

MAP vs smoothed ML MLEM smoothed MAP with quadratic prior

MAP with uniform resolution Likelihood provides non-uniform information: some information is destroyed by attenuation Poisson noise finite detector sensitivity and resolution ... Use non-uniform “prior” to smooth more where likelihood is “strong” less where likelihood is “weak” When postsmoothed-MLEM and MAP have same resolution, they have same covariance!

MAP with uniform resolution equivalent to post-smoothed MLEM prior improves condition number: MAP converges faster than MLEM: fewer iterations required! but more work per iteration

MAP with anatomical prior Grey White CSF prior knowledge, valid for several tracer (FDG, ECD, ...) CSF: no tracer uptake white: uniform, low tracer uptake grey: higher tracer uptake, possibly lesions

MAP with anatomical prior This is an example of using anatomical priors for MAP-reconstruction. This approach is taken as a case to evaluate the use of Lx as a substitute of Ly in a post-processing method, using a simple simulation. In that simulation, we used the same prior as in MAP, and combined it with Sx and Lx. Our experiment indicates that ignoring the covariances causes measureable loss of information [Nuyts et al, M5-2, MIC2003]. MLEM MRI MAP smoothing prior in gray matter (relative difference) Intensity prior in white (with estimated mean) Intensity prior in CSF (mean = 0)

MAP with anatomical prior Theoretical analysis indicates that PV-correction with MAP-reconstruction is superior to PV-correction with post-processed MLEM

MAP with anatomical prior and resolution modeling map sinogram projection with finite resolution (2 pixels FWHM) phantom ml with resolution modeling make anatomical regions uniform ml-p

MAP with anatomical prior ml-p

MAP with anatomical prior MAP yields better noise characteristics than post-processed MLEM

MAP and lesion detection human observer study

MAP and lesion detection observer score MLEM MAP observer response time MLEM MAP more smoothing higher b more smoothing higher b

MAP and lesion detection (non-uniform quadratic) MAP seems better for lesion detection

thanks