| Project/Area Number |
14550351
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
情報通信工学
|
|---|
| Research Institution | The University of Electro-Communications |
|---|
Principal Investigator |
KOBAYASHI Kingo The University of Electro-Communications, Faculty of Electro-Communications, Professor, 電気通信学部, 教授 (20029515)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YAMAGUCHI Kazuhiko The University of Electro-Communications, Faculty of Electro-Communications, Associate Professor, 電気通信学部, 助教授 (60220258)
KURIHARA Masazumi The University of Electro-Communications, Faculty of Electro-Communications, Research Associate, 電気通信学部, 助手 (90242346)
|
|---|
| Project Period (FY) |
2002 – 2004
|
| Project Status |
Completed (Fiscal Year 2004)
|
| Budget Amount *help |
¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2004: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2003: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 2002: ¥1,500,000 (Direct Cost: ¥1,500,000)
|
|---|
| Keywords | universal code / discrete information structure / binary tree / vector k-ary tree / Young tableaux / low density parity check code / watermark / steganography / k-分木 / 算術符号 / 情報源変換 / 落し戸通信路 / κ分木 / 一般化カタラン数 / パーコレーション / エントロピー / Sum-Product復号 / ベルヌイ分岐過程 / k分木 / 分布変換機 / 落し戸通信 |
|---|
| Research Abstract |
The theme of this research project is on a study of universal coding of enumerative discrete information structures, such as integers, trees, graphs and Young tableaux that frequently appear in the computer science, as well as finite discrete data representing letters of text, sampled quantized voice data, and data of brightness and chroma in pictures.
We have completed the analysis of coding of binary trees, and extended our method to k-ary trees and vector k-ary trees, the use of which should be powerful for universal coding. Furthermore, we moved a step towards the study of Young tableaux containing the class of trees as a subset of them. We can correspond a binary tree to a 2 x n rectangular Young tableaux. But we cannot correspond k-ary tree and vector k-ary tree to a standard Young tableaux in general. However, we show that by an extended Young tableaux defined by a poset in the integer lattice, it is possible to represent them. These results suggest attractive idea on constructing new code for general trees. Furthermore, we got many aspects on the meaning of Hook formula and the bumping algorithm by generalizing the standard Young tableaux to multi-dimensional tableaux. We presented these results at several international conference(IEEE ISIT 2002,2004,ISITA2004 at Parma, Conferences on General information transfer and combinatorics at Bielefeld university).
As well as the above theoretical study, we researched experimentally the performance of watermark and steganography. In the study of watermark for copyright protection and steganography that is considered as a generalized version of hiding information, we performed experiments with respect to the fundamental efficiencies of watermark on resistance against coalition, and steganography using frequency region by considering the structure of relevant data.
|
