Week 1 - Image Processing Flashcards

1
Q

What are the four ways we can represent an image

A

Image Function
Landscape
Array of pixels
Image histogram

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

What is a grayscale image function

A

I : R^2 - > R
(x,y) -> I(x,y)
Gives the Intensity at position I(x,y)

A digital image is a discrete (sampled) version of this function

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

What is an image landscape

A

Imagine throwing a piece of cloth over a scene
creates a smooth and continuous landscape

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

What is an image histogram

A

Count the amount of pixels at each grey level

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

What is Spatial Resolution

A

The number of pixels that determines the resolution
(want more detail -> need more pixels)
eg Pixels per inch
-Allows for smaller scale structured images (to be seen in detail)
-constantly increases in digital cameras

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

What is grey level resolution

A

Number of different shades of grey that can be represented in an image

Higher resolution - > captures fine changes in brightness

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

What is important about having an array of pixels representation

A

We get the spatial relationship

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

What is Image arithmetic

A

Considering images as functions
g(x,y) = f(x,y) + 20
brightens by 20

g(x,y) = f(-x,y)
image is inverted along the y axis

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

What is image addition and what does it do visually

A

Takes the average over images in a sequence
(adding the two corresponding pixels)
Reduces noise

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

What is image subtraction and what does it do visually

A

Takes the difference of two images
Can capture a movement between two static background (the leftover is the moving object in the image)
Captures, shadows, reflections

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

What is Noise

A

A stochastic (random) process
All images contain noise

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

Do identical images have the same noise

A

No

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

How do we model noise

A

As small fluctuations
Noise is normally distributed
Some small fluctuations may actually be small changes in an image and not noise

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

What is the signal-to-noise ratio

A

SNR = max signal / σ

σ has subscript noise
Larger σ creates a smaller ratio and a more noisy image

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

How do we reduce noise by temporal averaging

A

We can average noise over N images

σ(subscript N) = σ / √N

Take N consecutive samples of the same image
the noise reduces

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

How do we reduce noise by spatial averaging

A

(When we do not have the choice of sampling an image n times)
Pass a 3x3 mask over an image, replacing the central pixel with the average of neighbours
“local averaging”

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

What is the issue with reducing noise by spatial averaging

A

Lose resolution - like blurring 5x5
particularly along edges

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

What is sub-sampling

A

Throw away every other row and columns in the image to create a 1/2 size image
Creates a very scruffy output

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

How can we improve sub-sampling

A

Local average first (which removes small scale detail and noise) then subsample
Means we are not keeping noise

20
Q

What are the 3 ways we can define noise using its neighbours

A

Noisy dark areas
-just a messy area of dark pixels

Just noise
-white pixels with one dark pixels (one noise pixel)

Vertical edge
-noise is aligned vertically

21
Q

What is neighbourhood processing and the 2 main methods

A

Modifying the pixel values of an image based on the values of neighboring pixels in a window

1) Rank filtering
2) Convolution

22
Q

What is Rank filtering

A

Takes values in the filter window and orders them darkest to lightest
There are different ways to rank: minimum (erosion), maximum (dilation), median filtering
Replace the middle pixel with whichever chosen method (minimum/median/maximum)
Move to the next window and repeat

23
Q

What is the effect of median filtering

A

Removes both dark and light noise spots
It is not the same as taking the mean
Mean -> creates shades of grey
Median - > produces only either white or black, keeps sharp edges
Works very well for salt and pepper noise

24
Q

What is Convolution

A

Very often used in pre-processing
Want to maintain the spatial patterns
Uses a weighted filter window

Eg 1 2 1

applied to input image: 0.5 1 1

only changing the middle value to the average of all
The middle value = 0.9

NOTE divide by 4 (total of filter weight) not by pixel number

25
Q

What is a kernel

A

filter/mask/convolution mask/ window

26
Q

What is asterisk notation for convolution

A

I~ = g * I
or
I~ = I * g

g = kernel weights
I = input image
I~ = output image

27
Q

Why does convolution create a cropped output image

A

We cannot begin in the corner pixel as it does not have a full set of 3x3 neighbors

28
Q

What are 3 padding methods

A

Zero: set all pixels outside image to 0

constant (border colour): set all pixels outside source image to specific value

mirror: reflect pixels across the image edge

29
Q

What is linear filtering

A

output is a linear combination of the input pixel values within a local neighborhood

30
Q

What is a smoothing kernel

A

9x9 mask filled with 1s
(constant mask)
___|-|___

31
Q

What is a gaussian kernel

A

Smoothing using a normal distribution
Any kernel representing a single bump distribution will blur the image
1 2 1
2 4 2
1 2 1

32
Q

How does changing sigma affect the gaussian filter

A

small σ = sharper, more weight to central pixels, less blur

large σ = weight spread, more blurred

33
Q

What is segmentation

A

The division into background pixels and object pixels
grayscale image -> binary label image
Only applicable in simple, high contrasting images

34
Q

What is thresholding

A

b(x,y) = (g(x,y) < T)
If we want the dark pixels (objects of interest)
b(x,y) is a binary image
We can use two thresholds if we want two different gray levels

35
Q

What is a bimodal image histogram

A

A histogram that shows two distinct levels
background/foreground

36
Q

What is the intermodal minimum

A

Where we place the threshold
marks in between background and foreground pixel values

37
Q

Histogram as a derivative of area

A

H(D) = dA(D) /dD

where D = grey level
Because the area under the histogram curve represents the total intensity

38
Q

What is Adaptive Thresholding

A

When we encounter shaded backgrounds and a single threshold wont work
Smooths first to get estimate of varying background
Subtract smoothed image from the original
Then threshold

39
Q

What is over/under segmentation

A

Thresholding too high(over) or low(under) causing a poor quality output image

40
Q

How do we carry out automated thresholding selection

A

There are many algorithms that do this

41
Q

What does having longer words at each pixel allow

A

Each pixel can display a greater range of grey values
(bits per pixel)

42
Q

what is a word

A

basic unit of data that can process a single operation
size of word = __bits
commonly 1 byte = 8 bits

43
Q

What do lighter pixels in grayscale images represent

A

objects (why dilation = choosing maximum Intensity pixel)

44
Q

Is convolution linear filtering

A

Yes

45
Q

Is median filtering linear filtering

A

No