...
首页> 外文期刊>IEEE Transactions on Information Theory >An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
【24h】

An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results

机译:通过连续码本改进的在线通用有损数据压缩算法。一,基本成果

获取原文
获取原文并翻译 | 示例
           

摘要

A new on-line universal lossy data compression algorithm is presented. For finite memoryless sources with unknown statistics, its performance asymptotically approaches the fundamental rate distortion limit. The codebook is generated on the fly, and continuously adapted by simple rules. There is no separate codebook training or codebook transmission. Candidate codewords are randomly generated according to an arbitrary and possibly suboptimal distribution. Through a carefully designed "gold washing" or "information-theoretic sieve" mechanism, good codewords and only good codewords are promoted to permanent status with high probability. We also determine the rate at which our algorithm approaches the fundamental limit.
机译:提出了一种新的在线通用有损数据压缩算法。对于统计信息未知的有限无记忆源,其性能渐近接近基本速率失真极限。该代码本是即时生成的,并通过简单的规则不断进行调整。没有单独的密码本培训或密码本传输。候选码字是根据任意且可能不是最佳的分布随机生成的。通过精心设计的“洗金”或“信息理论筛”机制,可以将好代码字和只有好代码字以高概率提升为永久状态。我们还确定算法接近基本极限的速率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号