We present an approach to compress arbitrary files using a Huffman-like prefix-free code generated through the use of a genetic algorithm, thus requiring no prior knowledge of substring frequencies in the original file. This approach also enables multiple-character substrings to be encoded. We demonstrate, through testing on various different formats of real-world data, that in some domains, th...

With the recent development of 3D display technologies, there is an increasing demand for realistic 3D video. However, efficient transmission and storage of depth data still presents a challenging task to the research community in these applications. Consequently a new method, called 3D Image Warping Based Depth Video Compression (IWDVC) is proposed for fast and efficient compression of 3D vide...

AbstraeL We consider efficient ways of determining the sensitivity of a product to changes in individual factors. The task is motivated by several interesting combinatorial and numeric problems which can be given a unified formulation as the problem of findi.n~ the (associative) product of N objects. Both deterministic and probabilistic changes to the factors are considered. Algorithms for two ...

There has been much interest in recent years in bounds on the redundancy of Huffman codes, given only partial information about the source word distribution, such as the probability of the most likely source. This work determines upper and lower bounds for the redundancy of Huffman codes of source words which are binomially distributed. Since the complete distribution is known, it is possible t...

One of the most successful natural language compression methods is word-based Huffman. However, such a two-pass semi-static compressor is not well suited to many interesting real-time transmission scenarios. A one-pass adaptive variant of Huffman exists, but it is character-oriented and rather complex. In this paper we implement word-based adaptive Huffman compression, showing that it obtains v...

Abstruct-In honor of the twenty-fifth amdversary of Huffman coding, four new results about Huffman codes are presented. 'Ibe ffrst result shows that a binary prefix condition code is a Huffmau code iff the intermediate and terminal nodes id the code tree can be listed by nonin-creasing probabiuty so that each node in the fist is adjacent to its sibling. The second result upper bounds the redund...

The field of evolutionary psychology is growing in prominence and influence despite the reluctance of many social scientists to apply evolutionary principles to understanding human behavior (Segerstrale, 2000). Included among the phenomena that are now studied from this perspective are developmental activities and processes, and with this, the emergence of the subfield of evolutionary--developm...

It is proven that for every random variable with a countably infinite set of outcomes and finite entropy there exists an optimal prefix code which can be constructed from Huffman codes for truncated versions of the random variable, and that the average lengths of any sequence of Huffman codes for the truncated versions converge to that of the optimal code. Also, it is shown that every optimal i...