Paul A. J. Volf and Frans M. J. Willems. Switching between two universal source coding algorithms. In Data Compression Conference, pages 491--500, 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... and these algorithms predict with Markov modeling the probability of a given character based on a given number of characters that immediately precede it, VW98: the switching method which can be used to combine two sequential universal source coding algorithms, proposed by Volf and Willems [56, 57], BW94: the original Burrows Wheeler compression algorithm [18] D00: the best version of BWT based compression algorithms proposed by Deorowicz [22] BWT: the BWT compression algorithms implemented in this paper with the original MTF scheme, BWT2: the BWT compression algorithms ....

P. A. J. Volf and F. M. J. Willems. Switching between two universal source coding algorithms. In Proceedings of the IEEE Data Compression Conference, pages 491--500.

.... by Teahan [25] B97 the best version of PPM algorithms proposed by Bunton [26] CTW Context Tree Weighting method proposed by Willems, Shtarkov and Tjalkens [27] BW94 original Burrows Wheeler algorithm [1] VW98 switching method, algorithm presented by Volf and Willems [28, 29], D99 BWT based algorithm proposed by Deorowicz [2] BS99 BWT based algorithm proposed by Balkenhol and Shtarkov [6] D00 BWT based algorithm proposed in this paper. S. DEOROWICZ SECOND STEP ALGORITHMS IN THE BWCA 11 Table 3: Comparison of compression algorithms for Calgary ....

Volf PAJ, Willems FMJ. Switching between two universal source coding algorithms. Proceedings of the IEEE Data Compression Conference 1998; 491--500.

....binary alphabet sequences. It was extended for multi alphabet sources [20] for easiness to implement [17, 14, 19] for compressing text [13] and for improving PPMs [1] Though the CTW will have good compression ratio in practice, its implementation is di#cult and there are few implementations [13, 15]. One reason is that the original CTW is for binary sequences and it cannot be directly applied to multi alphabet sequences. The other reason is that it uses block probabilities of many subsequences which requires multi precision floating point arithmetic operations. This is a drawback in speed ....

....on conditional probabilities Pr(x t x t 1 1 ) However, they encode the probabilities by using their special arithmetic encoder. they also represent ranges of arithmetic code corresponding a block probability of x t 1 by a fixed precision real value which is not desirable. Volf and Willems [15] proposed the switching method. It calculates code word length of two di#erent compression algorithms and use better one. They combine the CTW and other compression algorithms and improve compression ratio. Because the CTW in this algorithm is based on the binary decomposition technique [13] it ....

P. A. J. Volf and F. M. J. Willems. Switching between Two Universal Source Coding Algorithms. In IEEE Data Compression Conference, pages 491--500, March 1998.

.... decision problems with other loss functions can be traced back to the work of Cover [31] Rissanen [10] Rissanen and Langdon [25] Ryabko and others [15, 32, 33] Following the development of universal source coding algorithms based on Bayesian mixtures and sequential probability assignment [9, 11, 13], we recently developed a related algorithm for universal linear prediction of real valued data with respect to both finite and continuous classes of experts [34 36] Our approach is based on some of the well known properties of Bayesian mixture probability models for sequential encoding of ....

P. A. J. Volf and F. M. Willems, "Switching between two universal source coding algorithms," in Proc. 1998 Data Comp. Conf., (Snowbird, UT), pp. 491--500, 1998.

....of nonstationary sources produced by concatenating finite strings from different sources. However, they assume that the individual strings are long, and grow without bound as the input increases; this assumption allows an encoding method to be derived with asymptotically optimal expected length. Volf and Willems (1997) study the combination of two universal coding algorithms using a switching method. They devise a dynamic programming structure to control switching, but rather than computing the probability of a single transition sequence, they weight over all transition sequences. Our work derives from Teahan ....

Volf, P.A.J. and Willems, F.M.J. (1997) "Switching between two universal source coding algorithms." Proc Data Compression Conference, edited by J.A. Storer and J.H. Reif. IEEE Computer Society Press, Los Alamitos, CA, pp. 491--500.

....1.467 1.325 1.34 1.256 1.57 1.50 1.47 1.448 Avg 3141622 2.695 2.283 2.177 2.19 2.123 2.43 2.34 2.30 2. 271 CTW Context Tree Weighting method proposed by Willems, Shtarkov and Tjalkens [26] the results come from Reference [9] VW98 switching method, algorithm presented by Volf and Willems [27, 28], BW94 original Burrows Wheeler algorithm [1] F96 BWT based algorithm proposed by Fenwick [23] BKS98 BWT based algorithm proposed by Balkenhol, Kurtz and Shtarkov [9] D99 BWT based algorithm proposed in this paper. The average compression ratio obtained with our algorithm ....

Volf PAJ, Willems FMJ. Switching between two universal source coding algorithms. In Proceedings of the IEEE Data Compression Conference 1998; 491-500. http://ei1.ei.ele.tue.nl/~paul/p and w/dcc98.zip.

.... of the class of piecewise identically distributed source for sequences studied in information theory [19, 11] The coding methods for the class of piecewise identically distributed source have been applied to text compression to obtain some of the best text compression results currently available [16]. Similar methods have also been studied in computational learning theory [7, 17, 4] In fact, the method described in this paper is an extension of the specialist method in [4] to two dimensions. In this paper, we provide a sequential probability assignment algorithm that codes the image with a ....

....probability assignment algorithms instead of static probability models. Hence, context based methods can be used in conjunction with the quadtree weighting method or the best tiling method by being included in the set of N probability models. This is analogous to the coding methods used in [16] which switch between two coding algorithms with different properties. The main contribution of the paper is the introduction of the class of k rectangular tilings of an image as a useful comparison class for image compression and showing that a computationally efficient 4 compression method ....

Paul A. J. Volf and Frans M. J. Willems. Switching between two universal source coding algorithms. In Data Compression Conference, pages 491--500, Snowbird Utah, 1998.

....weighting assuming that only the pixels inside the window exist and another that selects the most probable model given the pixels inside the window. Algorithms that compress close to the best segmentation of a sequence, where a different model is used in each segment have been considered in [12, 10]. In [10] methods that switch between two text compression algorithms that have different properties are studied. The class of k rectangular tiling of an image can be considered as a two dimensional extension of the class of segmentation of a sequence. As in [10] the tiling method can also be ....

....assuming that only the pixels inside the window exist and another that selects the most probable model given the pixels inside the window. Algorithms that compress close to the best segmentation of a sequence, where a different model is used in each segment have been considered in [12, 10] In [10], methods that switch between two text compression algorithms that have different properties are studied. The class of k rectangular tiling of an image can be considered as a two dimensional extension of the class of segmentation of a sequence. As in [10] the tiling method can also be used with N ....

[Article contains additional citation context not shown here]

Paul A. J. Volf and Frans M. J. Willems. Switching between two universal source coding algorithms. In Data Compression Conference, pages 491--500, 1998.

....of non stationary sources produced by concatenating finite strings from different sources. However, they assume that the individual strings are long, and grow without bound as the input increases; this assumption allows an encoding method to be derived with asymptotically optimal expected length. Volf and Willems (1997) study the combination of two universal coding algorithms using a switching method. They devise a dynamic programming structure to control switching, but rather than computing the probability of a single transition sequence, they weight over all transition sequences. Our work derives from Teahan ....

Volf, P.A.J. and Willems, F.M.J. (1997) "Switching between two universal source coding algorithms." Proc Data Compression Conference, edited by J.A. Storer and J.H. Reif. IEEE Computer Society Press, Los Alamitos, CA, pp. 491--500.

.... of the class of piecewise identically distributed source for sequences studied in information theory [19, 11] The coding methods for the class of piecewise identically distributed source have been applied to text compression to obtain some of the best text compression results currently available [16]. Similar methods have also been studied in computational learning theory [7, 17, 4] In fact, the method described in this paper is an extension of the specialist method in [4] to two dimensions. In this paper, we provide a sequential probability assignment algorithm that codes the image with a ....

....probability assignment algorithms instead of static probability models. Hence, context based methods can be used in conjunction with the quadtree weighting method or the best tiling method by being included in the set of N probability models. This is analogous to the coding methods used in [16] which switch between two coding algorithms with different properties. The main contribution of the paper is the introduction of the class of k rectangular tilings of an image as a useful comparison class for image compression and showing that a computationally efficient 4 compression method ....

Paul A. J. Volf and Frans M. J. Willems. Switching between two universal source coding algorithms. In Data Compression Conference, pages 491--500, 1998.

No context found.

Paul A. J. Volf and Frans M. J. Willems. Switching between two universal source coding algorithms. In Data Compression Conference, pages 491--500, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC