Chp.4 - Neighbourhood Operators Flashcards

1
Q

The two main categories and examples (2 each)

A

Linear: convolution operators, spatial averaging

Non-linear: median filtering, morphological operators

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

The physical meaning of the equation (linear neighbourhood operator)
g(m, n) = summation summation (m’, n’∈R) f(m’, n’)h(m − m’, n − n’)

A

Place the flipped mask at every possible location in the image and at the location in the image, compute an inner product between the mask and the local image region.
AKA linear, spatially invariant filtering.

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

General representation for local, linear operators is:

A

g(m, n) = summation summation (m’, n’∈R) f(m’, n’)h(m − m’, n − n’)
where h: convolution mask
R: local region for summation, determined by mask size

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

Describe the process for smoothing

A

1) generate values of

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

Edge enhancement is which type of filtering?

A

high pass filter

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

Reasons/types of blurring and how to solve them respectively

A

1) due to “defocus”, isotropic sharpening is required

2) cause by motion, anisotropic filtering is better

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

What are filter banks?

A

Sets of separable or non-separable filters (in the form of convolution masks) which are all applied to the same image in parallel.

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

Usage of KL transform

A

satellite images and ideal data compression but not practical

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

Applications of KL transform

A

satellite images and ideal data compression but not practical

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

Applications of Hadamard transform

A

texture synthesis and tracking algorithms of pathogens in MRI

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

compression theory

A

reducing the storage spaces by only taking the important transform coefficients
typically: cosine discrete transform, wavelet transform works too

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

edge enhancement theory

A

suppress noise will depend on the type of noise
noise: localised/distributed across discrete Fourier space
image structure: concentrated in the region of Fourier that corresponds to slowly varying frequency/component
take the image into transform space and then apply a filtering operation

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

CT scan working principle

A

1) Take 1D images across the patient
2) Apply FT to each of the image projection
3) Take each of the FT into a 2D Fourier space
(like different lines across a circular 2D Fourier space)
4) Apply 2D inverse DFT to reconstruct the image

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

How’s MRI different with CT scan in principle and why?

A

MRI required 2D and 3D Fourier space as MRI relies on frequency and phase coding.

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

Gaussian scale space defintion and why is it useful

A

A series of progressively smoothed images with Gaussian mask
It is useful for some type of tasks such as image registration as the possibility to be stuck at the local minima is reduced in a cruder image than a finer image

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

Gaussian scale space defintion and why is it useful

A

A series of progressively smoothed images with Gaussian mask
It is useful for some type of tasks such as image registration as the possibility to be stuck at the local minima is reduced in a cruder image than a finer image

17
Q

Give an example of a mask that approximate Gaussian

A

1/16(1 2 1; 2 4 2; 1 2 1)
1/16: normalising
the centre is more heavily weighted than the sides
and the further away from the centre, the less the weighting