By Topic

Optimal transform coding in the presence of quantization noise

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

2 Author(s)
Diamantaras, K.I. ; Dept. of Inf., Technol. Educ. Inst. of Thessaloniki, Sindos, Greece ; Strintzis, M.G.

The optimal linear Karhunen-Loeve transform (KLT) attains the minimum reconstruction error for a fixed number of transform coefficients assuming that these coefficients do not contain noise. In any real coding system, however, the representation of the coefficients using a finite number of bits requires the presence of quantizers. We formulate the optimal linear transform using a data model that incorporates the quantization noise. Our solution does not correspond to an orthogonal transform and in fact, it achieves a smaller mean squared error (MSE) compared to the KLT, in the noisy case. Like the KLT, our solution depends on the statistics of the input signal, but it also depends on the bit-rate used for each coefficient. Especially for images, based on our optimality theory, we propose a simple modification of the discrete cosine transform (DCT). Our coding experiments show a peak signal-to noise ratio (SNR) performance improvement over JPEG of the order of 0.2 dB with an overhead less than 0.01 b/pixel

Published in:

Image Processing, IEEE Transactions on  (Volume:8 ,  Issue: 11 )