Pre-processing algorithms improve the quality of a compression system by removing unimportant data before encoding. This enhances both the visual quality and coding efficiency of the system. In this paper, we cast the pre-processing problem in the operational rate-distortion framework. Filtering the displaced frame difference is the focus, and the proposed method couples the choice of the quant...

Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, named “distributed arithmetic coding”, which extends arithmetic codes to the distributed case employing sequential decoding aided by the side information. In particular, we introduce a distributed binary arithmetic coder for the Slepian-Wolf coding problem...

We present a speech coding algorithm called mixeddomain residual coding (MDRC) wherein a prototype pitch cycle in each frame of the speech residual is coded in the time-domain while interpolation of the residual signal is performed in the frequency-domain. A novel quantization scheme takes into account time scaling and di erentially codes successive prototypes with a closed-loop perceptually-we...

In this paper, we investigate the noncoherent iterative demodulation of coded continuous phase modulation (CPM) in frequency hopped (FH) systems. In this field, one important problem is that the complexity of the optimal demodulator is prohibitive unless the number of symbols per hop duration is very small. To solve this problem, we propose a novel demodulator, which reduces the complexity by a...

In this work, we propose end-to-end image compression/decompression systems based on the discrete wavelet transform (DWT), entropy-constrained trellis coded quantization (ECTCQ), and arithmetic coding. Two forms of adaptation (codebook and image subblock) are investigated. The baseline system uses neither form of adaptation, while the adaptive systems use one or both forms of adaptivity. Excell...

Low bit-rate image coding brings about obvious degradation to the compressed images, among which distortions at edges are particular objectionable. In this paper, a model-based edge reconstruction algorithm is proposed for wavelet-based image coding at low bitrate. Our approach applies a general model to represent varieties of edges existing in an image. Based on this model, the problem of edge...

The set partitioning in hierarchical trees (SPIHT) wavelet image coding algorithm can be interpreted as implicitly using classification in its bit-plane coding procedure. The source distribution induced by this classification is studied and rate-distortion performance is evaluated. A quadtree sorting procedure, similar to SPIHT, is used to explicitly form classes of wavelet coefficients. The cl...

We describe a general coding strategy leading to a family of universal image compression systems designed to give good performance in applications where the statistics of the source to be compressed are not available at design time or vary over time or space. The basic approach considered uses a two-stage structure in which the single source code of traditional image compression systems is repl...

A modification of block truncation coding (BTC) is proposed in this paper. The modification is with a novel adaptive decimation and interpolation method, and predictive entropy coding of the quantization data. The decimation algorithm is designed based on the directional gradients of image blocks so as 1) to preserve the edge information, 2) to enable the interpolator utilize the already recons...