Image registration Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is image registration

A
  • ‘image matching’
  • images of same object taken at different times using different methods
  • necessary to compare two objects
  • determine unknown geometric transformation (rotated, translated, elastically deformed)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Why use image registration

A
  • analyse differences

- combine informations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

registration framework

A
  • transformation (mapping)
  • similarity measure
    optimization
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Registration in a closed loop:

A
1 init
2 estimate similarity 
3 check convergence
4 update transformation
5 warp template image -> 2
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

transformation

A

goal: bring template image with transformation into alignment with reference image

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

types of transformation

A
  • highly dependend on expected spatial changes
  • affine-linear
  • non-linar
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Affine linear

A
  • translation only
  • rigid transformation (retains size and angular relations; involves translation and rotation)
  • scaling (addition of isotropic scale to the rigid transformation)
  • affine (preserves lines and parallel lines; angular relations no longer conserved; used when little information about image distortion is known)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Non-linear (deformable) transformations

A
  • no matrix representation, can be very complex
  • compute image deformations from a fixed number of basis functions defined by the transformation parameters
  • m=3 cubic splines (expressed in basis set of polynomials: B-spline)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

B-spline transformations

A

+ easy to implement and low complexity
+ computationally efficient
- no strict physical meaning
- knot positions not necessarly information-rich positions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

common applications of non-linear registration

A
  • tissue motion
  • deformation compensation
  • longitudinal tissue changes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Registration Basis

A
  • extrinsic: (invasive vs. non-invasive)
  • intrinsic: uses information available iwithin the images to estimate the transformation (landmark based, surface to surface)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

intensity based similarity measures

A
  • calculation directly from voxel values
  • SSD (sum of squared differences)
  • NCC (normalized correlation measures)
  • joint entropy
  • NMI (normalized mutual information)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Sum of squared differences

A
  • subtract each tamplate image voxel from spacial corresponding ref image voxal
  • used in academic settings
  • unreliable for multi-model registration or registration of contrast varying images
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Normalized correlation coefficient

A
  • estimates the difference of two statistical distributions in terms of their standard deviations around the mean
  • computationally more expensive
  • can be used for multimodal registration
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Information theoretic measures

A
  • measures joint information content of reference and template images
  • measured by entropy
  • treat image intensities as random variables
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Joint histogram

A
  • joint entropy, calculated in overlapping points of the image
  • stuck in local optima
  • maximize mutual information (high marginal entropie, low joint entropy)
  • how well does one image explains the other?
17
Q

Optimization of registration

A
  • iterative numerical optimization method
  • maximize similarity, minimize error
  • problem: getting stuck in local minimum
18
Q

Optimization - Gradient Descent

A
  • analyze gradient of E
  • parameter change proportional to negated gradient
  • slow close to minimum
  • finds local minimum
19
Q

Optimization - Conjugate Gradient Method

A
  • parameter estimation considers estimates from previous steps
  • faster convergence than gradient descent
20
Q

Newton Method

A
  • requires finction that is twice differentiable
21
Q

Optimization without using derivative information

A
  • powell method: perform line search to find optimal parameters
  • Nelder-Mead Method: downhill simplex, heuristic search for nonlinear optimization
22
Q

Deformable Registration

A
  • often non rigid registration (breathing motion)
  • parametric approachers: describe transformation with weighted basis function
  • optimization: parameter set and similarity measure for optimization
23
Q

Optical flow

A
  • assumption: given small temporal difference, a moving voxel does not change intensity
  • aperture problem: only motion perpendicular to visible structure can be measured
24
Q

Diffeomorphism

A
  • diffeomorphic transformations: invertable, no foldings, preserve topology, essential vor computational anatomy
25
Q

Computational Anatomy

A
  • human anatomy is modeled as a deformable template
  • enable invertable mappings between exemplars which are generated vai medical imaging
  • compare differences between subjects
  • generate probability laws for anatomical variation