lecture06 - CS 551/651 Advanced Computer Graphics...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
David Luebke 1 CS 551/651: Advanced Computer Graphics Antialiasing Continued: Prefiltering and Supersampling
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
David Luebke 2 Recap: The Sampling Theorem The sampling theorem: A continuous bandlimited function can be completely represented by a set of equally spaced samples, if the samples occur at more than twice the frequency of the highest frequency component of the function To capture a function with maximum frequency F , sample it at frequency N = 2 F . N is called the Nyquist limit .
Background image of page 2
David Luebke 3 Recap: Fourier Theory Can decompose any signal I(x) into a spectrum of sine waves F(u) F(u) is complex; we represent it with: |F(u)| = [Real(u) 2 + Imag(u) 2 ] 1/2 Ø(u) = tan -1 [Real(u)/Imag(u)] These are called the amplitude and phase spectra Back to transparencies…
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
David Luebke 4 Recap: Aliasing Sampling a function = multiplying I(x) by sampling fn S x = convolving F(u) by sampling fn S 1/x = copying F(u) at regular intervals If the copies of F(u) overlap, high frequencies “fold over”, appearing as lower frequencies This is known as aliasing
Background image of page 4
David Luebke 5 Prefiltering Eliminate high frequencies before sampling Convert I(x) to F(u) Apply a low-pass filter (e.g., multiply F(u) by a box function) Then sample. Result: no aliasing! So what’s the problem?
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
David Luebke 6 Prefiltering Eliminate high frequencies before sampling Convert I(x) to F(u) Apply a low-pass filter (e.g., multiply F(u) by a box function) Then sample. Result: no aliasing! Problem: most rendering algorithms generate sampled function directly e.g., Z-buffer, ray tracing
Background image of page 6
David Luebke 7 Supersampling The simplest way to reduce aliasing artifacts is supersampling Increase the resolution of the samples Average the results down Sometimes called postfiltering Create virtual image at higher resolution than the final image Apply a low-pass filter Resample filtered image
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
David Luebke 8 Supersampling: Limitations Q: What practical consideration hampers supersampling? A:
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 35

lecture06 - CS 551/651 Advanced Computer Graphics...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online