Computer Vision: Color Spaces, Image Kernels, and Filtering

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/18

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering HSV and RGB color spaces, image convolution kernels, padding, stride, and blurring techniques for computer vision workflows.

19 Terms

1
New cards

HSV Color Space

A color model that separates color type (Hue) from intensity (Saturation and Value), making it more intuitive and effective than RGB for computer vision tasks like object detection.

2
New cards

Hue

The color type represented as an angle ranging from 00 to 360360 on a color wheel.

3
New cards

Saturation

The intensity of a color, measured on a scale from 00 (gray) to 11 (pure color).

4
New cards

Value

The brightness level of a color, ranging from 00 (black) to 11 (full brightness).

5
New cards

RGB Normalization

The process of scaling RGB values to the range [0,1][0, 1] so that HSV conversion formulas can correctly calculate hue, saturation, and brightness.

6
New cards

Delta

The difference between the maximum and minimum normalized RGB values, used to select the appropriate equation for calculating Hue.

7
New cards

Grayscale Input (in HSV Conversion)

An input where Hue and Saturation evaluate to 00, leaving only the Value channel with a non-zero magnitude.

8
New cards

Image Kernel

An array that slides across an image with specific values determining how much each surrounding pixel in a window contributes to the new center pixel.

9
New cards

Normalized Mean Kernel

A square kernel array where every entry is set to 11 divided by the total number of entries (such as each entry being 19\frac{1}{9} for a 3×33 \times 3 kernel), ensuring all values sum to 11.

10
New cards

Kernel Filtering

An operation where the kernel extracts nearby pixel values in a local window, multiplies each by the corresponding kernel weight, sums the products, and reassigns the result to the center pixel.

11
New cards

Sliding-Window Operation

A method of traversing an image by moving a kernel array across pixel locations according to a specified stride and performing neighborhood calculations at each stop.

12
New cards

Zero-Padding

Adding zero-valued pixels around the borders of an image, which allows edge pixels to be centered within the kernel window without shrinking image dimensions.

13
New cards

Zero-Padding Formula

The calculation used to determine the required padding border size: kernel size−12\frac{\text{kernel size} - 1}{2}.

14
New cards

Stride

The number of pixels the sliding window shifts at each step; a stride equal to 11 means the window moves by 11 pixel at a time.

15
New cards

Odd Kernel Size

A geometric constraint requiring kernel dimensions to be odd numbers so that there is an exact center pixel with an equal number of surrounding pixels on each side.

16
New cards

Gaussian Blur

A filtering technique that assigns larger weights to pixels near the center of the kernel and smaller weights to pixels farther away, smoothing noise while preserving large structures.

17
New cards

Mean Blur

A blurring technique that weights all pixels in the window equally, often producing blocky artifacts and removing excessive structural detail.

18
New cards

Pre-Extraction Blurring

The practice of applying blur before edge detection or feature extraction to suppress small pixel-level noise variations, making larger shapes easier to analyze.

19
New cards

Sigma (σ\sigma)

A Gaussian kernel parameter that controls the spread of the blur; a smaller value produces a tighter blur, whereas a larger value yields a wider blur.