Copyright c ©1997 IEEE. Reprinted from IEEE Information Theory Society Newsletter, Vol. 47, No. 1, March 1997. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obt...

We describe a sequential universal data compression procedure for binary tree sources that performs the \double mixture". Using a context tree, this method weights in an eecient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and stor...

................................................................................................................... i TABLE OF CONTENTS ..............................................................................................ii LIST OF TABLES .......................................................................................................iii LIST OF FIGURES .............................

zs denotes the concatenation of a data zz and a string s, l(s) is the length of a string s, 0 < ps < 1 is a constant given to a string s if 0 < l(s) 5 D 1, ,Bs = 0 if 2(s) = D (D > 1: some integer), Q,(x;) is the product of the predicted probabilities over the time instances such that the string defined below is s. The CTW assumes that the source is some tree source: the probability of x1+1 E A...

Alignment of time series is an important problem to solve in many scientific disciplines. In particular, temporal alignment of two or more subjects performing similar activities is a challenging problem due to the large temporal scale difference between human actions as well as the inter/intra subject variability. In this paper we present canonical time warping (CTW), an extension of canonical ...

Context tree weighting method is a universal compression algorithm for FSMX sources. Though we expect that it will have good compression ratio in practice, it is difficult to implement it and in many cases the implementation is only for estimating compression ratio. Though Willems and Tjalkens showed practical implementation using not block probabilities but conditional probabilities, it is use...