In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
Inspired by a converse result, the concept of "probabilistically matched" sources and channels is extended to sources subject to multiresolution coding and degraded broa...
Hong and Ladner [6] used context-based group testing to implement bitplane coding for image compression. We extend this technique to video coding, by replacing the quantization an...
Gidon Shavit, Michael F. Ringenburg, Jeff West, Ri...
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high? performance encoding is needed. ...
Joshua G. Senecal, Mark A. Duchaineau, Kenneth I. ...
Many technical imaging applications, like coding "images" of digital elevation maps, require extracting regions of compressed images in which the pixel values are within...