Cross Correlation Flashcards

1
Q

What is the process of using a filter kernel on a selection of pixels?

A
  • Select a filter kernel
  • For each pixel in the image
  • Can the kernel be centred over the pixel
  • Calculate the sum of products and replace the current pixel with the new sum
  • Once all pixels are done normalise the new pixels
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What do filter kernels create as a side effect?

A

Edges, where filter could not be centred

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

What are some counters to the edge problem?

A
  • Reduce size of image
  • Put a single colour border or pad around the image beforehand
  • Use old pixel values
  • Use known neighbours colour
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the intermediate value equation?

A

I’ = ((I-min)*255) / (max-min)

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

What is normalisation?

A

The process of calculating the intermediate values

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

How does the filter kernel work for coloured images?

A

Calculate the sum of products using the kernel filter for each colour independently, then normalise with max and min overall value.

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

What is correlation?

A

A form of spatial linear filtering

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

How can we spot an edge on graphs?

A

Where that “rate of change”/gradient intensity is large

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

What are derivatives used for?

A

To find where the rate of change of intensity is highest

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

Where are edges found on a 2nd derivate graph?

A

When the function crosses from positive to negative.

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

What is edge detection using the Sobel operator?

A

Uses a x and y filter and then calculates the magnitude and direction of the gradient. If the gradient is greater than some grey value map it to 0-1.

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

How does median filtering work?

A

Works by replacing each pixel value in an image with the median of the pixel values in a given neighbourhood. Size of neighbourhood determined by kernel size

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

What is the advantage of median filtering?

A

It’s very effective at removing high/low intensity noise and random noise

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

What is the disadvantage of median filtering?

A

It can cause blurring and loss of fine detail if the kernel size is too large

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

How does Gaussian smoothing work?

A

Uses a Gaussian kernel on an image, which assigns more weight to nearby pixels than to distant pixels.

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

What is the advantage of Gaussian smoothing?

A

Effective in removing gaussian noise or random noise from an image. Smooths noise without blurring edges or detail

17
Q

What is the disadvantage of Gaussian smoothing?

A

It can blur the edges and detail if the kernel size is too large or noise is too high