匹配跟踪分解中一种高效的Lloyd-Max量化器

LISANDRO LOVISOLO, Eduardo A. B. da Silva, P. Diniz
{"title":"匹配跟踪分解中一种高效的Lloyd-Max量化器","authors":"LISANDRO LOVISOLO, Eduardo A. B. da Silva, P. Diniz","doi":"10.1109/ITS.2006.4433248","DOIUrl":null,"url":null,"abstract":"Several applications are using the matching pursuit algorithm for signal and video compression. The matching pursuit approximates signals iteratively using linear combinations of pre-defined atoms of a dictionary. In compression applications matching pursuits coefficients, which multiply the atoms in the linear combination, need to be quantized. The Lloyd-Max quantizer is known to be the best quantizer for a given source. However, to design a Lloyd-Max quantizer the statistics of the source need to be known. The statistics of matching pursuit coefficients are difficult to model. In this paper, starting from the observation that the statistics of the angles between the residues and the atoms present little variation along matching pursuit iterations, we propose to use these statistics to model the ones of matching pursuit coefficients. This permits the design of Lloyd-Max quantizers for matching pursuit coefficients. The Lloyd-Max quantize is compared to a state-of-the-art off-loop matching pursuit quantization scheme. Results show that the proposed scheme has good rate-distortion performance, specially at low rates.","PeriodicalId":271294,"journal":{"name":"2006 International Telecommunications Symposium","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient Lloyd-Max quantizer for Matching Pursuit decompositions\",\"authors\":\"LISANDRO LOVISOLO, Eduardo A. B. da Silva, P. Diniz\",\"doi\":\"10.1109/ITS.2006.4433248\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several applications are using the matching pursuit algorithm for signal and video compression. The matching pursuit approximates signals iteratively using linear combinations of pre-defined atoms of a dictionary. In compression applications matching pursuits coefficients, which multiply the atoms in the linear combination, need to be quantized. The Lloyd-Max quantizer is known to be the best quantizer for a given source. However, to design a Lloyd-Max quantizer the statistics of the source need to be known. The statistics of matching pursuit coefficients are difficult to model. In this paper, starting from the observation that the statistics of the angles between the residues and the atoms present little variation along matching pursuit iterations, we propose to use these statistics to model the ones of matching pursuit coefficients. This permits the design of Lloyd-Max quantizers for matching pursuit coefficients. The Lloyd-Max quantize is compared to a state-of-the-art off-loop matching pursuit quantization scheme. Results show that the proposed scheme has good rate-distortion performance, specially at low rates.\",\"PeriodicalId\":271294,\"journal\":{\"name\":\"2006 International Telecommunications Symposium\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Telecommunications Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITS.2006.4433248\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.2006.4433248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

一些应用正在使用匹配追踪算法进行信号和视频压缩。匹配追踪使用字典中预定义原子的线性组合迭代地逼近信号。在压缩应用中,匹配寻迹系数需要量子化,因为它使线性组合中的原子相乘。劳埃德-马克斯量化器被认为是给定源的最佳量化器。然而,为了设计一个劳埃德-马克斯量化器,需要知道源的统计量。匹配追踪系数的统计很难建模。本文从观察到残基与原子之间角度的统计量在匹配追踪迭代过程中变化不大的情况出发,提出用这些统计量来模拟匹配追踪系数的统计量。这允许设计Lloyd-Max量化器来匹配追踪系数。Lloyd-Max量化与最先进的离环匹配跟踪量化方案进行了比较。结果表明,该方案具有良好的率失真性能,特别是在低率下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient Lloyd-Max quantizer for Matching Pursuit decompositions
Several applications are using the matching pursuit algorithm for signal and video compression. The matching pursuit approximates signals iteratively using linear combinations of pre-defined atoms of a dictionary. In compression applications matching pursuits coefficients, which multiply the atoms in the linear combination, need to be quantized. The Lloyd-Max quantizer is known to be the best quantizer for a given source. However, to design a Lloyd-Max quantizer the statistics of the source need to be known. The statistics of matching pursuit coefficients are difficult to model. In this paper, starting from the observation that the statistics of the angles between the residues and the atoms present little variation along matching pursuit iterations, we propose to use these statistics to model the ones of matching pursuit coefficients. This permits the design of Lloyd-Max quantizers for matching pursuit coefficients. The Lloyd-Max quantize is compared to a state-of-the-art off-loop matching pursuit quantization scheme. Results show that the proposed scheme has good rate-distortion performance, specially at low rates.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信