Image Processing 3 + 4 Flashcards

1
Q

Hamiltonian

A

Perpendicular to the gradient vector.

The lines are isophotes , lines of constant gray value.

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

Laplacian

A

Negative if the gradient vectors are converging
Zero if the gradient vectors are parallel
Positive if the gradient vectors are diverging

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

Edge detection

A
  • Compute gradient magnitude image (Sobel Kernel)
  • Threshold to only show edges with a certain edgeness
  • Gaussian filter (reduces effect of noise)
  • Laplacian
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Discrete approximation of kernel issues

A
  • Truncation error (far, low ends are discarded. solution: wider kernel)
  • Discretization error (over and underestimation. solution: denser sampling)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Median Filtering

A
  • Place all the grey values of a kernel around a pixel in a row, and remap it to the value in the middle of the row
  • Removes noise, doesn’t shift edgess
  • Min/Max filters work similarly
  • These are not linear filters, but rank filters
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Nearest neighbour interpolation

A

Value of nearest pixel

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

Linear interpolation

A

Added values of weighted value of w = 1 - distance to pixel (block kernel)

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

2D Linear interpolation

A

Added values of pixel times opposing area (pyramid kernel)

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

Anisotropic diffusion

A

Smoothing, but not equally in all directions. Is based on the heat equation.

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

Grey value opening

A

ball from below, idempotent

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

Grey value closing

A

ball from above, idempotent

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

Dilation/Erosion

A

Uses Minkowski addition/substraction, dual operators (one on f and other on f-1 makes the results also each other’s inverse)

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

Opening

A

Erosion then Dilation (details get lost, size remains) dual operators and idempotent

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

Closing

A

Dilation then Erosion (structures can fuse) dual operators and idempotent

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

Geodesic dilation

A

Apply dilation in iterations, but limiting growth with a control image. Eventually no more changes.

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

Residue

A

Difference between the results of morphological operations (is a morphological gradient)

17
Q

White top hat filter

A

Difference between f and opening of f (used to remove background gradient when followed by tresholding)

18
Q

Ultimate Residue

A

Erode, Reconstruct, add Residue. Iterations give the ultimate residue

19
Q

Skeleton

A

Add ballz in image. Biggest ballz is on skeleton line.

20
Q

Hit-or-Miss transform

A

S1 foreground pixels have to fit, S2 foreground pixels have to be absent.

21
Q

morphological gradient

A

Difference between the erosion and dilation of an image (looks like a fucked binary laplacian with white in the middle)

22
Q

Gibs ringing

A

Artifact van een rond, binair masker toepassen op een FT. Een geblurde versie van het masker met minder harde randen verlagen dit effect.