The state-of-the-art video coding standard H.264/AVC achieves significant coding performance by adopting variable block sizes for motion estimation (ME) and mode decision. However, this technique brings out high computational complexity since the optimal mode is determined by exhaustively performing rate-distortion optimization (RDO) on each coding mode with different block sizes. In this paper...

We consider block-based interview coding techniques for multiview video sequences that are robust to illumination variations across views. We consider both global illumination differences which could be due to lack of camera calibration or heterogeneity, as well as local ilumination changes caused by lack of camera aligment. We propose a two-parameter model for illumination compensation (IC) th...

Recent video coding standards have introduced the notion of variable block size motion estimation in order to improve the coding efficiency. However, supporting various block sizes significantly increases the encoder computational complexity. H.264/AVC supports seven different block sizes for inter frame coding. This paper proposes an efficient block merging method for motion estimation resulti...

A key benefit of channel coding is the ability to protect data against channel impairments. Essentially, the channel coder adds redundancy bits that provide a way to correct corrupted data. Encryption is another way of protecting data against channel impairments and unintended interception or forging. This paper introduces an efficient approach of increasing coding gain at the receiver end. The...

This work considers the achievable performance for coded systems adapted to a multipath block–fading channel model. This is a particularly useful model for analysing mobile–radio systems which employ techniques such as slow frequency–hopping under stringent time–delay or bandwidth constraints for slowly time–varying channels. In such systems, coded information is transmitted over a small number...

In this paper a new approach for parallel wavelet image coding on MIMD architectures is introduced. Based on an image-block partition similar to the JPEG algorithm the diierent image blocks may be processed independently on seper-ate processors. In addition to the better eeciency compared to a parallel version of the sequential wavelet coding technique this algorithm is easier to implement. Exp...

This paper describes the embedded block coding algorithm at the heart of the JPEG2000 image compression standard. The algorithm achieves excellent compression performance, usually somewhat higher than that of SPIHT with arithmetic coding, but in some cases substantially higher. The algorithm utilizes the same low complexity binary arithmetic coding engine as JBIG2. Together with careful design ...

An image compression scheme based on the finite-state fractal block coding (FS-FBC) is proposed in this paper. Since the FS algorithm has been successfully employed by the vector quantization (VQ) techniques and there are many similarities between VQ and FBC scheme, we employ the FS algorithm on FBC technique to determine the fractal codes. The next-state functions for the domain pool size, con...

It has been well established that state-of-the-art wavelet image coders outperform block transform image coders in the rate-distortion (R-D) sense by a wide margin. Wavelet-based JPEG2000 is emerging as the new high-performance international standard for still image compression. An often asked question is: how much of the coding improvement is due to the transform and how much is due to the enc...

The lossless codification of stationary memoryless binary sources using block coding is studied with the additional constraint of requiring only two codeword lengths. The fundamental coding scheme of Shannon based on the asymptotic equipartition property shows the existence of block codes of this type with average codeword lengths per source output converging to the binary entropy as the block ...