Frame permutation quantization
Name
Goyal_Frame permutation.pdf
Size
2.89 MB
Format
Adobe PDF
Checksum (MD5)
d2485612162fe385e0dea1e2ebaa28ea
Author(s)
Nguyen, Ha Q.
Goyal, Vivek K.
Varshney, Lav Raj
Date Issued
March 2010
Journal
Proceedings of the 44th Annual Conference on Information Sciences and Systems (CISS), 2010
Publisher
Institute of Electrical and Electronics Engineers
Citation
Nguyen, Ha Q., Vivek K Goyal, and Lav R. Varshney. “Frame Permutation Quantization.” Proceedings of the 44th Annual Conference on Information Sciences and Systems (CISS), 2010, IEEE, 2010. 1–6. Web.© 2010 IEEE.
Version
Final published version
Abstract
Frame permutation quantization (FPQ) is a new vector quantization technique using finite frames. In FPQ, a vector is encoded using a permutation source code to quantize its frame expansion. This means that the encoding is a partial ordering of the frame expansion coefficients. Compared to ordinary permutation source coding, FPQ produces a greater number of possible quantization rates and a higher maximum rate. Various representations for the partitions induced by FPQ are presented and reconstruction algorithms based on linear programming and quadratic programming are derived. Reconstruction using the canonical dual frame is also studied, and several results relate properties of the analysis frame to whether linear reconstruction techniques provide consistent reconstructions. Simulations for Gaussian sources show performance improvements over entropy-constrained scalar quantization for certain combinations of vector dimension and coding rate.
MIT Department
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CISS.2010.5464814
