Study on a Basic Concept of Highly Efficient Coding Model for Super High Definition Images

超高清图像高效编码模型基本概念研究

• 批准号: 09650395
• 负责人: KATO Shigeo
• 金额: $ 2.05万
• 依托单位: Utsunomiya University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 1997
• 资助国家: 日本
• 起止时间: 1997 至 1998
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-09650395/
• 关键词: Super High Definition Images; Image Coding; Source Coding; Lossless Coding; Partially Decodable Variable Length Code; データ圧縮; 高能率符号化; 情報保存型符号化; スケーラブル符号化; 段階的伝送; 部分復号可能

Images of high resolution and pixel accuracy are coming into wide use with the improvement of hardware performance and the increase in multimedia contents. It is difficult to represent a large size image entirely, such as a super high definition (SHD) image, on an ordinary size monitor with the original resolution. In this case, a reduced image is displayed at first to let user select a region of interest where he hopes to see the detail. Then image data of the selected area are extracted from code stream. Hence, it is highly desired to introduce some partially decodable codes with which any parts of the code stream can be decoded independently. In order to realize such scalability, we divide or decompose an image into blocks or tiles of proper size, and encode each block respectively by DPCM method or orthogonal transform. However, it is difficult to detect the start position of each block in code sequence if variable length code is used in entropy coding. In this study, we propose a new loss less coding method enable to display the region of interest of the image without decoding from the start point of the code sequence. We also propose apartially decodable variable length code named modified Golomb-Rice code.

高分辨率和像素精度的图像正在广泛使用，随着硬件性能的改善和多媒体内容的增加。在具有原始分辨率的普通尺寸监视器上，很难完全代表大尺寸图像，例如超高清（SHD）图像。在这种情况下，首先显示简化的图像，以便用户选择一个感兴趣的区域，他希望在其中查看细节。然后从代码流中提取所选区域的图像数据。因此，非常希望引入一些可以独立解码的代码流的任何部分。为了实现这种可伸缩性，我们将图像分配或分解为适当大小的块或瓷砖，并分别通过DPCM方法或正交变换对每个块进行编码。但是，如果在熵编码中使用了可变长度代码，则很难在代码序列中检测每个块的启动位置。在这项研究中，我们提出了一种新的损失较少的编码方法，可以显示图像的兴趣区域，而无需从代码序列的起点解码。我们还提出了可完全解码的可变长度代码，名为“修改后的Golomb-Rice代码”。

项目成果

Madoka Hasegawa, Shigeo Kato and Yoshifumi Yamada: "A Consideration on Generation of a Compact Code for Extended Binary Memoryless Sources with Low Entropy" Trans.of IEICE A. Vol.J80-A No.9. 1483-1489 (1997)

Madoka Hasekawa、Shigeo Kato 和 Yoshifumi Yamada：“对低熵扩展二进制无记忆源的紧凑代码生成的考虑”Trans.of IEICE A. Vol.J80-A No.9。

Hidefumi Osawa, Kaoru Suzuki, Shigeo Kato and Yasuhiko Yasuda: "Proposal of a Fast Multialphabet Dynamic Arthmetic Coding" Trans.of IEICE B-I. vol.J81-B-I,No.11. 634-641 (1998)

Hidefumi Osawa、Kaoru Suzuki、Shigeo Kato 和 Yasuhiko Yasuda：“快速多字母动态算术编码的提议”Trans.of IEICE B-I。

長谷川まどか,加藤茂夫,山田芳文: "低エントロピー2値無記憶拡大情報源に対するコンパクト符号講成法についての一考察" 電子情報通信学会論文誌A. vol.J80-A,No.9. 1483-1489 (1997)

Madoka Hasekawa、Shigeo Kato、Yoshifumi Yamada：“低熵二进制无记忆扩展信息源的紧凑代码构造方法的研究” IEICE Transactions A. vol.J80-A，No.9 (1997)。

K.Suzuki, S.Kato and J.Miyamichi: "Lossless Compression of Multi-Level Images by Dynamic Multi-Alphabet Arithmetic Coding" Proceedings of International Technical Conference on Circuits/Systems, Computers and Communications. TB1.4. 193-196 (1998)

K.Suzuki、S.Kato 和 J.Miyamichi：“动态多字母算术编码对多级图像的无损压缩”电路/系统、计算机和通信国际技术会议论文集。

M.Hasegawa, S.Kato and Y.Yamada: "Proposal of a Partially Decodable Golomb-Rice Code for Scalable Compression of Super High Definition Images" Proceedings of International Technical Conference on Circuits/Systems, Computers and Communications. TC1.1. 213-

M.Hasekawa、S.Kato 和 Y.Yamada：“用于超高清图像可扩展压缩的部分可解码 Golomb-Rice 代码的提案”电路/系统、计算机和通信国际技术会议论文集。