Traditional text compression algorithms such as Huffman and LZ variants are usually based on 8-bit characters sampling. However, under the unicode representation for multilingual information, the character set of each language such as Chinese and Japanese is consisted of a very number of distinct characters and thus 16-bit or 32-bit character sampling is needed. Consequently, when text compress...

Compression methods have become of fundamental importance in almost every subfield of scientific visualization. However, unlike image compression, advanced visualization applications impose manifold constraints on the design of appropriate algorithms, where progressiveness, multiresolution or topology preservation are some of the key issues. This paper demonstrates the importance of multiresolu...

We present an algorithm that compresses two-dimensional data, which are piece-wise smooth in one direction and have oscillatory events in the other direction. Fine texture, seismic, hyper-spectral and fingerprints have this mixed structure. The transform part of the compression process is an algorithm that combines the application of the ewavelet direction in one direction with the local cosine...

Compression of computer graphics data such as static and dynamic 3D meshes has received significant attention in recent years, since new applications require transmission over channels and storage on media with limited capacity. This includes pure graphics applications (virtual reality, games) as well as 3DTV and free viewpoint video. Efficient compression algorithms have been developed first f...

Recently, in order to achieve satisfactory image and video quality and fast transmission in sometimes very low bandwidth channels, the demand for high compression ratios and fast speed in the coding and decoding procedure has been increased. A novel algorithm for very high compression of images is proposed in this paper. First of all the image is decomposed through a wavelet transform. Then the...

We have seen rapid progress in high-quality compression of wideband audio signals. Today’s coding algorithms can achieve substantially more compression than was thought possible only a few years ago. In the case of audio coding with its bandwidth of 20 kHz and more, the concept of perceptual coding has paved the way for significant bit rate reductions. However, multiple codings can reveal origi...

The emerging video coding standard ITU-T H.264 | ISO/IEC MPEG-4 AVC is introduced and described. The concept shows a significantly improved performance as compared to former video coding standards like H.263 or MPEG-4 Visual. Enhanced inter and intra prediction techniques are the key to high compression efficiency. In this paper, the main features of the standard are described, and a performanc...

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

Absrracr-The cost of a number of sequential coding search algorithms is analyzed in a systematic manner. These algorithms search code trees, and find use in data compression, error correction, and maximum likelihood sequence estimation. The cost function is made up of the size of and number of accesses to storage. It is found that algorithms that utilize sorting are much more expensive to use t...

The ever-increasing demands of the modern telemetry system for the transmission of high resolution digital video data at primary and sub-primary bit rates necessitate the employment of efficient motion-compensated video coding algorithms. This paper reviews the current status of motion compensation techniques. The two major classes of motion estimation methods currently being used for predictiv...