Related Experiment Video
Updated: Jul 7, 2026
13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
On the modeling of DCT and subband image data for compression
1Aerosp. and Defense Sector, Hughes Aircraft Co., Fullerton, CA.
Summary
Adaptive generalized Gaussian models offer superior image compression performance for transform and subband coding. While slightly more complex, these models provide better mean-squared error distortion than simpler Laplacian-based methods.
Area of Science:
- Digital image processing
- Information theory
- Signal compression
Background:
- Efficient image compression is crucial for storage and transmission.
- Transform and subband coding are key techniques in image compression.
- Modeling data distributions is essential for optimal quantization and coding.
Purpose of the Study:
- To evaluate different statistical models for image data in transform and subband coding.
- To compare the performance of quantizers and codes based on Laplacian and generalized Gaussian models.
- To determine the practical benefits of adaptive models for image compression.
Main Methods:
- Modeling image subband and discrete cosine transform coefficients.
- Designing quantizers and noiseless codes based on Laplacian, fixed generalized Gaussian, and adaptive generalized Gaussian models.
- Analyzing mean-squared error distortion performance.
Main Results:
- Adaptive generalized Gaussian models consistently outperformed other models in mean-squared error distortion.
- The performance improvement over Laplacian models was generally small (<= 0.08 bit/pixel).
- Simpler Laplacian models offer a viable alternative when minimal performance gains are acceptable.
Conclusions:
- Adaptive generalized Gaussian models provide the best distortion performance for image compression.
- The marginal gains may not always justify the increased complexity compared to Laplacian models.
- Pyramid codes are well-suited for transform and subband image coding due to these modeling insights.
Related Concept Videos
01:20Downsampling
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...
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
01:15Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
01:20Deconvolution
Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
01:20Discrete-Time Fourier Series
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
01:10Reconstruction of Signal using Interpolation
Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...
01:20Relation of DFT to z-Transform
The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the terms of...
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the terms of...