Identification of DCT signs for sub-block coding

H. Kondo, Keiko Yamahara, Jun Liao
{"title":"Identification of DCT signs for sub-block coding","authors":"H. Kondo, Keiko Yamahara, Jun Liao","doi":"10.1109/ISSPA.2001.950207","DOIUrl":null,"url":null,"abstract":"Identification of DCT signs for image coding is presented. In the JPEG DCT coding method the sign of the DCT coefficient is included in the coded signal. Usually 0.1/spl sim/0.2 bit/pixel for the average bit rate is taken for coding these signs. This paper shows these DCT signs can be estimated at the receiver side almost perfectly on the basis of the smoothness cost function, so it is not needed to send this information. The smoothness cost function is the measure of a smooth connection of the sub-block borders. Here as a cost function the absolute squared Laplacian sum is used. And the technique to determine the signs is a genetic algorithm. It gives us an effective solution quickly. The simulation results show that the reconstructed images have adequate picture quality.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2001.950207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Identification of DCT signs for image coding is presented. In the JPEG DCT coding method the sign of the DCT coefficient is included in the coded signal. Usually 0.1/spl sim/0.2 bit/pixel for the average bit rate is taken for coding these signs. This paper shows these DCT signs can be estimated at the receiver side almost perfectly on the basis of the smoothness cost function, so it is not needed to send this information. The smoothness cost function is the measure of a smooth connection of the sub-block borders. Here as a cost function the absolute squared Laplacian sum is used. And the technique to determine the signs is a genetic algorithm. It gives us an effective solution quickly. The simulation results show that the reconstructed images have adequate picture quality.
子块编码的DCT符号识别
提出了图像编码中DCT符号的识别方法。在JPEG DCT编码方法中,编码信号中包含了DCT系数的符号。通常采用0.1/spl sim/0.2比特/像素作为对这些符号进行编码的平均比特率。本文表明,在平滑代价函数的基础上,这些DCT符号可以在接收端几乎完美地估计出来,因此不需要发送该信息。平滑代价函数是子块边界平滑连接的度量。这里使用拉普拉斯和的绝对平方作为代价函数。确定这些符号的技术是一种遗传算法。它很快给了我们一个有效的解决方案。仿真结果表明,重构图像具有较好的图像质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信