DocumentCode
3288935
Title
Spectral entropy-based bit allocation
Author
Bhaskaranand, Malavika ; Gibson, Jerry D.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of California, Santa Barbara, CA, USA
fYear
2010
fDate
17-20 Oct. 2010
Firstpage
243
Lastpage
248
Abstract
In transform-based compression schemes, the task of choosing, quantizing, and coding the coefficients that best represent a signal is of prime importance. As a step in this direction, Yang and Gibson have designed a coefficient selection scheme based on Campbell´s coefficient rate and spectral entropy. Building on the spectral entropy-based coefficient selection mechanism, we develop a scheme to allocate bits amongst the chosen coefficients. We show that the proposed scheme can outperform the classical method under certain conditions. We then design quantization matrices (QMs) based on the proposed bit allocation method and show that the newly designed QMs perform better than the default QMs for H.264/AVC encoding in terms of both peak signal to noise ratio (PSNR) and structural similarity (SSIM).
Keywords
data compression; entropy; image representation; quantisation (signal); spectral analysis; video coding; Campbell coefficient rate; H.264/AVC encoding; coefficient coding; peak signal to noise ratio; quantization matrices; signal representation; spectral entropy-based bit allocation method; spectral entropy-based coefficient selection mechanism; structural similarity; transform-based compression schemes; Bit rate; Entropy; Quantization; Speech; Speech coding; Transforms;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and its Applications (ISITA), 2010 International Symposium on
Conference_Location
Taichung
Print_ISBN
978-1-4244-6016-8
Electronic_ISBN
978-1-4244-6017-5
Type
conf
DOI
10.1109/ISITA.2010.5648927
Filename
5648927
Link To Document