paper-with-me

홈 › Papers

Learning Optimal Linear Block Transform by Rate Distortion Minimization

2024-11-27 · Alessandro Gnutti, Chia-Hao Kao, Wen-Hsiao Peng, Riccardo Leonardi

Linear block transform coding remains a fundamental component of image and video compression. Although the Discrete Cosine Transform (DCT) is widely employed in all current compression standards, its sub-optimality has sparked ongoing research into discovering more efficient alternative transforms even for fields where it represents a consolidated tool. In this paper, we introduce a novel linear block transform called the Rate Distortion Learned Transform (RDLT), a data-driven transform specifically designed to minimize the rate-distortion (RD) cost when approximating residual blocks. Our approach builds on the latest end-to-end learned compression frameworks, adopting back-propagation and stochastic gradient descent for optimization. However, unlike the nonlinear transforms used in variational autoencoder (VAE)-based methods, the goal is to create a simpler yet optimal linear block transform, ensuring practical integration into existing image and video compression standards. Differently from existing data-driven methods that design transforms based on sample covariance matrices, such as the Karhunen-Lo\`eve Transform (KLT), the proposed RDLT is directly optimized from an RD perspective. Experimental results show that this transform significantly outperforms the DCT or other existing data-driven transforms. Additionally, it is shown that when simulating the integration of our RDLT into a VVC-like image compression framework, the proposed transform brings substantial improvements. All the code used in our experiments has been made publicly available at [1].

📄 PDF Abstract BibTeX arXiv:2411.18494

Code (0)

등록된 구현이 없습니다.

Tasks

Image CompressionVideo Compression

Methods 이 논문이 사용한 방법론

Discrete Cosine Transform Discrete Cosine Transform (DCT) is an orthogonal transformation method that decomposes an image to its spatial frequency spectrum. It expresses a finite sequence of data…

Similar Papers 제목 키워드 기반

Performance Analysis of DCT, Hadamard, and PCA in Block-Based Image Compression

2026-01-09 · Yashika Ahlawat arxiv

Block based image compression relies on transform coding to concentrate signal energy into a small number of coefficients. While classical codecs use fixed transforms such as the Discrete Cosine Transform (DCT), data dri…

Image Compression

AdaNIC: Towards Practical Neural Image Compression via Dynamic Transform Routing

2023-01-01 · ICCV 2023 1 · Lvfang Tao, Wei Gao, Ge Li, Chenhao Zhang

Compressive autoencoders (CAEs) play an important role in deep learning-based image compression, but large-scale CAEs are computationally expensive. We propose a framework with three techniques to enable efficient CA…

Image Compression

Approaching Rate-Distortion Limits in Neural Compression with Lattice Transform Coding

2024-03-12 · Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti

Neural compression has brought tremendous progress in designing lossy compressors with good rate-distortion (RD) performance at low complexity. Thus far, neural compression design involves transforming the source to a la…

Quantization

Lossy Compression via Sparse Linear Regression: Computationally Efficient Encoding and Decoding

2012-12-07 · Ramji Venkataramanan, Tuhin Sarkar, Sekhar Tatikonda

We propose computationally efficient encoders and decoders for lossy compression using a Sparse Regression Code. The codebook is defined by a design matrix and codewords are structured linear combinations of columns of t…

regression

Lossy Compression via Sparse Linear Regression: Performance under Minimum-distance Encoding

2012-02-03 · Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda

We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subset…

regression