Optimal encoding of non-stationary sources

被引:6
|
作者
Reif, JH
Storer, JA [1 ]
机构
[1] Brandeis Univ, Dept Comp Sci, Waltham, MA 02254 USA
[2] Duke Univ, Durham, NC 27706 USA
关键词
D O I
10.1016/S0020-0255(01)00103-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The usual assumption for proofs of the optimality of lossless encoding is a stationary ergodic source. Dynamic sources with non-stationary probability distributions occur in many practical situations where the data source is formed from a composition of distinct sources, for example, a document with multiple authors, a multimedia document, or the composition of distinct packets sent over a communication channel. There is a vast literature of adaptive methods used to tailor the compression to dynamic sources. However, little is known about optimal or near optimal methods for lossless compression of strings generated by sources that are not stationary ergodic. Here, we do not assume the source is stationary. Instead, we assume that the source produces an infinite sequence of concatenated finite strings s(1)...s(n), where: (i) Each finite string s(i) is generated by a sampling of a (possibly distinct) stationary ergodic source S-i, and (ii) the length of each of the s(i) is lower bounded by a function L(n) such that L(n)/log(n) grows unboundedly with the length n of all the text within s(1)...s(i). Thus each input string is a sequence of substrings generated by possibly distinct and unknown stationary ergodic sources. The optimal expected length of a compressed coding of a finite prefix s(1)...s(k) is [GRAPHICS] where n(i) is the length of s(i) and H-i is the entropy of S-i. We give a window-based LZ77-type method for compression that we prove gives an encoding with asymptotically optimal expected length. We give another LZ77-type method for compression where the expected time for encoding and decoding is nearly linear (approaching arbitrarily close to linear O(12) for large n). We also prove that this later method gives an encoding with asymptotically optimal expected length. In addition, give a dictionary-based LZ78-type method for compression, which takes linear time with small constant factors. This final algorithm also gives an encoding with asymptotically optimal expected length, assuming the S-i are stationary ergodic sources that satisfy certain wiring conditions and L(n) greater than or equal to n(epsilon) for some epsilon > 0. (C) 2001 Elsevier Science Inc. All rights reserved.
引用
收藏
页码:87 / 105
页数:19
相关论文
共 50 条
  • [41] Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits
    Saha, Aadirupa
    Gupta, Shubham
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022, : 19027 - 19049
  • [42] Optimal response vigor and choice under non-stationary outcome values
    Amir Dezfouli
    Bernard W. Balleine
    Richard Nock
    Psychonomic Bulletin & Review, 2019, 26 : 182 - 204
  • [43] Meta-learning optimal parameter values in non-stationary environments
    Sikora, Riyaz T.
    KNOWLEDGE-BASED SYSTEMS, 2008, 21 (08) : 800 - 806
  • [44] Estimation of optimal for chaotic transport frequency of non-stationary flow oscillation
    Izrailsky, Yury
    Koshel, Konstantin
    Stepanov, Dmitry
    IUTAM SYMPOSIUM ON HAMILTONIAN DYNAMICS, VORTEX STRUCTURES, TURBULENCE, 2008, 6 : 393 - 402
  • [45] On the construction of the minimizing sequence of controls in the non-stationary problem of optimal response
    Topunov, M.V.
    Avtomatika i Telemekhanika, 2001, (08): : 56 - 60
  • [46] Optimal conditionally-relative observation of non-stationary linear systems
    Gabasov, R
    Dmitruk, NM
    Kirillova, FM
    PMM JOURNAL OF APPLIED MATHEMATICS AND MECHANICS, 2004, 68 (04): : 523 - 536
  • [47] Optimal Scheduling of Reservoir Flood Control under Non-Stationary Conditions
    Mo, Chongxun
    Jiang, Changhao
    Lei, Xingbi
    Cen, Weiyan
    Yan, Zhiwei
    Tang, Gang
    Li, Lingguang
    Sun, Guikai
    Xing, Zhenxiang
    SUSTAINABILITY, 2023, 15 (15)
  • [48] Does non-stationary spatial data always require non-stationary random fields?
    Fuglstad, Geir-Arne
    Simpson, Daniel
    Lindgren, Finn
    Rue, Harard
    SPATIAL STATISTICS, 2015, 14 : 505 - 531
  • [49] Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model
    Li, Chang
    de Rijke, Maarten
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 2859 - 2865
  • [50] Stationary and Non-Stationary Univariate Subdivision Schemes
    Asghar, Muhammad
    Mustafa, Ghulam
    PUNJAB UNIVERSITY JOURNAL OF MATHEMATICS, 2018, 50 (03): : 25 - 42