Segmentation and Superpixels Flashcards

1
Q

What three things make for optimal edge detection?

A
  • Good detection (marks all and only the edges)
  • Good localisation (points mark should be as close to the edge as possible)
  • Minimal response (each edge should only be reported once)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is non-maximal supression?

A

Checks if pixel is a local maximum along gradient direction to check is line is actually likely to be part of edge (no weak lines)

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

What kind of thresholding did Canny use?

A

Thresholding with Hysterisis

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

What kind of equation did Canny use to create his edge detection method?

A

Optimisation of the 3 factors (localisation, detection, response)

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

How does thresholding with hysteresis work?

A

High values over high thresholding are considered part of the edge, and low values below the threshold are only considered if they connect to the main edge

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

What method did Canny show was the best way to detect step edges in noise?

A

1st derivative of a Gaussian

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

What is segmentation?

A

Dividing an image into meaningful regions for analysis

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

How does hysteresis prevent noise in thresholding?

A

By using two thresholds

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

What are some properties we can segment an image by?

A
  • Intensity or colour
  • Textures or patterns
  • Spectral profiles that provide multidimensional image data
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What are the three main approaches to segmentation?

A

Clustering, Region-based, edge based

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

What is clustering as a segmentation approach?

A

Finding similar pixels with no regard for where they are

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

What is region-based as a segmentation approach?

A

Finding physically connected pixels (e.g. region growing, split and merge)

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

What is edge-based as a segmentation approach?

A

Emphasis on the boundaries between regions e.g. watersheds

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

What is region growing used for?

A

Region based segmentation

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

How does region growing work?

A

Start with a seed pixel / group of pixels then expand by adding similar pixels using statistics calculated for the region

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

What’s an example of a statistic used for region growing?

A

Grey average calculated then if nearby pixels have similar averages they are added to the region

17
Q

Where should the seed be placed for region growing?

A

In a uniform region

18
Q

What is split & merge used for?

A

Region based segmentation?

19
Q

How does split and merge work for region based segmentation?

A

Splitting divides two inconsistent regions and merging combines adjacent regions that are consistent

20
Q

How does split and merge start?

A

The whole image is taken to be one region then a measure of internal similarity is decided on and computed

21
Q

What is done in split and merge from the point of the whole image being a region?

A

If there is two much variety (based on the computed measure) the image is divided (normally into quarters) and this is repeated until each region is similar enough or a minimal size is reached

22
Q

How does edge based segmentation work?

A

Finds edges and then defines a region as an area bounded by that edge

23
Q

What are catchment basins and watersheds?

A

On a gradient image, catchment basins are low areas (regions of the image) and watersheds are the lines dividing them

24
Q

Do we have to use intensity gradient for finding watersheds?

A

No, could use hue etc

25
Q

What are watersheds used for?

A

Edge based segmentation

26
Q

What is a good way to visualise the gradient of an image?

A

As a 3D terrain

27
Q

How does the watershed algorithm work after sorting pixels low to high?

A

Each pixel is given is:
- given a new label if its neighbours are unlabelled
- if its neighbours have a single label it gets that
- if it has neighbours with two or more neighbours it is a watershed

28
Q

What are two drawbacks of the basic watershed process?

A
  • it can give thick watersheds rather than fine lines
  • it is sensitive to noise so can generate lots of small regions
29
Q

Why might bin sort be needed for watershed?

A

To sort the pixels in numerical order

30
Q

How does bin sort work?

A

Makes a bin for each possible value and places values in their relevant bins

31
Q

What might be done to gradient before watershed?

A

Quantisation, reducing range of gradient to reduce amount of segments and effect of noise

32
Q

What can be done to stop loads of mini regions being created in watershed process?

A

Having a threshold value where no more watersheds are created