On the performance of vector quantizers empirically designed from dependent sources

A. Zeevi
{"title":"On the performance of vector quantizers empirically designed from dependent sources","authors":"A. Zeevi","doi":"10.1109/DCC.1998.672133","DOIUrl":null,"url":null,"abstract":"Suppose we are given n real valued samples Z/sub 1/, Z/sub 2/, ..., Z/sub n/ from a stationary source P. We consider the following question. For a compression scheme that uses blocks of length k, what is the minimal distortion (for encoding the true source P) induced by a vector quantizer of fixed rate R, designed from the training sequence. For a certain class of dependent sources, we derive conditions ensuring that the empirically designed quantizer performs as well (on the average) as the optimal quantizer, for almost every training sequence emitted by the source. In particular, we observe that for a code rate R, the optimal way to choose the dimension of the quantizer is k/sub n/=[(1-/spl delta/)R/sup -1/ log n]. The problem of empirical design of a vector quantizer of fixed dimension k based on a vector valued training sequence X/sub 1/, X/sub 2/, ..., X/sub n/ is also considered. For a class of dependent sources, it is shown that the mean squared error (MSE) of the empirically designed quantizer w.r.t the true source distribution converges to the minimum possible MSE at a rate of O(/spl radic/(log n/n)), for almost every training sequence emitted by the source. In addition, the expected value of the distortion redundancy-the difference between the MSEs of the quantizers-converges to zero for a sequence of increasing block lengths k, if we have at our disposal corresponding training sequences whose length grows as n=2/sup (R+/spl delta/)k/. Some of the derivations extend results in empirical quantizer design using an i.i.d. Training sequence, obtained by Linder et al. (see IEEE Trans. on Info. Theory, vol.40, p.1728-40, 1994) and Merhav and Ziv (see IEEE Trans. on Info. Theory, vol.43, p.1112-23, 1997). Proof of the techniques rely on the results in the theory of empirical processes, indexed by VC function classes.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1998.672133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Suppose we are given n real valued samples Z/sub 1/, Z/sub 2/, ..., Z/sub n/ from a stationary source P. We consider the following question. For a compression scheme that uses blocks of length k, what is the minimal distortion (for encoding the true source P) induced by a vector quantizer of fixed rate R, designed from the training sequence. For a certain class of dependent sources, we derive conditions ensuring that the empirically designed quantizer performs as well (on the average) as the optimal quantizer, for almost every training sequence emitted by the source. In particular, we observe that for a code rate R, the optimal way to choose the dimension of the quantizer is k/sub n/=[(1-/spl delta/)R/sup -1/ log n]. The problem of empirical design of a vector quantizer of fixed dimension k based on a vector valued training sequence X/sub 1/, X/sub 2/, ..., X/sub n/ is also considered. For a class of dependent sources, it is shown that the mean squared error (MSE) of the empirically designed quantizer w.r.t the true source distribution converges to the minimum possible MSE at a rate of O(/spl radic/(log n/n)), for almost every training sequence emitted by the source. In addition, the expected value of the distortion redundancy-the difference between the MSEs of the quantizers-converges to zero for a sequence of increasing block lengths k, if we have at our disposal corresponding training sequences whose length grows as n=2/sup (R+/spl delta/)k/. Some of the derivations extend results in empirical quantizer design using an i.i.d. Training sequence, obtained by Linder et al. (see IEEE Trans. on Info. Theory, vol.40, p.1728-40, 1994) and Merhav and Ziv (see IEEE Trans. on Info. Theory, vol.43, p.1112-23, 1997). Proof of the techniques rely on the results in the theory of empirical processes, indexed by VC function classes.
从依赖源经验设计的矢量量化器的性能
假设给定n个实值样本Z/下标1/,Z/下标2/,…, Z/下标n/来自平稳源p,我们考虑以下问题。对于使用长度为k的块的压缩方案,由从训练序列设计的固定速率R的矢量量化器引起的最小失真(用于编码真实源P)是什么?对于某一类依赖源,我们推导出条件,确保经验设计的量化器对于源发出的几乎每个训练序列都能表现得与最佳量化器一样好(平均而言)。特别是,我们观察到,对于码率R,选择量化器维数的最佳方法是k/sub n/=[(1-/spl delta/)R/sup -1/ log n]。基于向量值训练序列X/sub 1/, X/sub 2/,…的固定维k矢量量化器的经验设计问题,也考虑了X/下标n/。对于一类依赖源,表明经验设计的量化器w.r.t真实源分布的均方误差(MSE)以0 (/spl径向/(log n/n))的速率收敛到最小可能的MSE,对于源发出的几乎每个训练序列。此外,如果我们有相应的训练序列,其长度增长为n=2/sup (R+/spl δ /)k/,那么对于块长度增加k的序列,失真冗余的期望值-量化量的mse之间的差值收敛于零。一些推导扩展了经验量化器设计的结果,使用了由Linder等人获得的i.i.d训练序列。在信息。《理论》,vol.40, p.1728- 40,1994)和Merhav and Ziv(见IEEE Trans. 1994)。在信息。《理论》,第43卷,第1112-23页,1997)。技术的证明依赖于经验过程理论的结果,由VC函数类索引。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信