Nearly Optimal Vector Quantization via Linear Programming
Published in Papers/Documentation, Quantization
This paper by Jyh-Han Lin and Jeff Vitter outlines new VQ algorithms based on linear programming. According to the abstract, the algorithm is the first known polynomial-time codebook design algorithm.
http://www.cs.duke.edu/~jsv/Papers/catalog/node67.html
Posted in April 7th, 2002
No User Commented In " Nearly Optimal Vector Quantization via Linear Programming "
Subscribes to this post Comment RSS or TrackBack URL
