DATA-COMPRESSION USING DYNAMIC MARKOV MODELING

被引:98
作者
CORMACK, GV
HORSPOOL, RNS
机构
[1] UNIV VICTORIA,DEPT COMP SCI,POB 1700,VICTORIA V8W 2Y2,BC,CANADA
[2] UNIV WATERLOO,DEPT COMP SCI,WATERLOO N2L 3G1,ONTARIO,CANADA
关键词
INFORMATION THEORY - Data Compression - PROBABILITY - Random Processes;
D O I
10.1093/comjnl/30.6.541
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A method of dynamically constructing Markov chain models that describe the characteristics of binary messages is developed. Such models can be used to predict future message characters and can therefore be used as a basis for data compression. To this end, the Markov modelling technique is combined with Guazzo's arithmetic coding scheme to produce a powerful method of data compression. The method has the advantage of being adaptive: messages may be encoded or decoded with just a single pass through the data. Experimental results reported here indicate that the Markov modelling approach generally achieves much better data compression than that observed with competing methods on typical computer data.
引用
收藏
页码:541 / 550
页数:10
相关论文
共 14 条
  • [1] Cleary J. G., 1984, IEEE T COMMUNICATION, VCOM-32
  • [2] CORMACK GV, 1984, INFORMATION PROCESSI, V18
  • [3] CORMACK GV, 1985, COMMUNICATIONS ACM, V28
  • [4] GALLAGER R, 1978, IEEE T INFORMATION T, V24
  • [5] GUAZZO M, 1980, IEEE T INFORMATION T, V26
  • [6] HORSPOOL RN, 1986, 19TH P HAW INT C SYS
  • [7] Huffman David, 1952, P IRE, V40
  • [8] MCMASTER CL, 1985, ON LINE MANUAL ENTRY
  • [9] RISSANEN J, 1979, IBM J RES DEV, V23
  • [10] SEVERANCE DG, 1983, INFORMATION SYSTEMS, V8