DCT Approximations Based on Chen's Factorization

• URL: http://arxiv.org/abs/2207.11638v1
• Date: Sun, 24 Jul 2022 02:31:28 GMT
• Title: DCT Approximations Based on Chen's Factorization
• Authors: C. J. Tablada, T. L. T. da Silveira, R. J. Cintra, F. M. Bayer
• Abstract summary: Two 8-point multiplication-free DCT approximations are proposed and their fast algorithms are also derived. Experiments with a JPEG-like image compression scheme are performed and results are compared with competing methods. New sets of transformations are embedded into an HEVC reference software to provide a fully HEVC-compliant video coding scheme.
• Score: 0.17205106391379021
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, two 8-point multiplication-free DCT approximations based on the Chen's factorization are proposed and their fast algorithms are also derived. Both transformations are assessed in terms of computational cost, error energy, and coding gain. Experiments with a JPEG-like image compression scheme are performed and results are compared with competing methods. The proposed low-complexity transforms are scaled according to Jridi-Alfalou-Meher algorithm to effect 16- and 32-point approximations. The new sets of transformations are embedded into an HEVC reference software to provide a fully HEVC-compliant video coding scheme. We show that approximate transforms can outperform traditional transforms and state-of-the-art methods at a very low complexity cost.

Related papers

• Variable-size Symmetry-based Graph Fourier Transforms for image compression [65.7352685872625]
  We propose a new family of Symmetry-based Graph Fourier Transforms of variable sizes into a coding framework. Our proposed algorithm generates symmetric graphs on the grid by adding specific symmetrical connections between nodes. Experiments show that SBGFTs outperform the primary transforms integrated in the explicit Multiple Transform Selection.
  arXiv  Detail & Related papers  (2024-11-24T13:00:44Z)
• Extensions on low-complexity DCT approximations for larger blocklengths based on minimal angle similarity [0.0]
  The discrete cosine transform (DCT) is a central tool for image and video coding because it can be related to the Karhunen-Loeve transform (KLT) We introduce 16-, 32-, and 64-point low-complexity DCT approximations by minimizing individually the angle between the rows of the exact DCT matrix and the matrix induced by the approximate transforms. Fast algorithms were also developed for the low-complexity transforms, asserting a good balance between the performance and its computational cost.
  arXiv  Detail & Related papers  (2024-10-20T01:20:35Z)
• Fast Data-independent KLT Approximations Based on Integer Functions [0.0]
  The Karhunen-Loeve transform (KLT) stands as a well-established discrete transform, demonstrating optimal characteristics in data decorrelation and dimensionality reduction. This paper introduces a category of low-complexity, data-independent KLT approximations, employing a range of round-off functions. The proposed transforms perform well when compared to the exact KLT and approximations considering classical performance measures.
  arXiv  Detail & Related papers  (2024-10-11T20:05:05Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Full Stack Optimization of Transformer Inference: a Survey [58.55475772110702]
  Transformer models achieve superior accuracy across a wide range of applications. The amount of compute and bandwidth required for inference of recent Transformer models is growing at a significant rate. There has been an increased focus on making Transformer models more efficient.
  arXiv  Detail & Related papers  (2023-02-27T18:18:13Z)
• Low-Complexity Loeffler DCT Approximations for Image and Video Coding [0.0]
  This paper introduces a matrix parametrization method based on the Loeffler discrete cosine transform (DCT) algorithm. A new class of eight-point DCT approximations was proposed, capable of unifying the mathematical formalism of several eight-point DCT approximations.
  arXiv  Detail & Related papers  (2022-07-29T03:56:18Z)
• Coarse-to-Fine Sparse Transformer for Hyperspectral Image Reconstruction [138.04956118993934]
  We propose a novel Transformer-based method, coarse-to-fine sparse Transformer (CST) CST embedding HSI sparsity into deep learning for HSI reconstruction. In particular, CST uses our proposed spectra-aware screening mechanism (SASM) for coarse patch selecting. Then the selected patches are fed into our customized spectra-aggregation hashing multi-head self-attention (SAH-MSA) for fine pixel clustering and self-similarity capturing.
  arXiv  Detail & Related papers  (2022-03-09T16:17:47Z)
• CSformer: Bridging Convolution and Transformer for Compressive Sensing [65.22377493627687]
  This paper proposes a hybrid framework that integrates the advantages of leveraging detailed spatial information from CNN and the global context provided by transformer for enhanced representation learning. The proposed approach is an end-to-end compressive image sensing method, composed of adaptive sampling and recovery. The experimental results demonstrate the effectiveness of the dedicated transformer-based architecture for compressive sensing.
  arXiv  Detail & Related papers  (2021-12-31T04:37:11Z)
• Low-complexity Rounded KLT Approximation for Image Compression [0.0]
  The Karhunen-Loeve transform (KLT) is often used for data decorrelation and dimensionality reduction. The use of the KLT in real-time applications is severely constrained by the difficulty in developing fast algorithms to implement it. This paper proposes a new class of low-complexity transforms that are obtained through the application of the round function to the elements of the KLT matrix.
  arXiv  Detail & Related papers  (2021-11-28T21:25:35Z)
• FeatMatch: Feature-Based Augmentation for Semi-Supervised Learning [64.32306537419498]
  We propose a novel learned feature-based refinement and augmentation method that produces a varied set of complex transformations. These transformations also use information from both within-class and across-class representations that we extract through clustering. We demonstrate that our method is comparable to current state of art for smaller datasets while being able to scale up to larger datasets.
  arXiv  Detail & Related papers  (2020-07-16T17:55:31Z)
• A Multiparametric Class of Low-complexity Transforms for Image and Video Coding [0.0]
  We introduce a new class of low-complexity 8-point DCT approximations based on a series of works published by Bouguezel, Ahmed and Swamy. We show that the optimal DCT approximations present compelling results in terms of coding efficiency and image quality metrics.
  arXiv  Detail & Related papers  (2020-06-19T21:56:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.