DCC
2002
IEEE
14 years 7 days ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
DCC
2002
IEEE
14 years 5 months ago
2002
IEEE
We consider the case of two corr elated non-binary sources. Data compression is achieved by transforming the sequences of non-binary symbols into sequences of bits and then using ...
DCC
2002
IEEE
14 years 5 months ago
2002
IEEE
DCC
2002
IEEE
14 years 5 months ago
2002
IEEE
DCC
2002
IEEE
15 years 22 hour ago
2002
IEEE
In this paper, we report work on a family of variable-length codes with less redundancy than the de facto flat code used in most of the variable size dynamic dictionary based comp...
DCC
2002
IEEE
15 years 22 hour ago
2002
IEEE
Wavelet-based image coders optimally represent smooth regions and isolated point singularities. However, wavelet coders are less adept at representing perceptually important edge ...
DCC
2002
IEEE
15 years 22 hour ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
DCC
2002
IEEE
15 years 22 hour ago
2002
IEEE
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...
DCC
2002
IEEE
15 years 22 hour ago
2002
IEEE
On-line adaptation to nonstationary distributions is essential to good performance in image coding. Fixed-size contexts (with adaptive tables) are also widely used, in conjunction...
DCC
2002
IEEE
15 years 22 hour ago
2002
IEEE
