Lossless quantization of Hadamard transform coefficients
This paper shows that an n/spl times/1 integer vector can be exactly recovered from its Hadamard transform coefficients, even when 0.5n log/sub 2/(n) of the (less significant) bits of these coefficients are removed. The paper introduces a fast "lossless" dequantization algorithm for this p...
Saved in:
Published in | IEEE transactions on image processing Vol. 9; no. 11; pp. 1995 - 1999 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.11.2000
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper shows that an n/spl times/1 integer vector can be exactly recovered from its Hadamard transform coefficients, even when 0.5n log/sub 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. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 SourceType-Other Sources-1 content type line 63 ObjectType-Correspondence-1 |
ISSN: | 1057-7149 1941-0042 |
DOI: | 10.1109/83.877223 |