摘要
介绍算术编码的原理和基于模型的自适应算术编码算法,并利用二进制高效率的索引树这样一个数据结构对传统的自适应算术编码进行了改进。实验表明,无论对于高度集中的数据集还是对于分布较为均匀的数据集,在运行时间上新算法都有较大的改进。验证了该算法在提高解的精度和加快收敛速度方面都有显著改善,从而为解决函数优化问题提供了一种行之有效的新方法.
The principle of arithmetic coding is introduced at first.The model-based adaptive arithmetic coding is introduced too.A effective data structure which is binary indexed tree has been used for improving zero-order adaptive arithmetic coding.It shows that the new method can decrease the running time drastically for both centralized data set and uniform data set.It is improved on the solution precision and increased convergence speed.The proposed methed provides an effective new method to solve the function optimization problems.
出处
《微型电脑应用》
2010年第7期56-58,6,共3页
Microcomputer Applications
基金
上海高校优秀青年教师科研专项基金(sbz09001)
上海思博职业技术学院科研基金项目(C1125)
关键词
自适应
熵编码
算术编码
上下文建模
Adptation
Entropy Coding
Arithmetic Coding
Context Modeling