A Robust Ordering Scheme for Entropy Coding in Gray-Level Image

N. Kim, Kang-Soo You, Hoon-Sung Kwak
{"title":"A Robust Ordering Scheme for Entropy Coding in Gray-Level Image","authors":"N. Kim, Kang-Soo You, Hoon-Sung Kwak","doi":"10.1109/FGCNS.2008.31","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a robust ordering scheme for entropy coding in gray-level image. The issue is to reduce additional information needed when bitstream is transmitted. The proposed scheme uses the ordering method of co-occurrence count about gray-levels in neighboring pixels. That is, gray-levels are substituted by their ordering numbers without additional information. From the results of computer simulation, it is verified that the proposed scheme could be reduced the compression bit rate by up to 44.12%, 18.41% comparing to the entropy coding and conventional ordering scheme respectively. So our scheme can be successfully applied to the application areas that require of losslessness and data compaction.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Second International Conference on Future Generation Communication and Networking Symposia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FGCNS.2008.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a robust ordering scheme for entropy coding in gray-level image. The issue is to reduce additional information needed when bitstream is transmitted. The proposed scheme uses the ordering method of co-occurrence count about gray-levels in neighboring pixels. That is, gray-levels are substituted by their ordering numbers without additional information. From the results of computer simulation, it is verified that the proposed scheme could be reduced the compression bit rate by up to 44.12%, 18.41% comparing to the entropy coding and conventional ordering scheme respectively. So our scheme can be successfully applied to the application areas that require of losslessness and data compaction.
灰度图像熵编码的鲁棒排序方案
本文提出了一种用于灰度图像熵编码的鲁棒排序方案。问题是要减少比特流传输时所需的额外信息。该方案采用相邻像素灰度级共现计数排序方法。也就是说,灰度级别由它们的排序号代替,而不需要附加信息。计算机仿真结果表明,与熵编码和常规排序方案相比,该方案的压缩比特率可分别降低44.12%和18.41%。因此,该方案可以成功地应用于对数据无损和压缩有要求的应用领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信