Neighbourhood Processing - Lecture 3 - Week 1 Flashcards

1
Q

What is rank filtering?

A

Take values under the filter window (kernel) and order them, then output based on some value, e.g. in median filtering (Maybe also rank filtering) the median value is used

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

Why is the mean not as effective as the median in rank filtering?

A

Noise is lighter, but larger & edges are blurred

median removes noise and blurs edges less

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

Why is convolution good?

A

Looks at spatial pattern of pixels, not just the value of the pixels

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

In convolution what is the final sum divided by when smoothing?

A

The sum of the values in the kernel

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

What padding methods exist for convolution?

A

Zero - set all pixels to zero

Constant (border colour) - set all pixels outside the source image to a specified border value

Mirror - reflect pixels across the image edge

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

What does a high frequency mean in an imge?

A

abrupt changes in pixel value

Removing them smooths the image

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

What are the parameters to gaussian blur?

A

Sigma (1/2 the size of the width of the distribution width)
K - the dimensions of the kernel (must be odd)

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