Identification of Transform Coding Chains
From MaRDI portal
Publication:4616263
DOI10.1109/TIP.2015.2507985zbMATH Open1408.94627arXiv1211.3869WikidataQ40191257 ScholiaQ40191257MaRDI QIDQ4616263FDOQ4616263
Authors: M. Tagliasacchi, Marco Visentini-Scarzanella, Pier Luigi Dragotti, S. Tubaro 
Publication date: 4 February 2019
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Abstract: Transform coding is routinely used for lossy compression of discrete sources with memory. The input signal is divided into N-dimensional vectors, which are transformed by means of a linear mapping. Then, transform coefficients are quantized and entropy coded. In this paper we consider the problem of identifying the transform matrix as well as the quantization step sizes. We study the challenging case in which the only available information is a set of P transform decoded vectors. We formulate the problem in terms of finding the lattice with the largest determinant that contains all observed vectors. We propose an algorithm that is able to find the optimal solution and we formally study its convergence properties. Our analysis shows that it is possible to identify successfully both the transform and the quantization step sizes when P >= N + d where d is a small integer, and the probability of failure decreases exponentially to zero as P - N increases.
Full work available at URL: https://arxiv.org/abs/1211.3869
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cited In (1)
This page was built for publication: Identification of Transform Coding Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4616263)
