Fractal image compression with region-based functionality

Kamel Belloulata1, Janusz Konrad

  • 1Département de Génie Electrique et de Génie Informatique, Université de Sherbrooke, Sherbrooke, QC, Canada. kamel.belloulata@courrier.usherb.ca

Related Concept Videos

Double Integrals Over General Regions01:18

Double Integrals Over General Regions

Double integrals are often used to measure quantities distributed across two-dimensional regions, such as rainfall over a lake, heat across a metal plate, or population density over land. In many practical situations, the region of interest does not have straight boundaries and cannot be described conveniently as a rectangle. Instead, the region may have curved or irregular edges. To evaluate integrals over such domains, the region is embedded inside a larger rectangular region where...
Triple Integrals over General Regions01:28

Triple Integrals over General Regions

Triple integrals over general bounded regions extend the concept of double integrals from planar domains to three-dimensional solids. A solid region E in space is commonly enclosed within a rectangular box B, and a continuous function f(x, y, z) is integrated over the region by defining F such that it coincides with f on E and is zero outside the solid. The triple integral is therefore expressed as\begin{equation*}\iiint_E f(x,y,z) dV \end{equation*}The existence of the integral requires that f...
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...
Downsampling01:20

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
Region of Convergence01:17

Region of Convergence

The z-transform is a powerful mathematical tool used in the analysis of discrete-time signals and systems. It is a crucial tool in the analysis of discrete-time systems, but its convergence is limited to specific values of the complex variable z. This range of values, known as the Region of Convergence (ROC), is fundamental in determining the behavior and stability of a system or signal. The ROC defines the region in the complex plane where the z-transform converges, which can take various...