Lecture 5 - Edges Flashcards

(29 cards)

1
Q

What is the goal of edge detection?

A

Identify sudden changes (discontinuities) in an image
– Intuitively, most semantic and shape information from the image can be encoded in the edges

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

What are the factors to determine edges (what causes a physical edge)?

A

Surface Normal Discontinuity
Depth Discontinuity
Surface Colour Discontinuity
Illumination Discontinuity

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

What is an edge?

A

An edge is defined as a location in an image where there is a sudden change in intensity or pixel value or a sharp change in brightness

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

How do we detect an edge?

A

Edge detection is achieved by detecting:
* Local maxima/minima in the first derivative (gradient).
* Zero-crossings in the second derivative (e.g., Laplacian of Gaussian).
Differentiation approximates rate of change, implemented with derivative filters.

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

What is the basic idea of edge detection?

A

Look for a neighborhood with strong signs of change.

Problems:
– Neighborhood size
– How to detect change
Differential operators:
– Attempt to approximate the gradient at a pixel via masks.
– Threshold the gradient to select the edge pixels.

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

What are the characteristics of an edge?

A

Edge models/types:
– Step
– Ramp
– Roof

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

What are the main steps in edge detection?

A

1) Smoothing: suppress as much noise as possible, without destroying true edges.
2) Enhancement: apply differentiation to enhance the quality of edges (i.e., sharpening)
3) Thresholding: determine which edge pixels should be discarded as noise and which should be retained (i.e., threshold edge magnitude).
4) Localization: determine the exact edge location.

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

How are derivatives used in edge detection?

A

An image is a 2D function, so operators describing edges are expressed using partial derivatives.
Points which lie on an edge can be detected by either:
– detecting local maxima or minima of the first derivative
– detecting the zero-crossing of the second derivative
REFER TO SLIDES FOR EXAMPLES

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

What is Image Gradient?

A

A combination of the partial functions of x and y to create one image
REFER TO SLIDES

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

How do you differentiate a digital image?

A

– Option 1: reconstruct a continuous image, f, then compute the derivative
– Option 2: take discrete derivative (finite difference)
REFER TO SLIDES FOR FORMULA

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

What are the 3 types of discrete derivatives in 1D?

A

Backward: H = [0, 1, -1]
Forward: H = [-1, 1, 0]
Central: H = [1/2, 0 , -1/2]
Where derivative kernels sum to 0
REFER TO SLIDES FOR FORMULAS AND EXAMPLE (31 - 38)

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

2D Derivative Filters

A

REFER TO SLIDES

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

What is the effect of noise?

A

Finite difference filters respond strongly to noise
– Image noise results in pixels that look very different from their neighbors
– Generally, the larger the noise the stronger the response

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

What can be done to reduce noise?

A

– Smoothing the image should help, by forcing pixels different to their neighbors to look more like neighbors
In other words smooth first
REFER TO SLIDES (includes convolution and gaussian)

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

What is Gradient of Gaussian (GoG)?

A
  • GoG: Gradient of Gaussian
    ○ Smooth the image, then apply derivative.
    ○ Equivalent to convolving image with derivative of Gaussian.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is Laplacian of Gaussian (LoG)

A

Highlights regions of rapid intensity change in an image, which are often associated with edges.
○ Second derivative filter.
○ Detects zero-crossings after smoothing.

17
Q

What is the tradeoff between smoothening imags at different scales (Trade-off in 1D: localization vs noise immunity)?

A
  • Accurate localization: requires less smoothing → sensitive to noise.
  • Noise immunity: requires more smoothing → blurs edges.
    There is a trade-off: choose σ depending on application needs.
18
Q

What are the criteria for an optimal edge detector?

A
  1. Good detection: Low false positives/negatives.
  2. Good localization: Detected edge is close to true edge.
  3. Single response: One response per edge.
19
Q

What is Sobel operator?

A

Uses two 3×3 kernels which are convolved with the original image to calculate approximations of the derivatives
One for horizontal changes, and one for vertical
- It involves smoothing + differentiation
REFER TO SLIDES FOR FORMULAS AND EXAMPLES

20
Q

What are the masks of the sobel operator?

A

Gx
[-1 0 1]
[-2 0 2]
[-1 -2 1]

Gy
[1 2 1]
[0 0 0]
[-1 -2 -1]

21
Q

What are some problems with the Sobel filter (operator)?

A

Poor Localization (Trigger response in multiple adjacent pixels)
Thresholding value favors certain directions over others
– Can miss oblique edges more than horizontal or vertical edges
– False negatives

22
Q

What is the Canny edge detector?

A

The Canny edge detector is an edge detection operator that uses a multistage algorithm to detect a wide range of edges in images.

23
Q

What is the process of the Canny edge detector?

A
  1. Filter image with x, y derivatives of Gaussian
  2. Find magnitude and orientation of gradient
  3. Non-maximum suppression:
    - Thin multi-pixel wide “ridges” down to single pixel width
  4. Thresholding and linking (hysteresis):
    - Define two thresholds: low and high
    - Use the high threshold to start edge curves and the low threshold to continue them
    REFER TO SLIDES FOR STEP THROUGH
24
Q

What is the effect of sigma in the Canny edge detector?

A
  • Large σ: more smoothing → captures large-scale edges, misses fine details.
  • Small σ: less smoothing → sensitive to fine details but may detect noise.
25
What scale should you choose for sigma in the Canny edge detector?
Depends on what you are looking for
26
What is non-maximum suppression (step 3 of Canny edge detection)?
* Used to thin out wide edges to a single pixel. * Retains local maxima in gradient direction. * Suppresses all other pixels. * Improves localization and reduces false edge thickness.
27
How does Non-maximum suppression work for each orientation?
REFER TO SLIDE 72
28
How do you define Hysteresis thresholds (Step 4 in Canny edge detection)
Define two thresholds: Low and High – If less than Low, not an edge – If greater than High, strong edge – If between Low and High, weak edge * Consider its neighbors iteratively then declare it as “edge pixel” if it is connected to a ‘strong edge pixel’ directly or via pixels between Low and High REFER TO SLIDES FOR EXAMPLES
29
What are the problems with gradient-based edge detectors?
* Sensitive to noise (requires smoothing). * Poor localization in noisy images. * Multiple responses near edges. * May miss diagonal or curved edges (bias toward vertical/horizontal). * Thresholding can favour certain directions or intensities.