18 papers · ranked by Valyu relevance
Yuhang Wang, Weihua Chen, Linjing Song, Zhiping Xu + 6 more
With the rapid growth of data volume in sensor networks, lossy source coding systems achieve high-efficiency data compression with low distortion under limited transmission bandwidth. However, conventional compression algorithms rely on a two-stage framework with high computational complexity and frequently struggle to…
Huan Deng, Dan Song, Zhiping Xu, Yanglong Sun + 2 more
'Bal S. Virdee'] In the Internet of Things, sensor nodes collect environmental information and utilize lossy compression for saving storage space. To achieve this objective, high-efficiency compression of the continuous source should be studied. Different from existing schemes, lossy source coding is implemented based…
Jorge F. Silva, Milan S. Derpich
This work demonstrates a formal connection between density estimation with a data-rate constraint and the joint objective of fixed-rate universal lossy source coding and model identification introduced by Raginsky in 2008 (IEEE TIT, 2008, 54, 3059-3077). Using an equivalent learning formulation, we derive a necessary…
Jinkai Ren, Dan Song, Huihui Wu, Lin Wang + 3 more
'Jun Chen' 'Sadaf Salehkalaibar'] It is challenging to design an efficient lossy compression scheme for complicated sources based on block codes, especially to approach the theoretical distortion-rate limit. In this paper, a lossy compression scheme is proposed for Gaussian and Laplacian sources. In this scheme, a new…
Neri Merhav, Luca Faes
We propose a universal ensemble for the random selection of rate-distortion codes which is asymptotically optimal in a sample-wise sense. According to this ensemble, each reproduction vector, $x^$, is selected independently at random under the probability distribution that is proportional to $2-LZ(x^)$, where $LZ(x^)$…
Albert No
We establish an universal property of logarithmic loss in the successive refinement problem. If the first decoder operates under logarithmic loss, we show that any discrete memoryless source is successively refinable under an arbitrary distortion criterion for the second decoder. Based on this result, we propose a…
Albert No
We established a universality of logarithmic loss over a finite alphabet as a distortion criterion in fixed-length lossy compression. For any fixed-length lossy-compression problem under an arbitrary distortion criterion, we show that there is an equivalent lossy-compression problem under logarithmic loss. The…
Neri Merhav, Raúl Alcaraz
We extend Ziv and Lempel’s model of finite-state encoders to the realm of lossy compression of individual sequences. In particular, the model of the encoder includes a finite-state reconstruction codebook followed by an information lossless finite-state encoder that compresses the reconstruction codeword with no…
Jerry Gibson
Shannon introduced the fields of information theory and rate distortion theory in his landmark 1948 paper [1], where he defined “The Rate for a Source Relative to a Fidelity Evaluation.” Shannon officially coined the term “rate distortion function” in his seminal contribution in 1959 [2]. The 1950s, 1960s and 1970s…
Onur Günlü, Rafael F. Schaefer, Holger Boche, Harold Vincent Poor + 1 more
'T. Aaron Gulliver'] We extend the problem of secure source coding by considering a remote source whose noisy measurements are correlated random variables used for secure source reconstruction. The main additions to the problem are as follows: $(1)$ all terminals noncausally observe a noisy measurement of the remote…
Kun Tu, Dariusz Puchala, Jun Chen, Sadaf Salehkalaibar
In this paper, we address the problem of m-gram entropy variable-to-variable coding, extending the classical Huffman algorithm to the case of coding m-element (i.e., m-grams) sequences of symbols taken from the stream of input data for $m>1$. We propose a procedure to enable the determination of the frequencies of the…
Timor Leiderman, Yosef Ben Ezra, Jun Chen
Video compression remains a challenging task despite significant advancements in end-to-end optimized deep networks for video coding. This study, inspired by information bottleneck (IB) theory, introduces a novel approach that combines IB theory with wavelet transform. We perform a comprehensive analysis of information…
Muhammmad Bilal, Zahid Ullah, Omer Mujahid, Tama Fouzder + 1 more
Vector quantization (VQ) is a block coding method that is famous for its high compression ratio and simple encoder and decoder implementation. Linde-Buzo-Gray (LBG) is a renowned technique for VQ that uses a clustering-based approach for finding the optimum codebook. Numerous algorithms, such as Particle Swarm…
Nithin Nagaraj, Arun Somani
Error detection is a fundamental need in most computer networks and communication systems in order to combat the effect of noise. Error detection techniques have also been incorporated with lossless data compression algorithms for transmission across communication networks. In this paper, we propose to incorporate a…
Viktor Makarichev, Vladimir Lukin, Oleg Illiashenko, Vyacheslav Kharchenko + 1 more
Digital images are used in various technological, financial, economic, and social processes. Huge datasets of high-resolution images require protected storage and low resource-intensive processing, especially when applying edge computing (EC) for designing Internet of Things (IoT) systems for industrial domains such as…
Grzegorz Ulacha, Ryszard Stasiński, Cezary Wernik
In this paper, the most efficient (from data compaction point of view) and current image lossless coding method is presented. Being computationally complex, the algorithm is still more time efficient than its main competitors. The presented cascaded method is based on the Weighted Least Square (WLS) technique, with…
Chen-Hsiu Huang, Ja-Ling Wu, Jun Chen
End-to-end learned image compression codecs have notably emerged in recent years. These codecs have demonstrated superiority over conventional methods, showcasing remarkable flexibility and adaptability across diverse data domains while supporting new distortion losses. Despite challenges such as computational…
Paweł Pawłowski, Karol Piniarski, Adam Dąbrowski
In this paper we present a highly efficient coding procedure, specially designed and dedicated to operate with high dynamic range (HDR) RCCC (red, clear, clear, clear) image sensors used mainly in advanced driver-assistance systems (ADAS) and autonomous driving systems (ADS). The coding procedure can be used for a…