This paper presents a new scalable and highly flexible color image coder based on a Matching Pursuit expansion. The Matching Pursuit algorithm provides an intrinsically progressive stream and the proposed coder allows us to reconstruct color information from the first bit received. In order to efficiently capture edges in natural images, the dictionary of atoms is built by translation, rotation...

In this paper, we propose an optimized motion estimation for perceptual video coding, i.e., a quadtree-based variable size block motion estimation scheme jointly optimize both motion vector coder and residual coder by minimizing the rate subject to a constraint on overall distortion. The residual coder includes perceptual quantization and direct block coding. Since the encoder encodes the resid...

A 4 bit/sample transform coder is designed using a psychoacoustically derived noise masking threshold based on the shortterm input spectrum of the signal. The coder has been tested in a formal subjective test involving a wide selection of monophonic audio inputs. The signals used in the test were of 15 kHz bandwidth, sampled at 32 kHz. The bit rate of the resulting coder was 128 kbits/s. The su...

Most state-of-the-art image compression techniques exploit the dependencies between the subbands in a wavelet transformed image. We propose a progressive image coding technique which is based upon the augmented zerotrees of wavelet coeecients. An augmented zerotree can be regarded as a spatial orientation tree with some extended characteristics. Both the coder and decoder require to maintain on...

The paper presents a speech coding algorithm for operation at 11 025 samples/s. The coder provides improved speech quality and compatibility with the MS-Windows multimedia environment. The coding algorithm has been developed by adapting the ITU G729 and enhancing it with some recent developments in the medium band coding. The coder operates over a band of frequencies ranging from 20 to 5400 Hz ...

Roundoff error analysis of a pipelined adaptive differential pulse code modulation (ADPCM) coder is presented. The pipelined coder has been developed by employing the relaxed look-ahead technique. It is shown that the precision of the quantized prediction error and those of the predictor coefficients are critical and analytical expressions for lower bounds on these predsions are derived. In add...

Arithmetic coding is a highly effective method for data compression. One of the criticisms levelled at it is that it runs fairly slowly. We propose a novel method for arithmetic coding that runs at a significantly higher speed and can be implemented using simple hardware if required.

In today’s streaming video content delivery infrastructure scalability is a highly desired feature. Not all the network enjoy the same bandwidth and as such the video servers should be able to provide different resolution and frame rate versions of the requested content without the need to re-encode the content to the desired bandwidth. Also video servers should be able to change the frame rate...

The goal of this thesis is to valid the hypothesis such that the video object coding allowssignificant improvement thanks to the used of dynamic coding. The dynamic coding is thesetting on competition of a set of coders on each video object and the retaining of the bestcoder for each object.To reach that goal, different points are studied. The first one concerns the study of...

Most state-of-the-art image compression techniques exploit the dependencies between the subbands in a wavelet transformed image. We propose a progressive image coding technique which is based upon the augmented zerotrees of wavelet coefficients. An augmented zerotree can be regarded as a spatial orientation tree with some extended characteristics. Both the coder and decoder require to maintain ...