arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.04535cs.ITeess.SPmath.IT
收藏

马尔可夫信源的渐近最优随机有损编码

Asymptotically Optimal Stochastic Lossy Coding of Markov Sources

Ahmed Elshafiy, Kenneth Rose

摘要:

本文提出了一种有效的基于字符串匹配技术的马尔可夫信源随机有损编码机制。早期的工作已经表明,率失真界限可以通过“自然类型选择”(NTS)机制渐进地实现,该机制迭代地编码渐进长源串(来自未知源分布P),并且在观察K个码字的集合以“d-匹配”之后,根据最大似然分布框架重新生成码本(即,满足K个源字的相应集合的失真约束。这一结果后来被推广到具有记忆的源,假设源字必须包含源超字母表上的渐近长度向量(或超符号)序列,即,该源被认为是矢量源。然而,较早的结果具有显著的实际缺陷,更具体地,它需要将超级符号(以及相应地超级字母表)长度扩展到无穷大,以便实现速率失真界限,即使对于有限存储器源,例如,马尔科夫来源这意味着NTS迭代的复杂性将超出任何实际能力,从而损害NTS算法在具有存储器的源的实际场景中的承诺。这项工作描述了一个更加有效和易于处理的机制,以实现渐进的最佳性能给定的内存约束,在一个实际的框架内量身定制的马尔可夫源。更具体地,该算法在具有规定阶的马尔可夫特性的分布的约束集合内渐近地找到最佳码本再现分布,该分布在保持指定失真水平的同时实现最小的每个字母编码率。

英文摘要:

An effective 'on-the-fly' mechanism for stochastic lossy coding of Markov sources using string matching techniques is proposed in this paper. Earlier work has shown that the rate-distortion bound can be asymptotically achieved by a 'natural type selection' (NTS) mechanism which iteratively encodes asymptotically long source strings (from an unknown source distribution P) and regenerates the codebook according to a maximum likelihood distribution framework, after observing a set of K codewords to 'd-match' (i.e., satisfy the distortion constraint for) a respective set of K source words. This result was later generalized for sources with memory under the assumption that the source words must contain a sequence of asymptotic-length vectors (or super-symbols) over the source super-alphabet, i.e., the source is considered a vector source. However, the earlier result suffers from a significant practical flaw, more specifically, it requires expanding the super-symbols (and correspondingly the super-alphabet) lengths to infinity in order to achieve the rate-distortion bound, even for finite memory sources, e.g., Markov sources. This implies that the complexity of the NTS iteration will explode beyond any practical capabilities, thus compromising the promise of the NTS algorithm in practical scenarios for sources with memory. This work describes a considerably more efficient and tractable mechanism to achieve asymptotically optimal performance given a prescribed memory constraint, within a practical framework tailored to Markov sources. More specifically, the algorithm finds asymptotically the optimal codebook reproduction distribution, within a constrained set of distributions having Markov property with a prescribed order, that achieves the minimum per letter coding rate while maintaining a specified distortion level.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑