Probability estimation in arithmetic and adaptive-Huffman entropy coders
暂无分享,去创建一个
[1] Christodoulos Chamzas,et al. Technical features of the JBIG standard for progressive bi-level image compression , 1992, Signal Process. Image Commun..
[2] Richard Clark Pasco,et al. Source coding algorithms for fast data compression , 1976 .
[3] J. Rissanen,et al. A Double-Adaptive File Compression Algorithm , 1983, IEEE Trans. Commun..
[4] Robert H. Morris,et al. Counting large numbers of events in small registers , 1978, CACM.
[5] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.
[6] Glen G. Langdon,et al. An Overview of the Basic Principles of the Q-Coder Adaptive Binary Arithmetic Coder , 1988, IBM J. Res. Dev..
[7] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[8] Jorma Rissanen,et al. Generalized Kraft Inequality and Arithmetic Coding , 1976, IBM J. Res. Dev..
[9] Frank Thomson Leighton,et al. Estimating a probability using finite memory , 1986, IEEE Trans. Inf. Theory.
[10] Frank Rubin,et al. Arithmetic stream coding using fixed precision registers , 1979, IEEE Trans. Inf. Theory.
[11] Glen G. Langdon,et al. Probabilistic and Q-Coder algorithms for binary source adaptation , 1991, [1991] Proceedings. Data Compression Conference.
[12] M. G. Pelchat,et al. Compression of Black-White Images with Arithmetic Coding , 1981 .
[13] Gregory K. Wallace,et al. The JPEG still picture compression standard , 1992 .