Chapter 4 Filtering (CP467) Flashcards

0.0(0)
studied byStudied by 2 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/37

flashcard set

Earn XP

Description and Tags

Image Processing and Pattern Recognition Chapter 4 Key Terms

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

38 Terms

1
New cards

Filter

The process of accepting or rejecting certain frequency components

2
New cards

Lowpass Filter

A filter that passes low frequencies

3
New cards

Other terms that “filter” can be called as:

masks, kernels, templates and windows

4
New cards

Spatial Filters

Can alter pixel values based on light intensity variations in a neighborhood. They are more versatile than frequency filters.

5
New cards

What does a spatial filter consist of

-a neighborhood
-a predefined operation

6
New cards

How does filtering work

filtering creates a new pixel:
it replaces the value of a pixel based on the values of neighboring pixels and a defined filter operation (filter operation The process involves applying a mathematical operation like summing, averaging or applying a specific kernel to the pixel values in the neighborhood to generate a new pixel value to replace the center of the pixel neighborhood.

7
New cards

the size of a filter(kernel) is defined and expressed as?

The size is expressed as; m = 2a +1 and n = 2b+1 where a and b are non-negative integers that determine how far the filter extends from its center. The size of a filter (kernel) is defined and expressed as m x n, where m and n are odd integers, such as 3 × 3 or 5 × 5.

8
New cards

correlation

Process of moving a filter mask over the image and computing the sum of the product of corresponding values (image pixel values and filter values) at each position.
Result: The sum becomes the value of the pixel in the output image

9
New cards

convolution

Similar to correlation, but the filter is first rotated by 180 degrees (Flipped both horizontally and vertically) before the computation.
Result is calculated using the same process as correlation (multiplying and summing), resulting in a new pixel value for the output image.

10
New cards
<p>how does an original filter look like after 180 degree rotation for convolution<br></p>

how does an original filter look like after 180 degree rotation for convolution

After 180 degree rotation:

<p>After 180 degree rotation:</p>
11
New cards

the terms convolution filter or convolution mask may denote:

whether we use a correlation or convolution

12
New cards

smoothing filters

Used for blurring an image

13
New cards

blurring

used in preprocessing steps such as:

  • removal of small details from an image prior to (large) object extraction

  • bridging of small gaps in lines or curves

  • used for noise reduction

14
New cards

output (response) of a smoothing, linear spatial filter

the avg of the pixels contained in the neighborhood (i.e. 3 × 3) . the result replaces the center pixel of the neighborhood, effectively “smoothing” the image.

15
New cards

Averaging filter

computes the mean (avg) of the pixel values in the neighborhood

16
New cards

common uses for smoothing

  • noise reduction (remove unwanted variations)

  • simplifying images before further processing, like edge detection or segmentation

17
New cards

side effect of averaging filtering

they blur edges and fine details (you lose some detail in exchange for noise reduction)

18
New cards

irrelevant detail

refers to pixel regions much smaller than the filter size, hence why we smooth them out.

19
New cards

what are order-statistic filters?

they are nonlinear spatial filters that:

  • order the pixel values in a neighborhood based on rank (i.e. from smallest to largest)

  • replace center pixel value with specific value from ordered list (based on chosen filter)

20
New cards

types of order-statistic filters

median filter (most commonly used)
max filter
min filter

21
New cards

median filter

replaces the center pixel w the median value of the sorted neighborhood

<p>replaces the center pixel w the <strong>median value</strong> of the sorted neighborhood</p>
22
New cards

max filter

replaces the center pixel w the max value

23
New cards

min filter

replaces the center pixel w the min value

24
New cards

median filters are particularly effective in the presence of….

impulse noise, aka. salt-and-pepper noise

25
New cards

salt and pepper noise

random pixels in the image appear as either black(salt) or white(pepper).
median filters are effective at removing this noise bc extreme values are discarded during sorting

26
New cards
<p>explain whats happening in the images (from left to right a,b,c)</p>

explain whats happening in the images (from left to right a,b,c)

(a) Original image w salt and pepper noise
(b) Result of smoothing using a 3 × 3 averaging filter. Noise reduced but image still blurry
c) Result of 3 × 3 median filter. Noise effectively removed without any more blurring.

27
New cards

median filter vs averaging filter

preserves edges bc they do not average pixel values
eliminate noise more effectively, especially when the noise is impulsive (salt and pepper)

28
New cards

sharpening

highlight fine detail or to enhance detail in an image which may have been blurred

29
New cards

sharpening could be accomplished by

spatial differentiation

30
New cards

foundation

foundation of sharpening lies in detecting changes in pixel intensity (fine details, edges)
sharpening works by enhancing high-frequency components (edges) and making the transitions in intensity more pronounced

31
New cards

to undetstand sharpening: how does derivatives behave in flat segments (constant intensity)

derivative is zero

32
New cards

to understand sharpening: how does derivatives behave in discontinuities (steps or ramps)

  • sharp transitions(step changes): derivative is large

  • ramps(gradual changes) derivative has a constant non-zero value.

  • gray level ramps; derivative captures the rate of change along sloping regions

33
New cards

first order derivative

measures rate of change in intensity between two points and its used for detecting edges and sharp transitions in an image

<p>measures rate of change in intensity between two points and its used for detecting <strong>edges </strong>and sharp transitions in an image</p>
34
New cards

second order derivative

measures the rate of change of the first order derivative (i.e. how quickly the edges change)
used for emphasizing edges and finding zero crossings

<p>measures the rate of change of the first order derivative (i.e. how quickly the edges change)<br>used for <strong>emphasizing edges</strong> and finding zero crossings</p>
35
New cards

gradient (first order derivative for image sharpening)

represents the direction and rate of change in pixel intensity

<p>represents the direction and rate of change in pixel intensity<br></p>
36
New cards

magnitude of gradient (overall rate of change calculation)

knowt flashcard image
37
New cards

most used gradient masks

Prewitt and Sobel

<p>Prewitt and Sobel</p>
38
New cards

The Laplacian (second order derivative for image sharpening)

laplacian measures the second derivative of intensity changes in an image

<p>laplacian measures the<strong> second derivative</strong> of intensity changes in an image</p>