In 1994, Burrows and Wheeler [5] developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in order to improve their algorithm, which is based on a reversible transformation of the input string, called BWT (the Burrows-Wheeler transformation). In this paper, we propose a compression scheme based on BWT, M...

Compression helps in reducing the redundancy in the data representation so as to reduce the storage requirement of it. Compression is an important technique used to improve web retrieval latency Compression is an important technique used to improve web retrieval latency. Plethora of algorithms is available for compressing the data. Some of the algorithms helps in achieving lossless compression ...

There is great interest in the storage and browsing of large collections of video clips, due to the current explosion in demand for digital video. Many new algorithms and standards (MPEG, H.261, H.263, etc.) have been developed in recent years for the coding of video. However, most of these techniques lose performance when there exists signi cant camera motion, a common element of some classes ...

We consider the Wyner–Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding algorithms is proposed and their universal optimality is proven. Compression consists of sliding-window processing followed by Lempel–Ziv (LZ) compression, while the decompressor is based on a modification of the discr...

With increasing amount of text data being stored rapidly, efficient information retrieval and Storage in the compressed domain has become a major concern. Compression is the process of coding that will effectively reduce the total number of bits needed to represent certain information. Data compression has been one of the critical enabling technologies for the ongoing digital multimedia revolut...

Mostly transforms are used for speech data compressions which are lossy algorithms. Such algorithms are tolerable for speech data compression since the loss in quality is not perceived by the human ear. However the vector quantization (VQ) has a potential to give more data compression maintaining the same quality. In this paper we propose speech data compression algorithm using vector quantizat...

In this study, lossless grayscale image compression methods are compared on public palmprint image databases. Effect of lossy compression algorithms on biometric samples has been well studied. However, lossless compression algorithms on the compression ratios have little been appreciated. In this study, we review and the stateofart lossless compression algorithms and investigate the performance...

1 Abstract The wavelet transform shows a lot of promise in image compression. Very high compression rates are achieved by using wavelet transform prior to quan-tization and entropy coding. This report discusses how wavelets can be used in image compression. This report handles the problem from an engineer's perspective. I am conndent that this report can be used for writing a primitive wavelet ...

Many video compression schemes (e.g., the recent H.264/AVC standard) and volumetric image coding algorithms are based on a closed-loop prediction (CLP) framework. While CLP based schemes can achieve state-of-the-art coding efficiency, they are inadequate in addressing some important emerging applications such as wireless video, multiview video, etc, which have new requirements including low com...

Adaptive video coding algorithms are digital video compression algorithms that can adapt the encoding of a video stream dynamically based on the amount of bandwidth available on the network. While such algorithms are more complicated than traditional video coding algorithms, they are attractive because of their inherent robustness to changes in network load (i.e., network congestion). Adaptive ...