Image Processing and Computer Vision: Filtering and Analysis

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

1/24

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering image filtering techniques, kernels, pyramids, and frequency analysis based on the lecture notes.

Last updated 4:07 PM on 6/22/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

25 Terms

1
New cards

Image Filtering

The process of transforming an image by changing pixel values according to a rule that preserves or enhances specific features.

2
New cards

Sliding-kernel Filtering

A process where a local neighborhood, represented by a kernel, moves across the image to calculate new pixel values.

3
New cards

Box Filter

A filter that replaces each pixel with the average of its neighborhood, assigning equal weights to all pixels in the window.

4
New cards

Gaussian Filter

A smoothing filter that assigns larger weights to pixels near the center of the window and smaller weights to distant ones, producing a natural blur.

5
New cards

Separable Filter

A 2D filter that can be decomposed into the product of a column vector and a row vector, allowing it to be implemented as two 1D convolutions.

6
New cards

Convolution

A mathematical operation where the kernel is flipped horizontally and vertically before calculating the weighted sum of the neighborhood.

7
New cards

Cross-correlation

A process similar to convolution but uses the kernel exactly as it is, without flipping it.

8
New cards

Sobel Filter

A filter used to estimate image gradients and detect edges by calculating horizontal (SxS_x) and vertical (SyS_y) responses.

9
New cards

Median Filter

A non-linear filter that is especially effective for removing salt-and-pepper noise from an image.

10
New cards

Image Pyramid

A collection of images of the same scene represented at different resolutions.

11
New cards

Gaussian Pyramid

A structure that stores progressively smaller and smoother versions of an image, typically reduced by a factor of M/2×N/2M/2 \times N/2 at each level.

12
New cards

Laplacian Pyramid

A structure that stores the residual details (the difference) between levels of a Gaussian pyramid, used for image reconstruction.

13
New cards

Aliasing

False patterns or distortion that occur when an image is subsampled without first removing high-frequency components.

14
New cards

Low-pass Filter

A frequency filter mainly used for smoothing or blurring by allowing only low-frequency components to pass.

15
New cards

Linear Shift-Invariant (LSI) Filtering

A type of filtering where each output pixel is a linear combination of neighboring pixels, and the same kernel is applied at every location.

16
New cards

Image Gradients

Representations of the directional change in image intensity, which are strongly related to edges and boundaries.

17
New cards

Derivative of Gaussian (DoG)

A filter that combines Gaussian smoothing to reduce noise with differentiation to highlight intensity transitions.

18
New cards

Laplacian of Gaussian (LoG)

A filter that applies a second derivative operator after Gaussian smoothing, used for detecting edges and blob-like structures.

19
New cards

Dilation

A morphological operation that expands bright regions in an image by taking the maximum value in a neighborhood.

20
New cards

Erosion

A morphological operation that shrinks bright regions in an image by taking the minimum value in a neighborhood.

21
New cards

Low Frequencies

Image components corresponding to smooth intensity changes and coarse image structure.

22
New cards

High Frequencies

Image components corresponding to rapid intensity changes, such as edges, textures, and fine details.

23
New cards

Valid Output Mode

A boundary handling strategy where output pixels are only computed for positions where the kernel fully fits within the image, resulting in a smaller output.

24
New cards

Non-separable Filter Cost

The computational cost for an image of size M×MM \times M and kernel N×NN \times N, calculated as M2×N2M^2 \times N^2.

25
New cards

Separable Filter Cost

The reduced computational cost achieved by splitting a 2D convolution into two 1D passes, calculated as 2M2N2M^2N.