The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable bias uses the side information to give a delay-universal coding system for lossless source coding with side information. The scheme is shown to give exponentia...

In this paper we give a short theoretical description of the general predictive adaptive arithmetic coding technique. The links between this technique and the works of J. Rissanen in the 80’s, in particular the BIC information criterion used in parametrical model selection problems, are established. We also design lossless and lossy coding techniques of images. The lossless technique uses a mix...

A new class of two-channel lter banks having integer lter coeecients is proposed. The integer lter coeecients are obtained by maximizing for subband coding gain. The number of bits required to represent the subband samples are kept low through eecient nonlinear implementation techniques. Several integer coeecient lter banks are tested for lossless image compression. An octave-band (dyadic) freq...

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences =1 and =1 is drawn independent and identically distributed (i.i.d.) according to joint probability mass function (p.m.f.) ( ); the encoder for each source operates without knowledge of the other source; the decoder jointly decodes the encoded bit str...

A rapidly advancing field, image compression has seen many recent developments. A number of well-known compression algorithms dominate the world of lossy compression, but in the realm of lossless compression, fewer techniques have been explored. The most successful lossy compression methods are based on transform methodologies, commonly involving the KLT, cosine, and wavelet transforms. However...

Data Compression may be defined as the science and art of the representation of information in a crisply condensed form. For decades, Data compression has been one of the critical enabling technologies for the ongoing digital multimedia revolution. There are a lot of data compression algorithms which are available to compress files of different formats. This paper provides a survey of different...

A digital discrete signal corrsepond to a specific pointer is termed as bitplane image which represents position of bit in binary number. The lossless image compression is a combination of bitplane slicing and adaptive coding. This paper will discuss adaptive lossless image compression using bitplane slicing technique and derived the compression ratio. Refer ences

A two-stage lossless image compression scheme is presented , the rst stage of which decorrelates the raw image data by using a two-dimensional, causal linear predic-tor, resulting in signiicant entropy reduction. The second stage uses standard coding techniques. Diierent two-stage schemes are compared with respect to their performances on several images, using bilevel coding, arithmetic coding,...

JPEG-LS, the well-known international standard for lossless and near-lossless image compression, was originally designed for non-scalable applications. In this paper we propose a scalable modification of JPEG-LS and compare it with the leading image and video coding standards JPEG2000 and H.264/SVC intra for low-complexity constraints of some wireless video applications including graphics.