提出了一种高效的数字笔迹数据编码算法IWPHSP(integer wavelet packet based hierarchical set partitioned).该算法通过引入整数小波包变换、层次性集合分裂、重要位组合编码和快速自适应算术编码等方法,无损地压缩了数字笔迹多维数据.实验证明,提出的IWPHSP算法是高效的.
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.