A Universal Grammar-Based Code for Lossless Compression of Binary Trees

被引：23
|
作者：
Zhang, Jie L. [1 ]
Yang, En-Hui [1 ]
Kieffer, John C. [2 ]
机构：
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[2] Univ Minnesota Twin Cities, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2014年 / 60卷 / 03期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Grammar-based code; binary tree; lossless compression; context-free grammar; minimal DAG representation;
D O I：
10.1109/TIT.2013.2295392
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider the problem of lossless compression of binary trees, with the aim of reducing the number of code bits needed to store or transmit such trees. A lossless grammar-based code is presented, which encodes each binary tree into a binary codeword in two steps. In the first step, the tree is transformed into a context-free grammar from which the tree can be reconstructed. In the second step, the context-free grammar is encoded into a binary codeword. The decoder of the grammar-based code decodes the original tree from its codeword by reversing the two encoding steps. It is shown that the resulting grammar-based binary tree compression code is a universal code on a family of probabilistic binary tree source models satisfying certain weak restrictions.
引用
收藏
页码：1373 / 1386
页数：14
相关论文
共 50 条
  • [41] Application of Lempel-Ziv factorization to the approximation of grammar-based compression
    Rytter, W
    [J]. COMBINATORIAL PATTERN MATCHING, 2002, 2373 : 20 - 31
  • [42] Application of Lempel-Ziv factorization to the approximation of grammar-based compression
    Rytter, W
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 302 (1-3) : 211 - 222
  • [43] A fully linear-time approximation algorithm for grammar-based compression
    Sakamoto, Hiroshi
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 416 - 430
  • [44] Grammar-based compression using multi-phase hierarchical segmentation
    Akimov, A
    Fränti, P
    [J]. Proceedings of the Fourth IASTED International Conference on Visualization, Imaging, and Image Processing, 2004, : 364 - 368
  • [45] Universal lossless data compression with side information by using a conditional MPM grammar transform
    Yang, EH
    Kaltchenko, A
    Kieffer, JC
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 298 - 298
  • [46] Universal lossless data compression with side information by using a conditional MPM grammar transform
    Yang, EH
    Kaltchenko, A
    Kieffer, JC
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (06) : 2130 - 2150
  • [47] A fully linear-time approximation algorithm for grammar-based compression
    Sakamoto, H
    [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 348 - 360
  • [48] Grammar-Based Evolution of Polyominoes
    Megane, Jessica
    Medvet, Eric
    Lourenco, Nuno
    Machado, Penousal
    [J]. GENETIC PROGRAMMING, EUROGP 2024, 2024, 14631 : 56 - 72
  • [49] Grammar-based Encoding of Facades
    Haegler, Simon
    Wonka, Peter
    Arisona, Stefan Mueller
    Van Gool, Luc
    Mueller, Pascal
    [J]. COMPUTER GRAPHICS FORUM, 2010, 29 (04) : 1479 - 1487
  • [50] A Grammar-based Evolutionary Approach for Assessing Deep Neural Source Code Classifiers
    Saletta, Martina
    Ferretti, Claudio
    [J]. 2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
12345