Image Registration 박성진.

Slides:



Advertisements
Similar presentations
Pattern Recognition and Machine Learning
Advertisements

SPM5 Segmentation. A Growing Trend Larger and more complex models are being produced to explain brain imaging data. Bigger and better computers allow.
Modeling of Data. Basic Bayes theorem Bayes theorem relates the conditional probabilities of two events A, and B: A might be a hypothesis and B might.
Managerial Economics in a Global Economy
The General Linear Model Or, What the Hell’s Going on During Estimation?
OverviewOverview Motion correction Smoothing kernel Spatial normalisation Standard template fMRI time-series Statistical Parametric Map General Linear.
Chapter 6 Feature-based alignment Advanced Computer Vision.
Chapter 4: Linear Models for Classification
776 Computer Vision Jared Heinly Spring 2014 (slides borrowed from Jan-Michael Frahm, Svetlana Lazebnik, and others)
Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.
Robust and large-scale alignment Image from
Motion Analysis Slides are from RPI Registration Class.
Mutual Information Mathematical Biology Seminar
1 Improving Entropy Registration Theodor D. Richardson.
Non-Rigid Registration. Why Non-Rigid Registration  In many applications a rigid transformation is sufficient. (Brain)  Other applications: Intra-subject:
1 GEOMETRIE Geometrie in der Technik H. Pottmann TU Wien SS 2007.
Motion Analysis (contd.) Slides are from RPI Registration Class.
CSci 6971: Image Registration Lecture 4: First Examples January 23, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart, RPI Dr.
Curve-Fitting Regression
Fitting. We’ve learned how to detect edges, corners, blobs. Now what? We would like to form a higher-level, more compact representation of the features.
ON THE IMPROVEMENT OF IMAGE REGISTRATION FOR HIGH ACCURACY SUPER-RESOLUTION Michalis Vrigkas, Christophoros Nikou, Lisimachos P. Kondi University of Ioannina.
Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.
Computing motion between images
Mutual Information for Image Registration and Feature Selection
Yujun Guo Kent State University August PRESENTATION A Binarization Approach for CT-MR Registration Using Normalized Mutual Information.
Independent Component Analysis (ICA) and Factor Analysis (FA)
Preprocessing II: Between Subjects John Ashburner Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.
Radial Basis Function Networks
EE513 Audio Signals and Systems Statistical Pattern Classification Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Binary Variables (1) Coin flipping: heads=1, tails=0 Bernoulli Distribution.
CSE 185 Introduction to Computer Vision
Computer vision.
Speech Recognition Pattern Classification. 22 September 2015Veton Këpuska2 Pattern Classification  Introduction  Parametric classifiers  Semi-parametric.
Chem Math 252 Chapter 5 Regression. Linear & Nonlinear Regression Linear regression –Linear in the parameters –Does not have to be linear in the.
Medical Imaging Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
Jan Kamenický Mariánská  We deal with medical images ◦ Different viewpoints - multiview ◦ Different times - multitemporal ◦ Different sensors.
Curve-Fitting Regression
MEDICAL IMAGE REGISTRATION BY MAXIMIZATION OF MUTUAL INFORMATION Dissertation Defense by Chi-hsiang Lo June 27, 2003 PRESENTATION.
ECE 8443 – Pattern Recognition LECTURE 10: HETEROSCEDASTIC LINEAR DISCRIMINANT ANALYSIS AND INDEPENDENT COMPONENT ANALYSIS Objectives: Generalization of.
Feature based deformable registration of neuroimages using interest point and feature selection Leonid Teverovskiy Center for Automated Learning and Discovery.
Spatio-Temporal Free-Form Registration of Cardiac MR Image Sequences Antonios Perperidis s /02/2006.
MACHINE LEARNING 8. Clustering. Motivation Based on E ALPAYDIN 2004 Introduction to Machine Learning © The MIT Press (V1.1) 2  Classification problem:
A New Method of Probability Density Estimation for Mutual Information Based Image Registration Ajit Rajwade, Arunava Banerjee, Anand Rangarajan. Dept.
CS654: Digital Image Analysis
Medical Image Analysis Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
Machine Learning 5. Parametric Methods.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Medical Image Analysis Dr. Mohammad Dawood Department of Computer Science University of Münster Germany.
1 Information Content Tristan L’Ecuyer. 2 Degrees of Freedom Using the expression for the state vector that minimizes the cost function it is relatively.
Fitting.
Dimension reduction (1) Overview PCA Factor Analysis Projection persuit ICA.
Part 3: Estimation of Parameters. Estimation of Parameters Most of the time, we have random samples but not the densities given. If the parametric form.
776 Computer Vision Jan-Michael Frahm Spring 2012.
Yun, Hyuk Jin. Introduction MAGNETIC RESONANCE (MR) signal intensity measured from homogeneous tissue is seldom uniform; rather it varies smoothly across.
Regression Analysis AGEC 784.
LECTURE 11: Advanced Discriminant Analysis
University of Ioannina
Mutual Information Based Registration of Medical Images
Dynamical Statistical Shape Priors for Level Set Based Tracking
Multi-modality image registration using mutual information based on gradient vector flow Yujun Guo May 1,2006.
Statistical Methods For Engineers
Image Preprocessing for Idiots
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.
EE513 Audio Signals and Systems
5.2 Least-Squares Fit to a Straight Line
Parametric Methods Berlin Chen, 2005 References:
Region-Based Segmentation
EM Algorithm and its Applications
Calibration and homographies
Image Registration  Mapping of Evolution
Presentation transcript:

Image Registration 박성진

Surface-based Registration The 3D boundary of an anatomical object is an intuitive and easily characterized geometrical feature that can be used for registration Surface-based methods Determine corresponding surfaces in different images Find the transformation that best aligns these surfaces Point-based registration Aligns generally small number of corresponding points Surface-based registration Aligns larger number of points for which correspondence is unavailable

Surfaces Skin surface (air-skin interface) Bone surface (tissue-bone interface) Representations Point set (collection of points on the surface) Faceted surface, e.g., triangle set approximating surface Implicit surface Parametric surface, e.g., B-spline surface

Surface-based Registration Disparity function Given a set of surface points and a surface, find the rigid transformation that minimizes the mean squared distance between the points and the surface

Head and Hat Method

Iterative Closest Point Method Initialization: Iteratively apply the following steps, incrementing k after each loop, until convergence within a tolerance is achieved: Compute the closest points Compute the transformation between the initial point set and current set Apply the transformation to produce registered points Terminate the iterative loop when

Intensity-based registration Registration based on similarity measures Uses some measure derived from the intensity of the image directly Assumes that there is a relationship between the image intensities of both images if the images are registered Does not require any feature extraction, thus the registration error is not by any errors

Generic Intensity-based Registration Procedure Initial transformation Calculate cost function For transformation T Optimize T by maximizing cost function C Update transformation Final transformation Is new transformation an improvement?

Intensity-based registration Registration-based on geometric features is independent of the modalities from which the features have been derived Registration-based on voxel similarity measures features we must make a distinction between monomodality registration and multimodality registration

Monomodality image registration Sums of Squared Differences (SSD) Assumes an identity relationship between image intensities in both images Optimal measure if the difference between both images is Gaussian noise Sensitive to outliers

Monomodality image registration Robust statistics can be used to reduce the influence of outliers on the registration Sum of Absolute Differences (SAD) Assumes an identity relationship between image intensities Less sensitive to outliers

Monomodality image registration Correlation Assumes a linear relationship between image intensities Sensitive to large intensity values

Monomodality image registration Normalized Cross Correlation (CC) Assumes a linear relationship between image intensities

Monomodality image registration Ratio of Image Uniformity (RIU) Normalized standard deviation

Registration Basis : Image Intensity Monomodality registration Image intensities are related by simple function Identity : SSD, SAD Linear : CC, RIU Multimodality registration Image intensities are related by some unknown function or statistical relationship Relationship between intensities is not known a priori Relationship between intensities can be viewed by inspecting a 2D histogram or co-occurrence matrix

Multimodality image registration Partitioned image uniformity (PIU) Used for MR-PET registration PIU : Measure the sum of the normalized standard deviation of voxel values in image B for each intensity a in image A

Images as Probability Distribution Images can be viewed as probability distributions p(a) Marginal probability p(a) of a pixel having intensity a Joint probability p(a,b) of a pixel having intensity a in one image and intensity b in another image Probability distribution of an image can be estimated using Parzen windowing Histograms Histograms require “binning” Usually use 32 to 256 bins per image

Images as Probability Distribution

Intensity-based on IT Entropy Describes the amount of information in image A The information content of an image is maximal if all intensities have equal probability The information content of an image is minimal if one intensity a has a probability of one

Intensity-based on IT Joint Entropy Describes the amount of information in the combined images A and B If A and B are totally unrelated, the joint entropy will be the sum of the entropies of A and B If A and B are related, the joint entropy will be similar Registration can be achieved by minimizing the joint entropy between both images

Intensity-based on IT Joint Entropy is highly sensitive to the overlap of the two images Mutual information Describes how well one image can be explained by another images Expressed in terms of marginal and joint probability distributions

Intensity-based on IT Mutual information is still sensitive to the overlap of the two images Normalized mutual information can be shown to be independent of the amount of overlap between images Registration can be achieved by maximizing (normalized) Mutual Information between both images

Registration using Similarity Measures Some similarity measures assume a functional relationship between intensities Identity : SSD, SAD Linear : CC, RIU Nonlinear : PIU, CR Other similarity measures only assume a statistical relationship Joint entropy (Normalized) Mutual Information All similarity measures can be calculated from a 2D histogram of the images