By Topic

Lossless quantization of Hadamard transform coefficients

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

4 Author(s)
W. Philips ; Dept. of Telecommun. & Inf. Processing, Ghent Univ., Belgium ; K. Denecker ; P. de Neve ; S. van Assche

This paper shows that an n×1 integer vector can be exactly recovered from its Hadamard transform coefficients, even when 0.5n log 2(n) of the (less significant) bits of these coefficients are removed. The paper introduces a fast “lossless” dequantization algorithm for this purpose. To investigate the usefulness of the procedure in data compression, the paper investigates an embedded block image coding technique called the “LHAD” based on the algorithm. The results show that lossless compression ratios close to the state of the art can be achieved, but that techniques such as CALIC and S+P still perform better

Published in:

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