By Topic

Progressive Coding of a Gaussian Source Using Matching Pursuit

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
$33 $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

2 Author(s)
Shoa, A. ; McMaster Univ., Hamilton ; Shirani, S.

In this paper, the application of matching pursuit (MP) in progressive coding of memoryless Gaussian sources is studied. In addition, a detailed analysis of the rate-distortion performance of our proposed MP encoder is presented, and the distortion of the MP encoder is derived in terms of dictionary size and number of quantization levels and the optimum parameters are calculated. Our analysis is based on a probabilistic model for matching pursuit residual vectors. Our simulation results verify the accuracy of our analysis and show that matching pursuit can produce an embedded bitstream with comparable quality to existing quantizers. The MP encoder outperforms quantizers that are capable of producing embedded bitstreams.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 2 )