Fast cartoon + texture image filters

Antoni Buades1, Triet M Le, Jean-Michel Morel

  • 1Department Mathématiques Appliquées, Université Paris V, Paris, France. toni.buades@uib.es

Related Concept Videos

Shape and Texture of Coarse Aggregate01:25

Shape and Texture of Coarse Aggregate

Aggregate shape is classified based on the relative sharpness or roundness of the edges and corners. This classification includes categories like rounded, angular, elongated, and flaky, each with specific characteristics. Rounded aggregates, fully shaped by attrition, are typical of river or seashore gravel, while angular aggregates, such as crushed rock, have well-defined edges. Aggregates that are elongated and flaky are less desirable, as they can reduce the workability and strength of...
Active Filters01:25

Active Filters

Active filters are electronic circuits that use operational amplifiers (op-amps), resistors, and capacitors to filter out unwanted frequency components from a signal. A first-order low-pass active filter is designed to pass signals with a frequency lower than a certain cutoff frequency and attenuate frequencies higher than that cutoff frequency. The transfer function for a first-order low-pass active filter is:
Filtration00:53

Filtration

Filtration is a physical separation process that involves passing a suspension through a porous medium to separate solids from fluids. During filtration, solids collect on the porous medium while liquids, also collectively known as the filtrate, pass through. The filtration medium is selected based on the filtration purpose, quantity, and nature of the precipitate. The general criteria for a suitable filtering medium are that it is inert, mechanically strong, nonabsorbent toward dissolved...
Aliasing01:18

Aliasing

Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...