Lossless compression of VQ indexes using search-order and correction codes

En-Cheng Liu, T.-C. Wang
{"title":"Lossless compression of VQ indexes using search-order and correction codes","authors":"En-Cheng Liu, T.-C. Wang","doi":"10.1109/SIPS.1998.715783","DOIUrl":null,"url":null,"abstract":"In a fixed-rate vector quantization system, an image is divided into smaller blocks, and each block is usually independently encoded by an index of the same length that points to the closest codevector in the codebook. Recently, an algorithm called search-order coding has been proposed to further reduce the bit rate by encoding the indexes but without introducing any extra encoding distortion. We present an improved algorithm that extends the idea of the search-order coding algorithm by encoding the indexes pair by pair. In addition, the correction codes are also adopted to improve the bit rate further. Simulation results indicate that our algorithm is able to achieve a bit rate up to 7% lower than the search-order coding algorithm.","PeriodicalId":151031,"journal":{"name":"1998 IEEE Workshop on Signal Processing Systems. SIPS 98. Design and Implementation (Cat. No.98TH8374)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 IEEE Workshop on Signal Processing Systems. SIPS 98. Design and Implementation (Cat. No.98TH8374)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIPS.1998.715783","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In a fixed-rate vector quantization system, an image is divided into smaller blocks, and each block is usually independently encoded by an index of the same length that points to the closest codevector in the codebook. Recently, an algorithm called search-order coding has been proposed to further reduce the bit rate by encoding the indexes but without introducing any extra encoding distortion. We present an improved algorithm that extends the idea of the search-order coding algorithm by encoding the indexes pair by pair. In addition, the correction codes are also adopted to improve the bit rate further. Simulation results indicate that our algorithm is able to achieve a bit rate up to 7% lower than the search-order coding algorithm.
使用搜索顺序和纠错码的VQ索引无损压缩
在固定速率矢量量化系统中,图像被分成更小的块,每个块通常由指向码本中最近的编矢量的相同长度的索引独立编码。最近,一种被称为搜索顺序编码的算法被提出,通过对索引进行编码来进一步降低比特率,但不会引入任何额外的编码失真。提出了一种改进算法,扩展了搜索顺序编码算法的思想,对索引进行成对编码。此外,为了进一步提高比特率,还采用了纠错码。仿真结果表明,该算法可以实现比搜索顺序编码算法低7%的比特率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信