CompPhoto: Pyramids

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/27

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

28 Terms

1
New cards

Image Pyramid

A multi-scale image representation that stores images at progressively lower resolutions to analyze different levels of detail.

2
New cards

Gaussian Pyramid

A pyramid created by repeatedly smoothing (blurring) and downsampling an image; captures coarse image structure.

3
New cards

Laplacian Pyramid

A pyramid formed from the differences between successive levels of a Gaussian pyramid; captures fine image details.

4
New cards

Purpose of Pyramids

Allows operations like blending, compression, and texture analysis at multiple resolutions.

5
New cards

Reduce Operation

Applies a low-pass filter (blur) and then downsamples the image by a factor of 2.

6
New cards

Expand Operation

Performs the inverse of reduce by upsampling and interpolating between known pixel values.

7
New cards

Relationship Between Levels

Each level gₖ = REDUCE(gₖ₋₁), where higher k corresponds to a coarser (lower resolution) image.

8
New cards

Gaussian Filter in Pyramids

Used to smooth images before downsampling to prevent aliasing.

9
New cards

Parameter a in Gaussian Pyramid

Determines the shape of the Gaussian kernel; typically between 0.3 and 0.6.

10
New cards

Gaussian Pyramid Formula

gₖ = h ✶ g(k−1), where h is the Gaussian kernel and ✶ represents convolution.

11
New cards

Laplacian Pyramid Formula

Lₗ = gₗ − EXPAND(gₗ₊₁); each level stores details lost between Gaussian levels.

12
New cards

Fine vs Coarse Levels

Fine levels store high-frequency details; coarse levels store low-frequency, large-scale information.

13
New cards

Pyramid Construction Process

1) Blur the image, 2) Subsample to create Gaussian pyramid, 3) Subtract to get Laplacian pyramid.

14
New cards

Pyramid Blending

A technique that combines images smoothly by blending across multiple pyramid levels.

15
New cards

Goal of Pyramid Blending

To avoid visible seams and ghosting by mixing images at multiple frequency scales.

16
New cards

Blending Process Steps

1) Build Laplacian pyramids of images A and B, 2) Build Gaussian mask pyramid of region R, 3) Combine pyramids using the mask, 4) Collapse to final image.

17
New cards

Pyramid Blending Equation

LO(i,j) = GR(i,j) × LA(i,j) + (1−GR(i,j)) × LB(i,j), where GR is the Gaussian mask and LA/LB are Laplacian pyramids.

18
New cards

Coarse-to-Fine Blending

Blending starts from low-frequency (coarse) levels and moves up to finer details for seamless transitions.

19
New cards

Optimal Window Size (Blending)

Window = size of largest prominent feature; helps minimize visible seams.

20
New cards

Avoiding Ghosting in Blending

Keep window ≤ 2× size of smallest prominent feature to prevent overlapping misalignments.

21
New cards

Frequency Domain Blending

Decompose images into frequency bands (octaves) using FFT and blend corresponding bands.

22
New cards

Burt and Adelson (1983)

The researchers who introduced multi-resolution image blending using Gaussian and Laplacian pyramids.

23
New cards

Octave in Frequency Domain

A range of frequencies differing by a factor of two; used in multi-band image blending.

24
New cards

Sampling in Pyramids

Downsampling reduces resolution; proper sampling prevents aliasing artifacts.

25
New cards

Aliasing

Occurs when image frequencies exceed half the sampling rate, causing visual distortions.

26
New cards

Good Sampling Practices

Sample often or sample wisely to capture sufficient detail and prevent aliasing.

27
New cards

Practical Applications of Pyramids

Image compression, texture mapping, focus stacking, and multi-scale feature extraction.

28
New cards