Journal ArticleDOI
Compression of individual sequences via variable-rate coding
Jacob Ziv,A. Lempel +1 more
TLDR
The proposed concept of compressibility is shown to play a role analogous to that of entropy in classical information theory where one deals with probabilistic ensembles of sequences rather than with individual sequences.Abstract:
Compressibility of individual sequences by the class of generalized finite-state information-lossless encoders is investigated. These encoders can operate in a variable-rate mode as well as a fixed-rate one, and they allow for any finite-state scheme of variable-length-to-variable-length coding. For every individual infinite sequence x a quantity \rho(x) is defined, called the compressibility of x , which is shown to be the asymptotically attainable lower bound on the compression ratio that can be achieved for x by any finite-state encoder. This is demonstrated by means of a constructive coding theorem and its converse that, apart from their asymptotic significance, also provide useful performance criteria for finite and practical data-compression tasks. The proposed concept of compressibility is also shown to play a role analogous to that of entropy in classical information theory where one deals with probabilistic ensembles of sequences rather than with individual sequences. While the definition of \rho(x) allows a different machine for each different sequence to be compressed, the constructive coding theorem leads to a universal algorithm that is asymptotically optimal for all sequences.read more
Citations
More filters
Proceedings ArticleDOI
Motifs in Ziv-Lempel-Welch Clef
TL;DR: Adaptions and extensions of classical incremental ZL and ZLW paradigms are examined, in which the phrases used in compression are selected among suitably chosen motifs, defined here as strings of intermittently solid and wild characters that recur more or less frequently in the source textstring.
Proceedings ArticleDOI
Unsupervised Discovery of Recurring Speech Patterns Using Probabilistic Adaptive Metrics.
TL;DR: A novel probabilistic approach to DTW-based UTD named as PDTW, distributional characteristics of the processed corpus are utilized for adaptive evaluation of alignment quality, thereby enabling systematic discovery of pattern pairs that have similarity what would be expected by coincidence.
Journal ArticleDOI
An adaptive algorithm for the compression of computer data
T.V. Ramabadran,D.L. Cohn +1 more
TL;DR: Experiments on typical computer files show that the present scheme, at a moderate complexity level, often outperforms some of the existing schemes.
DissertationDOI
An Electronic Chalkboard for Classroom and Distance Teaching
TL;DR: This chapter discusses the development of the E-Chalk Application and its use in the classroom, as well as its applications in the professional and home environments.
Journal ArticleDOI
Block and Sliding-Block Lossy Compression via MCMC
Shirin Jalali,Tsachy Weissman +1 more
TL;DR: An approach to lossy compression of finite-alphabet sources that utilizes Markov chain Monte Carlo and simulated annealing methods and achieves optimum rate-distortion performance in the limits of large number of iterations, and sequence length, when employed on any stationary ergodic source.
References
More filters
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI
A universal algorithm for sequential data compression
Jacob Ziv,A. Lempel +1 more
TL;DR: The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable- to-block codes designed to match a completely specified source.
Journal ArticleDOI
On the Complexity of Finite Sequences
A. Lempel,Jacob Ziv +1 more
TL;DR: A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented, related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated.
Journal ArticleDOI
Coding theorems for individual sequences
TL;DR: The finite-state complexity of a sequence plays a role similar to that of entropy in classical information theory (which deals with probabilistic ensembles of sequences rather than an individual sequence).
Journal ArticleDOI
On Information Lossless Automata of Finite Order
TL;DR: The application of the tests to finite deterministic automata is discussed and a method of constructing a decoder for a given finite automaton that is information lossless of finite order, is described.