336 search results - page 41 / 68 » Compression of Samplable Sources |
MMSP
2008
IEEE
14 years 1 months ago
2008
IEEE
—The use of multiple entropy models for Huffman or arithmetic coding is widely used to improve the compression efficiency of many algorithms when the source probability distribu...
CODES
2009
IEEE
13 years 8 months ago
2009
IEEE
The H.264 video codec provides exceptional video compression while imposing dramatic increases in computational complexity over previous standards. While exploiting parallelism in...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
An information?theoretic model for image watermarking and data hiding systems is presented in this paper. The fundamental capacity limits of these systems are determined by the st...
IEEEMSP
2002
IEEE
14 years 14 days ago
2002
IEEE
Abstract— This paper discusses encryption operations that selectively encrypt content-carrying segments of multimedia data stream. We propose and analyze three techniques that wo...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...