We give a development of the theory of lossy data compression from the point of view of statistics. This is partly motivated by the enormous success of the statistical approach in lossless compression, in particular Rissanen’s celebrated Minimum Description Length (MDL) principle. A precise characterization of the fundamental limits of compression performance is given, for arbitrary data source...

In this paper, we present a generalization of the simultaneous diagonalization technique by means of congruence transformations to the general reciprocal lossy multiconductor transmission line case. The method paves the way to solving the inverse problem, i.e., given a lossy multiconductor transmission line system of a given length, recover the transmission line parameters from the impedance or...

We evaluate typical performance of irregular low-density generator-matrix (LDGM) codes, which is defined by sparse matrices with arbitrary irregular bit degree distribution and arbitrary check degree distribution, for lossy compression. We apply the replica method under one-step replica symmetry breaking (1RSB) ansatz to this problem. Typical performance of irregular LDGM codes for lossy compre...

High resolution images acquired by an aerial digital camera and high resolution satellite images are expected to become more powerful data source of GIS. Since the large data volume of a high resolution image brings difficulties in dealing with it, lossy image compression is going to be indispensable. Image quality of a reconstructed image after decompression is usually evaluated by visual insp...

This paper is a revised version of the paper with the same title in the proceedings of ICIP97 (which contains a serious error in g. 1 and in table 1). Abstract This paper presents a lossless block-transform coder based on the Hadamard transform that achieves a compression ratio as good as that of the current lossless JPEG-standard and about 10 to 20% lower than the currently best state-of-the-a...

The throughput degradation of Transport Control Protocol (TCP)/Internet Protocol (IP) networks over lossy links due to the coexistence of congestion losses and link corruption losses is very similar to the degradation of processor performance (i.e., cycle per instruction) due to control hazards in computer design. First, two types of loss events in networks with lossy links are analogous to two...

In this report, a digital image data compression method which has two modes – “losslesss” mode and “lossy” mode – and also “progressive” functionality is proposed. The coding system can be optimized for an arbitrary input image signal under the lossless / lossy unified coding gain introduced here.

When working with color images, many processing algorithms and procedures can perform separation of pixel values into their luminance and chrominance components .This paper presents a new approach to compress the luminance and chrominance components using lossy and lossless Binary Plane Techniques respectively. The results are compared with the compression applied directly on RGB image using lo...

An alternative approach to two-part ’critical compression’ is presented. Whereas previous results were based on summing a lossless code at reduced precision with a lossy-compressed error or noise term, the present approach uses a similar lossless code at reduced precision to establish absolute bounds which constrain an arbitrary lossy data compression algorithm applied to the original data.

In this correspondence we investigate the performance of the Lempel–Ziv incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer which uses a Lempel–Ziv scheme to perform lossy coding.