A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations using an improved simplification method, in which each level of the mesh can be refined into the next level by carrying out a group of vertex split operations in any order. Consequently, the PM representation can be eff...

In this paper, we give a classification of (finite or countable) א0categorical coloured linear orders, generalizing Rosenstein’s characterization of א0-categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and Qn-combinations (for n ≥ 1). We give a method using coding trees to describe all structures in our list.

We present a semi-formal derivation of Hu:ffman's well-known algorithm for the construction of an optimal encoding tree.

For compression of text databases, semi-static word-based methods provide good performance in terms of both speed and disk space, but two problems arise. First, the memory requirements for the compression model during decoding can be unacceptably high. Second, the need to handle document insertions means that the collection must be periodically recompressed, if compression efficiency is to be m...

In this paper we present online encoding and decoding algorithms for an infinite input alphabet. The well-known encoding algorithm that explicitly constructs the optimal codes is proposed by Huffman. This algorithm is clearly inappropriate for online encoding because the whole input data are not known before starting the process. We propose an algorithm that can be encoded while the input data ...

Iterative decoding of JPEG images does not perform well due to the poor distance property of the original JPEG Huffman codes. We propose a symmetric RVLC with large free distance which can dramatically improve the system performance when iterative decoding is performed. Simulation results indicate up to 4 dB coding gain is achievable. There is a significant body of literature (see references in...

We present a study correlating encoding and compressibility across four languages: English, France, German and Spanish. We show that French presents the better compression rates among those languages for two sample files, the Biblical texts Psalm 23 and Genesis 1, even though it neither have the best encoding nor the least number of characters. We discuss the possible reasons for this result an...

A loss-less compression technique is proposed which uses a variable length Region formation technique to divide the input file into a number of variable length regions. Huffman codes are obtained for entire file after formation of regions. Symbols of each region are compressed one by one. Comparisons are made among proposed technique, Region Based Huffman compression technique and classical Huf...

A simple parallel algorithm for decoding a Huuman encoded le is presented , exploiting the tendency of Huuman codes to resynchronize quickly in most cases. An extention to JPEG decoding is mentioned.

This paper proposes a method for the compression of color images by Haar transform, quantization and construction of minimum redundancy code using conventional Huffman coding. Wavelet compression is accomplished by decomposing the row and column of the image matrix using the Harr transform. And the reconstruction of the image is feasible just from 1/4 of the decomposed image and even 1/16 of th...