A speech/audio codec based on Frequency Domain Linear Prediction (FDLP) exploits auto-regressive modeling to approximate instantaneous energy in critical frequency sub-bands of relatively long input segments. The current version of the FDLP codec operating at 66 kbps has been shown to provide comparable subjective listening quality results to state-of-theart codecs on similar bit-rates even wit...

Off-centered, two-sided geometric distributions of the integers are often encountered in lossless image compression applications, as probabilistic models for prediction residuals. Based on a recent characterization of the family of optimal prefix codes for these distributions, which is an extension of the Golomb codes, we investigate adaptive strategies for their symbol-by-symbol prefix coding,...

This paper presents the results of a study on the use of morphological set operations to represent and encode a discrete binary image by parts of its skeleton, a thinned version of the image containing complete information about its shape and size. Using morphological erosions and openings, a finite image can be uniquely decomposed into a finite number of skeleton subsets and then the image can...

Lossless compression is studied for a countably infinite alphabet source with an unknown, off-centered, two-sided geometric (TSG) distribution, which is a commonly used statistical model for image prediction residuals. In this paper, we demonstrate that arithmetic coding based on a simple strategy of model adaptation, essentially attains the theoretical lower bound to the universal coding redun...

This paper reviews a set of color spaces that allow reversible mapping between red-green-blue and luma-chroma representations in integer arithmetic. The YCoCg transform and its reversible form YCoCg-R can improve coding gain by over 0.5 dB with respect to the popular YCrCb transform, while achieving much lower computational complexity. We also present extensions of the YCoCg transform for four-...

A system is presented for transform coding of imagery. Specifically, the system uses the 2-D discrete cosine transform (DCT) in conjunction with adaptive classification, entropy-constrained trelliscoded quantization, optimal rate allocation, and adaptive arithmetic encoding. Adaptive classification, side rate reduction, and rate allocation strategies are discussed. Entropy-constrained codebooks...

Distributed Arithmetic Coding (DAC) proves to be an effective implementation of Slepian-Wolf Coding (SWC), especially for short data blocks. To study the property of DAC codewords, the author has proposed the concept of DAC codeword spectrum1. For equiprobable binary sources, the problem was formatted as solving a system of functional equations. Then, to calculate DAC codeword spectrum in gener...

Set Partitioning in Hierarchical Trees (SPIHT), proposed by Said and Pearlman [1], is generally regarded as a very efficient wavelet-based still image compression scheme. The algorithm uses an efficient, joint scanning and bit-allocation mechanism for quantizing the scalar wavelet coefficients, and produces a perfectly embedded bitstream. This work extends set partitioning to scan vectors of wa...

Abstract: This paper introduces an idea for image compression; consist from two parts; the first part used single stage Discrete Wavelet Transform (DWT), which produces four sub matrices; LL, HL, LH, and HH. The two sub matrices HL and LH are merged to be one matrix "Merged Matrix", and store non-zero data in array "Non-Zero-Array", then compress it by RLE and Arithmetic coding. In the second p...

A novel approach to entropy coding is described that provides the coding efficiency and simple probability modeling capability of arithmetic coding at the complexity level of Huffman coding. The key element of the proposed approach is given by a partitioning of the unit interval into a small set of disjoint probability intervals for pipelining the coding process along the probability estimates ...