Lecture 5: Image Registration Flashcards

1
Q

What is image registration and why is it useful?

A

Image registration is the process of transforming different sets of data into one coordinate system. Data may be multiple photographs, data from different sensors, times, depths, or viewpoints.

Spatially align two or more images to obtain a common geometric reference in 2D, 3D or 4D.

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

Explain the difference between mono- and multimodal registration.

A
  1. Monomodal registration: All images acquired with the same imaging technique
  2. Multimodal Registrations: Different imaging techniques
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Which criteria can be used to classify different registration algorithms?

A
  1. Dimensionality
  2. Modalities (Mono-/Multimodal)
  3. Subject/Object
  4. Transformation
  5. Extrinsic (external markers) or intrinsic (intensity based or anatomical landmarks) registration.
  6. Number of images (pairwise / groupwise)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Which transformations do you know and what are the respective
restrictions / degrees of freedom?

A
  1. Rigid: Include 3 Transformation and 3 rotation.
    6 DOF
  2. Global scale transformation: Include transformation, rotations and single scale parameter.
    7 DOF
  3. Affine Transformation: Include translation, rotations, scales, and/or skewing scale parameter
    - 9 DOF
    - 12 DOF includes both scale and skew parameters in the matrix
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Explain the general iterative scheme for image registration! Which steps have to be performed in one iteration?

A

Find transformation T that maximizes the similarity measure S between If and T(Im).

  1. Apply current transformation T to the moving image Im
  2. Compute similarity between images If and T(Im) using the full image content
  3. Optimize transformation parameters to maximize the similarity criterion (minimize the alignment error)
  4. Repeat steps 1-3 until convergence
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Why are SSD and SAD measures not suited for multimodal registration?

A

Due to the different intensities of the multimodal image

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

How could a multimodal approach be modified to be able to use SSD or SAD?

A

??

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

Explain the idea of using information theoretic similarity measures!

A

Compare histograms of two images. Where px(i) is the probability of a voxel in image X having the intensity value i

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

How is entropy defined and what is the general idea of entropy?

A

Entropy is a measure for the “degree of surprise”, the “degree of disorder”.

Computing the expectation of the information content H(x) yields the average amount of
information needed to specify the state of a random variable, the so called entropy.

Entropy is maximal (not necessarily 1) for uniform distributions and decreases, the more non-uniform (sharply peaked) the distribution gets.

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

Explain the concept of joint entropy and mutual information! Should those criteria be maximized or minimized for multimodal
registration?

A

Joint entropy: Minimized if images are aligned

Mutual information: Maximized upon alignment

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

Which algorithm can be used if point correspondences are available and how does it work?

A

Closed form for known correspondence.

  1. Determine the rotation and translation that minimize SSD between corresponding points xi and yi
  2. Compute the center of mass of each point set
  3. Center the point sets at the origin before computing the transform, by substracting the respective center of mass from every point
  4. Compute covariance matrix of the transformed points
  5. Use Singular Decomposition (SVD) to represent the covariance matrix as rotations and stretching matrices
  6. Removes the stretching to obtain the final rotation matrix
  7. To prevent mirroring as the optimal solution, the following adaptation can be used.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How could correspondences be established?

A
  1. Correspondence known:
    Umeyama method (least squared)
  2. Correspondence unknown:
    a. Iterative optimizie the transformation until an optimal alignment is established (Iterative Closest Points)
    b. In the presence of noise, use Random Sample Consensus (RANSAC) to discard false correspondence
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Explain the iterative closest point algorithm

A

Correspondence unknown.

  1. Apply current transformation teta_t to the moving point set and establish correspondences (using the spatial nearest neighbor)
  2. Estimate new transformation parameter teta_t+1 (Using the SVD method)
  3. Repeat steps 1 and 2 until convergence
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the general idea of elastic registration? Which conceptually different methods do you know and how do they (roughly) work?

A

Elastic registration provides localized stretching of images to correct local non-linear deformations

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

What is the general idea of spatial transformer networks?

A

To incoporate spatial transformation to a CNN.

Spatial transformer is differentiable module that applies a spatial transformation to a feature map and can be incorporate to the usual network architecture.

Spatial transformer networks are a generalization of differentiable attention to any spatial
transformation.

Spatial transformer networks allow a neural network to learn how to perform spatial
transformations on the input image in order to enhance the geometric invariance of the
model.

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

Which components form the spatial transformation layer and how is it embedded to a CNN?

A
  1. Localization network: learns the spatial transformation parameters that should be applied to the input (FCN and CNN with regression)
  2. Grid generator. Creates sampling grid using the predicted transformation to produce the transformed output
  3. Sampler: Produces interpolated output mao sampled from the input at the grid points (bi/trilinear, NN,…)
17
Q

How can spatial transformer networks be used for deformable image registration?

A
  1. Self-contained module that can be used in common CNN archtectures to gve rise to spatial transformer networks.
  2. Computationally efficient and potentially even speeding up processing due to focus on region of interest ad potentially downsampling.
  3. Transformation parameters contain information about the pose of the region or object of interest.
  4. Arbitrary parameterized transforms can be used as long as they are differentiable w.r.t. the parameters (rigid, affine, projective, thinplate spline,…)
18
Q

What is the benefit of an unsupervised learning

approach for registration?

A
  1. Performance gain from hours to minutes (CPU) or seconds (GPU).
  2. Can be combined with auxiliary segmentation information to further improve the accuracy
  3. Multi-resolution approach due to the subsampling in the encoding stage.