固定速率量化的拉格朗日公式

R. Gray
{"title":"固定速率量化的拉格朗日公式","authors":"R. Gray","doi":"10.1109/DCC.2005.7","DOIUrl":null,"url":null,"abstract":"A Lagrangian formulation of fixed-rate vector quantization is presented. The formulation provides an alternative version of the classic high-rate quantization approximations for fixed-rate codes of Zador (1966), and Bucklew and Wise (1982) which parallels the Lagrangian results for variable-rate codes and it leads to a variation of the classic Lloyd (1982) algorithm for quantizer design. The approach also leads to a natural Lagrangian formulation combining both common rate constraints of alphabet size and entropy, effectively providing a Lagrangian formulation of memory and entropy constrained vector quantization.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"176 5 1","pages":"261-269"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/DCC.2005.7","citationCount":"4","resultStr":"{\"title\":\"A Lagrangian formulation of fixed-rate quantization\",\"authors\":\"R. Gray\",\"doi\":\"10.1109/DCC.2005.7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Lagrangian formulation of fixed-rate vector quantization is presented. The formulation provides an alternative version of the classic high-rate quantization approximations for fixed-rate codes of Zador (1966), and Bucklew and Wise (1982) which parallels the Lagrangian results for variable-rate codes and it leads to a variation of the classic Lloyd (1982) algorithm for quantizer design. The approach also leads to a natural Lagrangian formulation combining both common rate constraints of alphabet size and entropy, effectively providing a Lagrangian formulation of memory and entropy constrained vector quantization.\",\"PeriodicalId\":91161,\"journal\":{\"name\":\"Proceedings. Data Compression Conference\",\"volume\":\"176 5 1\",\"pages\":\"261-269\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1109/DCC.2005.7\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.2005.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2005.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

给出了固定速率矢量量化的拉格朗日公式。该公式为Zador(1966)和Bucklew和Wise(1982)的固定速率码的经典高速率量化近似提供了另一种版本,它与可变速率码的拉格朗日结果相似,并导致了量化器设计的经典Lloyd(1982)算法的变体。该方法还得到了结合字母表大小和熵的常见速率约束的自然拉格朗日公式,有效地提供了记忆和熵约束向量量化的拉格朗日公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Lagrangian formulation of fixed-rate quantization
A Lagrangian formulation of fixed-rate vector quantization is presented. The formulation provides an alternative version of the classic high-rate quantization approximations for fixed-rate codes of Zador (1966), and Bucklew and Wise (1982) which parallels the Lagrangian results for variable-rate codes and it leads to a variation of the classic Lloyd (1982) algorithm for quantizer design. The approach also leads to a natural Lagrangian formulation combining both common rate constraints of alphabet size and entropy, effectively providing a Lagrangian formulation of memory and entropy constrained vector quantization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Faster Maximal Exact Matches with Lazy LCP Evaluation. Recursive Prefix-Free Parsing for Building Big BWTs. PHONI: Streamed Matching Statistics with Multi-Genome References. Client-Driven Transmission of JPEG2000 Image Sequences Using Motion Compensated Conditional Replenishment GeneComp, a new reference-based compressor for SAM files.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1