arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0609123cs.ITmath.IT
收藏

多描述格型矢量量化器的优化设计

Optimal Design of Multiple Description Lattice Vector Quantizers

Xiang Huang, Xiaolin Wu

摘要:

在多描述格型矢量量化器(MDLVQ)的设计中,索引分配起着关键的作用。此外,在给定所有边描述的总熵率Rt和描述丢失概率p的情况下,还需要选择中心格的Voronoi单元尺寸v、子格索引N和边描述的数目K,以使期望的MDLVQ失真最小化。本文提出了一种线性时间MDLVQ索引分配算法,适用于任意维中任意K >= 2个平衡描述,基于所谓的K分数格的新构造。该算法本质上是贪婪的,但被证明是渐近(N ->无穷)最优的任何K >= 2平衡描述在任何维度,给定Rt和p。当K > 2时,提出了一种局部调整算法来增强贪婪索引分配,并证明了该算法对有限N是最优的。我们的算法研究也导致更好地了解v,N和K的最佳MDLVQ设计。当K = 2时,我们首次导出了p,Rt,N中最优MDLVQ的期望失真的非渐近封闭形式表达式。对于K > 2,我们收紧了当前期望失真的渐近公式,将N和K的最佳值与p和Rt更精确地联系起来。

英文摘要:

In the design of multiple description lattice vector quantizers (MDLVQ), index assignment plays a critical role. In addition, one also needs to choose the Voronoi cell size of the central lattice v, the sublattice index N, and the number of side descriptions K to minimize the expected MDLVQ distortion, given the total entropy rate of all side descriptions Rt and description loss probability p. In this paper we propose a linear-time MDLVQ index assignment algorithm for any K >= 2 balanced descriptions in any dimensions, based on a new construction of so-called K-fraction lattice. The algorithm is greedy in nature but is proven to be asymptotically (N -> infinity) optimal for any K >= 2 balanced descriptions in any dimensions, given Rt and p. The result is stronger when K = 2: the optimality holds for finite N as well, under some mild conditions. For K > 2, a local adjustment algorithm is developed to augment the greedy index assignment, and conjectured to be optimal for finite N. Our algorithmic study also leads to better understanding of v, N and K in optimal MDLVQ design. For K = 2 we derive, for the first time, a non-asymptotical closed form expression of the expected distortion of optimal MDLVQ in p, Rt, N. For K > 2, we tighten the current asymptotic formula of the expected distortion, relating the optimal values of N and K to p and Rt more precisely.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑