Frame permutation quantization

Ha Q. Nguyen, Vivek K. Goyal, Lav R. Varshney

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication2010 44th Annual Conference on Information Sciences and Systems, CISS 2010
DOIs
StatePublished - 2010
Externally publishedYes
Event44th Annual Conference on Information Sciences and Systems, CISS 2010 - Princeton, NJ, United States
Duration: Mar 17 2010Mar 19 2010

Publication series

Name2010 44th Annual Conference on Information Sciences and Systems, CISS 2010

Other

Other44th Annual Conference on Information Sciences and Systems, CISS 2010
CountryUnited States
CityPrinceton, NJ
Period3/17/103/19/10

ASJC Scopus subject areas

  • Information Systems
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Frame permutation quantization'. Together they form a unique fingerprint.

Cite this