Low-complexity Rounded KLT Approximation for Image Compression

• URL: http://arxiv.org/abs/2111.14239v1
• Date: Sun, 28 Nov 2021 21:25:35 GMT
• Title: Low-complexity Rounded KLT Approximation for Image Compression
• Authors: A. P. Rad\"unz, F. M. Bayer, R. J. Cintra
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Karhunen-Lo\`eve transform (KLT) is often used for data decorrelation and dimensionality reduction. Because its computation depends on the matrix of covariances of the input signal, the use of the KLT in real-time applications is severely constrained by the difficulty in developing fast algorithms to implement it. In this context, 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. The proposed transforms are evaluated considering figures of merit that measure the coding power and distance of the proposed approximations to the exact KLT and are also explored in image compression experiments. Fast algorithms are introduced for the proposed approximate transforms. It was shown that the proposed transforms perform well in image compression and require a low implementation 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)
• ECRF: Entropy-Constrained Neural Radiance Fields Compression with Frequency Domain Optimization [5.990671011715725]
  Explicit feature-grid based NeRF models have shown promising results in terms of rendering quality and significant speed-up in training. We present a compression model that aims to minimize the entropy in the frequency domain in order to effectively reduce the data size.
  arXiv  Detail & Related papers  (2023-11-23T21:23:52Z)
• Stochastic Optimization for Non-convex Problem with Inexact Hessian Matrix, Gradient, and Function [99.31457740916815]
  Trust-region (TR) and adaptive regularization using cubics have proven to have some very appealing theoretical properties. We show that TR and ARC methods can simultaneously provide inexact computations of the Hessian, gradient, and function values.
  arXiv  Detail & Related papers  (2023-10-18T10:29:58Z)
• Frequency-Aware Re-Parameterization for Over-Fitting Based Image Compression [12.725194101094711]
  Over-fitting-based image compression requires weights compactness for compression and fast convergence for practical use. This paper presents a simple re- parameterization method to train CNNs with reduced weights storage and accelerated convergence. The proposed method is verified with extensive experiments of over-fitting-based image restoration on various datasets, achieving up to -46.12% BD-rate on top of HEIF with only 200 iterations.
  arXiv  Detail & Related papers  (2023-10-12T06:32:12Z)
• DCT Approximations Based on Chen's Factorization [0.17205106391379021]
  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.
  arXiv  Detail & Related papers  (2022-07-24T02:31:28Z)
• Hybrid Model-based / Data-driven Graph Transform for Image Coding [54.31406300524195]
  We present a hybrid model-based / data-driven approach to encode an intra-prediction residual block. The first $K$ eigenvectors of a transform matrix are derived from a statistical model, e.g., the asymmetric discrete sine transform (ADST) for stability. Using WebP as a baseline image, experimental results show that our hybrid graph transform achieved better energy compaction than default discrete cosine transform (DCT) and better stability than KLT.
  arXiv  Detail & Related papers  (2022-03-02T15:36:44Z)
• Communication-Efficient Federated Learning via Quantized Compressed Sensing [82.10695943017907]
  The presented framework consists of gradient compression for wireless devices and gradient reconstruction for a parameter server. Thanks to gradient sparsification and quantization, our strategy can achieve a higher compression ratio than one-bit gradient compression. We demonstrate that the framework achieves almost identical performance with the case that performs no compression.
  arXiv  Detail & Related papers  (2021-11-30T02:13:54Z)
• Learned Block Iterative Shrinkage Thresholding Algorithm for Photothermal Super Resolution Imaging [52.42007686600479]
  We propose a learned block-sparse optimization approach using an iterative algorithm unfolded into a deep neural network. We show the benefits of using a learned block iterative shrinkage thresholding algorithm that is able to learn the choice of regularization parameters.
  arXiv  Detail & Related papers  (2020-12-07T09:27:16Z)
• Kullback-Leibler Divergence-Based Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet Frames for Image Segmentation [152.609322951917]
  We come up with a Kullback-Leibler (KL) divergence-based Fuzzy C-Means (FCM) algorithm by incorporating a tight wavelet frame transform and a morphological reconstruction operation. The proposed algorithm works well and comes with better segmentation performance than other comparative algorithms.
  arXiv  Detail & Related papers  (2020-02-21T05:19:10Z)

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.