Linear filter Flashcards

1
Q

What is a linear filter

A

Generally, when dealing with linear filters, we have neighbourhood and some weights on the neighbourhood and we try to apply a weight som

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

explain the spacial frequencies

A

when speaking about frequencies, we usually notice high frequencies for edges and low frequencies for continuous parts, spatial frequencies

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

what is Fourier Transform

A

it is a way to analyze a signal in the form of a series of different sin and cosine functions

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

explain the inverse Fourier transform

A

the inverse Fourier Transform allows, allows returning from the Fourier space to the signal space

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

what is |F(u)|^2

A

reflects the power spectrum in the Fourier domain

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

what is 2D Fourrier transform

A

the same Fourrier transform domain but extended to dimension generally for images we are interested by this

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

what is the relation between the Fourier transform

A

the idea is that we can transform an image into a Fourier function where the size of Fourier domain correspond to the size of the image

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

why do have the same size between the Fourier Transform and image

A

since we can not have a frequency that is higher than the difference of the two pixels

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

what is the discrete Fourrier Tranform

A

Since images are actually discrete, we are more interested in representing the images discrete Fourier ing transform

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

what is the fast fourrier transoform

A

it is simply an improved version of the Fourier Transform that runs in N log2 instead of N2

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

Why using the Fourier Transform in the linear filter s

A

Since the convolution in the signal, space is equivalent to a term by term product in the frequency domain
which corresponds to the linear filter here.
Meaning we have the Fourier transform of the image and of the structuring element, then we apply there multiplication

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

what is a low pass filter

A

in low pass filter, we simply keep the low frequencies generally used to blurr the image

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

how can a sharp structuring element impacts the image

A

we ll notice some ripples on the image that reflect the edge of the images; a solution that is to have a less sharp transition

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

How does the Fourier transform contain all the image information

A

the whole Fourier transform information is actually contained in the phase, so if we flip the image, we notice a difference in the phase

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

what is the high pass filter

A

we only keep the high frequencies and enhance the edges

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

how would it be possible to have a bandpass filter a filter only have frequencies on a certain domain

A

we can simply omit both low frequencies and high frequencies

17
Q

what is the bandpass filter utilities

A

it can be user to detect some edges by detecting some noise

18
Q

what is correlation

A

correlation can be used to detect some patterns in the image, for a given image containing a piece of the image, we will notice that the whom image is blurred except that small piece that correspond to the structuring element

19
Q

how does the size of the structuring element affect the resulted image

A

the bigger is the structuring element the more we get back to the original image