DocumentCode
395379
Title
Bit-plane Golomb coding for sources with Laplacian distributions
Author
Yu, R. ; Ko, C.C. ; Rahardja, S. ; Lin, X.
Author_Institution
Labs. for Inf. Technol., A*STAR, Singapore
Volume
4
fYear
2003
fDate
6-10 April 2003
Abstract
This paper presents a bit-plane coding algorithm for Laplacian distributed sources that are commonly encountered in signal compression applications. By exploiting the statistical characteristics of the sources, the proposed algorithm achieves a rate-distortion performance that is essentially comparable to an optimal nonscalable scalar quantizer, while at the same time operates at a complexity level suitable for most practical implementations.
Keywords
data compression; rate distortion theory; source coding; statistical analysis; Golomb coding; Laplacian distributions; bit-plane coding algorithm; complexity; rate-distortion performance; signal compression applications; source coding; statistical characteristics; Application software; Bandwidth; Compression algorithms; Image coding; Information technology; Laboratories; Laplace equations; Rate-distortion; Scalability; Video compression;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on
ISSN
1520-6149
Print_ISBN
0-7803-7663-3
Type
conf
DOI
10.1109/ICASSP.2003.1202622
Filename
1202622
Link To Document