- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | An Efficient Algorithm for the Bayes Codes using an Unlimited Depth Context Tree (in Japanese) |
|---|---|
| Authors | Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2008 |
| Format | International Conference |
| Category | Source coding |
| Jounal Name | 2008 SIP (IASTED Signal and Image Processing) |
| Jounal Page | Hawaii, USA |
| Published Year | 2008 |
| Published Month | 8 |
| Abstract （English） |
Recently, distortionless data compression codes have been used for not only text sources but also image sources. The Bayes code is one of the optimal distortionless universal codes whose conversion rate to the entropy of a source achieves theoretical lower bound. The Bayes code on con text tree models is known as a useful data compression code for text les. However the space complexity of the Bayes coding algorithm is impractical for image sources. In this paper, we propose an efcient Bayes coding algorithm us ing a new unlimited depth context tree. The space complex ity of the proposed algorithm is linear order of the source sequence length. Moreover, the asymptotic code length of the Bayes coding algorithm using the unlimited depth con text tree is investigated. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
Involved Papers
- Hierarchical Multi-label Classification on Statistical Decision Theory (in Japanese)
- A Consideration on Minimum Storage Regenerating Codes for Functions (in Japanese)
- A Note on the Inference Algorithm on the Factor Graph based on the Linear Programming (in Japanese)
- Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel (in Japanese)
- A Note on the Fixed-Length Source Coding Theorems for Sources with Side Information (in Japanese)
