The Community for Technology Leaders
Data Compression Conference (2010)
Snowbird, Utah
Mar. 24, 2010 to Mar. 26, 2010
ISSN: 1068-0314
ISBN: 978-0-7695-3994-2
pp: 179-188
Bi-directional context sets extend the classical context-tree modeling framework to situations in which the observations consist of two tracks or directions. In this paper, we study the problem of efficiently finding an optimal bi-directional context set for a given data sequence and loss function. This problem has applications in data compression, prediction, and denoising. The main tool in our construction is a new data structure, the compact bi-directional context graph, which generalizes compact suffix trees to two directions.
context modeling, bi-directional models, suffix trees, compact bi-directional context graphs
Alfredo Viola, Fernando Fernández, Marcelo J. Weinberger, "Efficient Algorithms for Constructing Optimal Bi-directional Context Sets", Data Compression Conference, vol. 00, no. , pp. 179-188, 2010, doi:10.1109/DCC.2010.23
94 ms
(Ver 3.3 (11022016))