Computer Science – Information Theory
Scientific paper
2009-09-09
Computer Science
Information Theory
29 pages, 5 figures; detailed added to proof of Theorem 4.3 and a few minor corrections
Scientific paper
10.1016/j.acha.2010.10.003
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, quadratic programming, and recursive orthogonal projection are derived. Implementations of the linear and quadratic programming algorithms for uniform and Gaussian sources show performance improvements over entropy-constrained scalar quantization for certain combinations of vector dimension and coding rate. Monte Carlo evaluation of the recursive algorithm shows that mean-squared error (MSE) decays as 1/M^4 for an M-element frame, which is consistent with previous results on optimal decay of MSE. 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.
Goyal Vivek K.
Nguyen H. Q.
Varshney Lav R.
No associations
LandOfFree
Frame Permutation Quantization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Frame Permutation Quantization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Frame Permutation Quantization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-385048