Compression is a technique to reduce the quantity of data without excessively reducing the quality of the multimedia data.The transition and storing of compressed multimedia data is much faster and more efficient than original uncompressed multimedia data. There are various techniques and standards for multimedia data compression, especially for image compression such as the JPEG and JPEG2000 s...

In this paper, we propose a novel and highly efficient algorithm of multiplication−free binary arithmetic coding. Our proposed method relies on simple table lookups for performing the computationally critical operations of interval subdivision and probability estimation. Moreover, the underlying design principle provides a great flexibility for serving the different needs of all kind of coding ...

Past research in the field of cryptography has not given much consideration to arithmetic coding as a feasible encryption technique. Over the past few years, while arithmetic coding has still been the focus of a lot of intense research, studies have proven compression-specific arithmetic coding to be largely unsuitable for encryption. This is in spite of the large size of the model that arithme...

We give a detailed algorithm for fast text compression. Our algorithm, related to the PPM method, simpli es the modeling phase by eliminating the escape mechanism and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. We provide details of the use of quasi-arithmetic code tables, and analyze their compression performance. Our Fast PPM method is shown experimenta...

In this paper, we propose a progressive encoding algorithm for the geometric information of a 3D object, which is represented by binary voxels. Using the morphological pyramidal decomposition, the proposed algorithm first generates the multi-resolution models of a 3D object. Then, each resolution model is predicted from its lower resolution model, and the prediction errors are encoded using an ...

This paper examines the use of arithmetic coding in conjunction with the error resilient entropy code (EREC). The constraints on the coding model are discussed and simulation results are presented and compared to those obtained using Huffman coding. These results show that without the EREC, arithmetic coding is less resilient than Huffman coding, while with the EREC both systems yield comparabl...

This Chapter summarizes and concludes our research work. Our work is mainly in the area of lossless data compression using arithmetic coding. Arithmetic coding is used to compress any type of source data. It falls under entropy coding compression methods and is most widely used as a replacement of Huffman encoding entropy method due to its nearly optimal entropy. It is also used with most of th...

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 ...

A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbols. Algorithm is based on certain features of p-adic numbers and p-adic norm. p-adic coding algorithm ...

Arithmetic Coding is generalized to provide a method for transforming source output se quences into sequences whose probability distribution approaches any desired probability distribution. A further modi cation in which gaps are introduced be tween source intervals allows arithmetic encoders to produce code sequences with any information rate, enabling the encoder to perform joint source-cha...