By Topic

Finding sparse representation of quantized frame coefficients using 0-1 integer programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ryen, Tom ; Dept. of Electr. & Comput. Eng., Stavanger Univ. Coll., Norway ; Aase, S.O. ; Husoy, J.H.

The use of overcomplete dictionaries, or frames, has received increased attention in low-bit-rate compression. Several vector selection algorithms, such as Matching Pursuit, Orthogonal Matching Pursuit and FOCUSS have been developed to get sparse representations of signals. In these algorithms, continuous valued coefficients are found and subsequently quantized. The latter part can cause unwanted effects on the quality of the reconstructed signal. We propose an algorithm that merges the selection and quantization procedures by using 0-1 integer programming. The object is to minimize the distortion measured by the l 1-norm, subject to a bound on the number of “ones” in a binary representation of the frame coefficients. This bound is an indirect measure of the bit rate. Our new algorithm finds the globally optimal solution based on the abovementioned criteria

Published in:

Image and Signal Processing and Analysis, 2001. ISPA 2001. Proceedings of the 2nd International Symposium on

Date of Conference: