Week 2 - Image Features: Edges Flashcards

1
Q

Why are Edges important

A

They are key for image detection
occur at boundaries, shadows, changes in texture or colour erc
Human brain quickly recognises them

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

What are edges

A

Boundaries between physically distinct regions

Discontinuities in intensity values
A place of rapid change in the image intensity function
‘Extrema of the derivative’

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

What is edge location in terms of differentiation

A

Equivalent to differentiating the intensity function I(x)
dI / dx

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

What are 2 main techniques for edge detection

A

Smoothing convolution
Differentiation

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

What is the difference between using weighted and non weighted kernel averaging

A

eg 111 and 121
weighted averaging creates better smoothing

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

What is a simple kernel for finding the 1st and 2nd derivative

A

In this context, differentiation is a type of convolution
(-1, 0 ,1)
(1, -2, 1)

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

What are three discontinuities that cause edges

A

depth
illumination
surface colour

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

What is the effect if noise of edge detection

A

It hides the edges as it creates many pixel value changes
Differentiating noise creates a complicated image

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

How do we remove noise for edge detection

A

Smooth the image first
Then look for the peaks in d/dx (I * f)

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

What is the associative property of convolution

A

the order in which you convolve multiple functions does not change the final result
(f∗g)∗h=f∗(g∗h)

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

What operations can be performed just via choice of kernel

A

first derivative
second derivative
smoothing
local average
weighted avergae

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

What is the Prewitt Kernel

A

It is two kernels: for detecting vertical or horizontal edges

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

What is the prewitt kernel in x direction

A

-1 0 1
-1 0 1
-1 0 1
Detects vertical edges

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

What is the prewitt kernel in y direction

A

-1-1-1
000
111
Detects horizontal edges

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

What is the sobel kernel

A

Also made up of two kernels
The smoothing is weighted towards the centre
(weighted average along the edge)

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

What is the sobel in x-direction

A

-1 0 1
-2 0 2
-1 0 1
Detecting vertical edges

17
Q

What is the sobel in y-direction

A

-1-2-1
0 0 0
1 2 1
Detects horizontal edges

18
Q

What sort of image does the sobel and prewitt operators result in

A

A transformed grey-level image
Derivate of the image in the _direction

19
Q

How do you calculate Edge magnitude

A

|I’| = √ I’x^2 + I’y^2

20
Q

How do you calculate edge orientation

A

Φ = tan-1 I’y / I’x

21
Q

What are gradient images

A

Grayscale images showing gradient magnitude at each pixel

22
Q

What is the gradient of the image

A

Measure of change in image function in the x and y direction
gradient = magnitude
||∇I||= √(dI/dx)^2 + (dI/dy)^2

Gradient direction = tan-1(gradient y/ gradient x)

23
Q

What are decomposable kernels

A

eg 3x3 into 3x1 and 1x3
It is cheaper
gets the same result
operations are faster

Eg 21x21 -> 1x21 and 21x1 -> 42 multiplications
instead of 441 at each image point

2n rather than n^2

24
Q

Why is scale important to edge detection

A

Edges can vary in size, thickness and be more prominent depending on the scale
Need to incorporate scale into edge detection
Gaussian filter is often to introduce scale information

detection at larger scales is more reliable
Location of edges at coarse scale can direct the search for finer-scale edges

25
Q

What is the 1D Gaussian

A

Represents the distribution of values along one dimension
Gaussian weighting schemes are controlled by σ

26
Q

What is Anti-aliasing

A

High-frequency details or fine features in an image exceed the resolution (appear blurred)
caused due to undersampling and inadequate representation

27
Q

What is the canny operator

A

The first derivative of the Gaussian
- differentiate the smoothing kernel
σ determines the scale (x axis on graph of derivative)
smaller σ, sharper edges, less smoothing

28
Q

What does the canny operator mean we no longer have to do

A
  • suppress non maxima of derivative (thinning)
  • track using hysteresis thresholds
29
Q

What is suppression of non maxima

A

aims to reduce the width of detected edges by retaining only the local maxima (or peaks) in the gradient magnitude image along the direction of the gradient (only retains the maxima in the region)

30
Q

How do you find the peak of thick edges

A

The second derivative gives a precise localisation, where the crossing of x axis occurs

31
Q

What is the 2D Laplacian Kernel

A

Second derivative filter
After convolution, edge positions will be at zero crossing
The sum of all values should be zero - no scaling
Negative centre, positive surround or vice versa
Isotropic response
eg
1 -2 1
-2-4-2
1 -2 1
or
1 1 1
1-81
1 1 1

32
Q

What is dx notation equal to

A

d/dx

33
Q

What does an isotropic filter mean

A

Gives the same response to edges in any direction
one filter
no edge direction (can be bad to lose this info)
indirect edge magnitude

34
Q

What is the Laplacian of Gaussian

A

The second derivative of the 2D Gaussian
Gives a “Mexican hat” (can be up or down)
Also called Marr-Hildretch edge detector

Instead of just Laplacian, we still have orientation and smoothing
does not create thick edges
σ again determines the scale (broader or narrower kernel)

35
Q

How does size of σ affect gaussian distribution

A

Larger σ -> broader distribution
Smaller σ -> narrower distribution

36
Q

How do gaussian filters introduce scale information

A

Blur image with gaussian with different levels of σ
desired amount of smoothing can be used based off these levels