Context Weighting Based on the Shortest Code Length

Article Preview

Abstract:

In this paper, the optimization of context weighting coefficients are studied and the objective of the optimization is to find a group of weighing coefficients, such that the code length ofsource symbols occurred before the current symbol can be minimized. Multivariant optimization algorithm is used to find the solution of this multimodal optimization problem. With this context weighting algorithm, the compression efficiency is improved.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 1030-1032)

Pages:

1688-1691

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Rissanen J. A universal data compression system[J]. IEEE Transactions on information theory, 1983, 29(5): 656-664.

DOI: 10.1109/tit.1983.1056741

Google Scholar

[2] Willems F M J, Shtarkov Y M, Tjalkens T J. The context-tree weighting method: Basic properties[J]. Information Theory, IEEE Transactions on, 1995, 41(3): 653-664.

DOI: 10.1109/18.382012

Google Scholar

[3] Mahoney M V. Adaptive weighing of context models for lossless data compression[J]. (2005).

Google Scholar

[4] Cao M D, Dix T I, Allison L, et al. A simple statistical algorithm for biological sequence compression[C]/Data Compression Conference, 2007. DCC'07. IEEE, 2007: 43-52.

DOI: 10.1109/dcc.2007.7

Google Scholar

[5] Pinho A J, Pratas D, Ferreira P J S G. Bacteria DNA sequence compression using a mixture of finite-context models[C]/Statistical Signal Processing Workshop (SSP), 2011 IEEE. IEEE, 2011: 125-128.

DOI: 10.1109/ssp.2011.5967637

Google Scholar

[6] Changxing Gou; Shi, Xin Ling; Li, Tian SongICMEME,A novel Multivariant Optimization Algorithm for Multimodal Optimization, ICMEME, 2013: 458-464.

Google Scholar