Improvement of DCT-based compression algorithms using Poisson's equation

Katsu Yamatani1, Naoki Saito

  • 1Department of Urban Science, Meijo University, Gifu 509-0261, Japan. yamatani@urban.meijo-u.ac.jp

Related Concept Videos

Poisson Probability Distribution01:09

Poisson Probability Distribution

A Poisson probability distribution is a discrete probability distribution. It gives the probability of a number of events occurring in a fixed interval of time or space if these events happen at a known average rate and independently of the time since the last event. For example, a book editor might be interested in the number of words spelled incorrectly in a particular book. It might be that, on average, there are five words spelled incorrectly in 100 pages. The interval is 100 pages.
The...
Poisson's And Laplace's Equation01:25

Poisson's And Laplace's Equation

The electric potential of the system can be calculated by relating it to the electric charge densities that give rise to the electric potential. The differential form of Gauss's law expresses the electric field's divergence in terms of the electric charge density.
Poisson's Ratio01:23

Poisson's Ratio

Poisson's ratio is a material property that indicates their stress response. It explains the connection between the elongation or compression a material undergoes in the direction of an applied force and the contraction or expansion it experiences perpendicular to that force. When a slender bar is loaded axially, it stretches in the direction of the force and contracts laterally. Poisson's ratio is the negative ratio of this lateral contraction to the axial elongation. The negative sign ensures...
Properties of DTFT II01:24

Properties of DTFT II

In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
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...