An algorithm for universal lossless compression with side information

被引:19
|
作者
Cai, Haixiao [1 ]
Kulkarni, Sanjeev R. [1 ]
Verdu, Sergio [1 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
arithmetic coding; conditional entropy; context tree weighting method; hidden Markov process; source coding; universal lossless data compression;
D O I
10.1109/TIT.2006.880020
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes a new algorithm based on the Context-Tree Weighting (CTW) method for universal compression of a finite-alphabet sequence x(1)(n) with side information y(1)(n) available to both the encoder and decoder. We prove that with probability one the compression ratio converges to the conditional entropy rate for jointly stationary ergodic sources. Experimental results with Markov chains and English texts show the effectiveness of the algorithm.
引用
收藏
页码:4008 / 4016
页数:9
相关论文
共 50 条
  • [1] Universal data compression with side information at the decoder by using traditional universal lossless compression algorithms
    Yang, En-hui
    He, Da-ke
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 431 - +
  • [2] Secure lossless compression with side information
    Gunduz, Deniz
    Erkip, Elza
    Poor, H. Vincent
    [J]. 2008 IEEE INFORMATION THEORY WORKSHOP, 2008, : 169 - 173
  • [3] 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
  • [4] 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
  • [5] Universal lossless compression algorithm for textual images
    al Zahir, Saif
    [J]. OPTICAL ENGINEERING, 2012, 51 (03)
  • [6] Lossless Data Compression with Side Information: Nonasymptotics and Dispersion
    Gavalakis, Lampros
    Kontoyiannis, Ioannis
    [J]. 2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 2179 - 2183
  • [7] Fundamental Limits of Lossless Data Compression With Side Information
    Gavalakis, Lampros
    Kontoyiannis, Ioannis
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (05) : 2680 - 2692
  • [8] A universal lossless compressor with side information based on context tree weighting
    Cai, HX
    Kulkarni, SR
    Verdú, S
    [J]. 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 2340 - 2344
  • [9] Universal Lossless Compression of Graphical Data
    Delgosha, Payam
    Anantharam, Venkat
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1578 - 1582
  • [10] Universal Lossless Compression of Graphical Data
    Delgosha, Payam
    Anantharam, Venkat
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (11) : 6962 - 6976