Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
From MaRDI portal
Publication:2002406
Abstract: The principal component analysis (PCA) is widely used for data decorrelation and dimensionality reduction. However, the use of PCA may be impractical in real-time applications, or in situations were energy and computing constraints are severe. In this context, the discrete cosine transform (DCT) becomes a low-cost alternative to data decorrelation. This paper presents a method to derive computationally efficient approximations to the DCT. The proposed method aims at the minimization of the angle between the rows of the exact DCT matrix and the rows of the approximated transformation matrix. The resulting transformations matrices are orthogonal and have extremely low arithmetic complexity. Considering popular performance measures, one of the proposed transformation matrices outperforms the best competitors in both matrix error and coding capabilities. Practical applications in image and video coding demonstrate the relevance of the proposed transformation. In fact, we show that the proposed approximate DCT can outperform the exact DCT for image encoding under certain compression ratios. The proposed transform and its direct competitors are also physically realized as digital prototype circuits using FPGA technology.
Recommendations
- An orthogonal 16-point approximate DCT for image and video compression
- A generalized approach to linear transform approximations with applications to the discrete cosine transform
- Efficient, low complexity 8-point discrete Tchebichef transform approximation for signal processing applications
- Fast 2-D \(8\times 8\) discrete cosine transform algorithm for image coding
- scientific article; zbMATH DE number 1941102
Cites work
- A Fast Computational Algorithm for the Discrete Cosine Transform
- A new algorithm to compute the discrete cosine Transform
- A new square wave transform based on the DCT
- An integer approximation method for discrete sinusoidal transforms
- Binary Discrete Cosine and Hartley Transforms
- Computing real square roots of a real matrix
- Computing the Polar Decomposition—with Applications
- Data compression. The complete reference.
- Discrete Cosine Transform
- Fast algorithms for signal processing.
- Fast algorithms for the discrete cosine transform
- Fast Polar Decomposition of an Arbitrary Matrix
- Functions of Matrices
- scientific article; zbMATH DE number 47594 (Why is no real title available?)
- scientific article; zbMATH DE number 193953 (Why is no real title available?)
- scientific article; zbMATH DE number 5224144 (Why is no real title available?)
- Integer DCT Based on Direct-Lifting of DCT-IDCT for Lossless-to-Lossy Image Coding
- Introduction to algorithms
- Linear algebra and its applications
- Principal component analysis.
- Smoothing non-stationary time series using the discrete cosine transform
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
- Topics in circular statistics. With 1 IBM-PC floppy disk (3. 5 inch, HD)
Cited in
(4)- Rapid prototyping of field programmable gate array-based discrete cosine transform approximations
- An orthogonal 16-point approximate DCT for image and video compression
- Efficient, low complexity 8-point discrete Tchebichef transform approximation for signal processing applications
- A generalized approach to linear transform approximations with applications to the discrete cosine transform
This page was built for publication: Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002406)
