Image Processing Lecture Review

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

1/44

flashcard set

Earn XP

Description and Tags

Vocabulary-style flashcards covering fundamental concepts of image processing, TV standards, human vision, color models, transformations, and compression based on the provided practice questions.

Last updated 11:45 AM on 7/4/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

45 Terms

1
New cards

Image

Information about objects or illuminated scenes that humans observe and perceive using their eyes and visual nervous system.

2
New cards

Still Image representation

Represented by a luminance function of coordinate variables in the image plane I(x,y)I(x,y).

3
New cards

Sequence of Images representation

Represented by a luminance function of coordinate variables and time I(x,y,t)I(x,y,t), where the temporal relationship between frames represents motion (Video).

4
New cards

Bit depth - Binary Image

Typically 1 bit/pixel.

5
New cards

Bit depth - Gray Image

Typically 8 bits/pixel.

6
New cards

Bit depth - Color Image

Typically ranges from 16 to 24 bits/pixel.

7
New cards

NTSC Standard

A television standard using 525 scan lines and a rate of 30 frames/second.

8
New cards

PAL Standard

A television standard using 625 scan lines and a rate of 25 frames/second.

9
New cards

SECAM Standard

A television standard featuring 625 scan lines and 25 frames/second.

10
New cards

Traditional Cinema Standard

Uses a frame rate of 24 frames/second.

11
New cards

HDTV Standard (16:9)

Described as having 720 scan lines and a rate of 60 frames/second.

12
New cards

SVGA Standard

Described with a resolution of 1024×7681024 \times 768 pixels and a rate of 60 frames/second (or 1024×7201024 \times 720 at 72 frames/second in some contexts).

13
New cards

Image Digitization

A process consisting of two basic steps: Sampling (Lấy mẫu) and Quantization (Lượng tử hóa).

14
New cards

Visible Light Spectrum

Electromagnetic waves ranging from approximately 380 nm to 780 nm (or 400 nm to 700 nm).

15
New cards

Rods (Tế bào que)

75-150 million cells that are very sensitive to light, responsible for night vision and perceiving luminance (brightness).

16
New cards

Cones (Tế bào nón)

6-7 million cells concentrated mainly in the yellow spot (fovea centralis), responsible for color sensitivity.

17
New cards

Luminance (Độ rọi)

A measure of light energy received from a light source, depending on distance and wavelength.

18
New cards

Radiance (Độ chói)

A physical measure proportional to the total energy emitted by a light source surface.

19
New cards

Brightness (Độ sáng)

A subjective attribute characterizing a human's ability to perceive light intensity.

20
New cards

Hue (Sắc độ)

A color attribute related to the primary wavelength in a mixture of light waves, representing the dominant perceived color.

21
New cards

Saturation (Độ bão hòa)

Represents relative purity, indicating the amount of white light mixed with the hue.

22
New cards

Chrominance

The collective term for the color characteristics Hue and Saturation.

23
New cards

CMYK Color Model

A subtractive color model used in printing where 'K' represents Black.

24
New cards

YCbCr Color Model

A color model used in compression; it separates the Luma (Y) from Chrominance (Cb for blue-difference, Cr for red-difference).

25
New cards

4-Neighborhood (N4(p)N_4(p))

The set of points at coordinates (x+1,y)(x+1,y), (x1,y)(x-1,y), (x,y+1)(x,y+1), and (x,y1)(x,y-1), relative to point p(x,y)p(x,y).

26
New cards

Diagonal Neighborhood (ND(p)N_D(p))

The four diagonal points surrounding point p(x,y)p(x,y): (x+1,y+1)(x+1,y+1), (x1,y1)(x-1,y-1), (x+1,y1)(x+1,y-1), and (x1,y+1)(x-1,y+1).

27
New cards

m-adjacency

Introduced to eliminate multiple paths or ambiguity in connectivity found in 8-adjacency.

28
New cards

Nyquist Sampling Theorem

States for a band-limited function, the maximum sampling intervals must satisfy Delta x×12u0\text{Delta x} \times \frac{1}{2u_0} and Delta y×12v0\text{Delta y} \times \frac{1}{2v_0}.

29
New cards

Aliasing (Hiện tượng răng cưa)

Occurs when the sampling frequency does not satisfy the Nyquist rate (under-sampling).

30
New cards

Nearest Neighbor Interpolation

A fast interpolation method that assigns the value of the nearest pixel, though it may cause aliasing.

31
New cards

Bilinear Interpolation

Calculates new pixel values based on the 4 nearest neighbor pixels using a weighted average.

32
New cards

Bicubic Interpolation

Calculates new pixel values based on 16 nearest neighbor pixels, offering higher quality than Bilinear or Nearest Neighbor.

33
New cards

Histogram

A discrete function h(rk)=nkh(r_k) = n_k representing the number of pixels nkn_k with gray level rkr_k.

34
New cards

Histogram Equalization

A process to achieve a new image with an ideally uniform histogram distribution.

35
New cards

Salt & Pepper noise

Impulse noise appearing as black and white dots; negative impulses represent 'pepper' and positive impulses represent 'salt'.

36
New cards

Median Filter

An order-statistic filter that is highly effective at removing Salt & Pepper noise.

37
New cards

KL Transform (Karhunen-Loeve)

A transform aimed at reducing redundancy by minimizing correlation between neighboring pixels; its covariance matrix is a diagonal matrix.

38
New cards

Canny Edge Detection

A multi-stage edge detection method involving Gaussian smoothing, gradient calculation, non-maximum suppression, and hysteresis thresholding.

39
New cards

Hough Transform

A technique used to connect edge points into global shapes like lines, often using parameters such as rr and θ\theta.

40
New cards

Morphological Erosion (A co BA \text{ co } B)

Defined as A co B={z(B)z is a subset of A}A \text{ co } B = \{z | (B)_z \text{ is a subset of } A\}, shrinking objects.

41
New cards

Morphological Dilation (A da˜BA \text{ dãn } B)

Defined as A da˜B={z(B)z intersects A and is not empty}A \text{ dãn } B = \{z | (B)_z \text{ intersects } A \text{ and is not empty}\}, expanding objects.

42
New cards

Opening (Phép mở)

A morphological operation consisting of Erosion followed by Dilation ((A co B) da˜B(A \text{ co } B) \text{ dãn } B), used to remove small noise objects.

43
New cards

Closing (Phép đóng)

A morphological operation consisting of Dilation followed by Erosion ((A da˜B) co B(A \text{ dãn } B) \text{ co } B), used to bridge small gaps and fill holes.

44
New cards

Huffman Coding

A lossless coding method using variable-length codewords where frequently occurring symbols get shorter codes, characterized by the prefix property.

45
New cards

JPEG Compression

A lossy compression standard utilizing 2D-DCT on 8x8 pixel blocks; at very high compression ratios, it may produce 'blocking artifacts'.