Computer Vision Foundations · free preview

Anti-Aliasing Filters

Designing the filter that must precede decimation, from the ideal discrete sinc through windowed designs to the pragmatic binomial default.

1. The cutoff is dictated by arithmetic

The cutoff is dictated by arithmetic

2. Making it finite, and paying for it

Making it finite, and paying for it

3. What each choice costs you

What each choice costs you

4. Choosing in practice

Choosing in practice

5. Computing the cutoff

You are about to decimate a signal of length $N = 8$ by a factor $k = 2$ . Above which bin index must your anti-aliasing filter remove content before the decimation?

6. Reading the trade-offs

A designer must resize images that contain strong dark-light edges and cannot show ringing ripples or halos near those edges. Which filter family fits best?

7. Cutoff for a given decimation

A signal of length $N = 8$ is to be decimated by $k = 2$ . The anti-aliasing filter must remove content above bin $N/2k$ . Compute that cutoff bin index.

Practice this interactively

Free account · instant grading · spaced review that schedules itself.

Start this course for free