| 摘要: |
| 提出了一种高效的数字笔迹数据编码算法IWPHSP(integer wavelet packet based hierarchical set partitioned).该算法通过引入整数小波包变换、层次性集合分裂、重要位组合编码和快速自适应算术编码等方法,无损地压缩了数字笔迹多维数据.实验证明,提出的IWPHSP算法是高效的. |
| 关键词: 数字笔迹多维数据编码 整数小波包变换 层次性集合分裂 快速自适应算术编码 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.60273024, 60033020 (国家自然科学基金); the National Grand Fundamental Research 973 Program of China under Grant No.2002CB312103 (国家重点基础研究发展规划(973)); the Key Innovation Project from Institute of Software, the Chinese Academy of Sciences (中国科学院软件研究所创新基金重大项目) |
|
| An Efficient Digital Ink Multi-Dimension Data Coding Algorithm |
|
LI Jun-Feng,DAI Guo-Zhong
|
| Abstract: |
| An efficient digital ink data coding algorithm IWPHSP (integer wavelet packet based hierarchical set partitioned) is proposed in this paper. The algorithm compresses digital ink multi-dimension data losslessly using three approaches: integer wavelet packet transform, hierarchical set partitioned, significant bits combination code and fast adaptive arithmetic code. The experiments show that the IWPHSP algorithm is efficient. |
| Key words: digital ink multi-dimension data coding integer wavelet packet transform hierarchical set partitioned fast adaptive arithmetic code |
