Compressing probability distributions
Information Processing Letters
Fast and Efficient Compression of Floating-Point Data
IEEE Transactions on Visualization and Computer Graphics
Note: Compressed depth sequences
Theoretical Computer Science
Compressing probability distributions
Information Processing Letters
Enhanced byte codes with restricted prefix properties
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Lossless geometry compression for steady-state and time-varying irregular grids
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
| Hi-index | 0.00 |
Practical applications that employ entropy coding for large alphabets oftenpartition the alphabet set into two or more layers and encode each symbolby using some suitable prefix coding for each layer.In this paper we formulatethe problem of optimal alphabet partitioning for the design of a twolayer semi-adaptive code and give a solution based on dynamic programming.However, the complexity of the dynamic programming approach can be quiteprohibitive for a long sequence and a very large alphabet size.Hence, we givea simple greedy heuristic algorithm whose running time is linear in the numberof symbols being encoded, irrespective of the underlying alphabet size.Wegive experimental results that demonstrate the fact that superior prefix codingsschemes for large alphabets can be designed using our approach as opposed tothe typically ad-hoc partitoning approach applied in the literature.