| タイトル | An Efficient Algorithm for the Bayes Codes using an Unlimited Depth Context Tree |
|---|---|
| 著者 | 松嶋敏泰 、平澤茂一 |
| 年度 | 2008 |
| 形式 | 国際学会 |
| 分野 | 情報源符号化 |
| 掲載雑誌名 | 2008 SIP (IASTED Signal and Image Processing) |
| 掲載号・ページ | Hawaii, USA |
| 掲載年 | 2008 |
| 掲載月 | 8 |
| アブスト （日本語） |
学会名：The Tenth IASTED International Conference on Signal and Image Processing 日程：August 18 – 20, 2008 場所：Kailua-Kona, Hawaii, USA Proc. のページ番号不明 |
| アブスト （英語） |
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. |
| 備考 （日本語） |
1 |
| 備考 （英語） |
1 |
| 論文原稿 | |
| 発表資料 |
