We present a new low-complexity method for modeling and coding the bitplanes of a wavelet-transformed image in a fully embedded fashion. The scheme uses a simple ordering model for embedding, based on the principle that coeecient bits that are likely to reduce the distortion the most should be described rst in the encoded bitstream. The ordering model is tied to a conditioning model in a way th...

This paper describes cryptographic methods for concealing information during data compression processes. These include novel approaches of adding pseudo random shuffles into the processes of dictionary coding (Lampel-Ziv compression), arithmetic coding, and Huffman coding. An immediate application of using these methods to provide multimedia security is proposed.

An improved video subband coding technique is presented. It is based on a spatially and spectrally localizing subband analysis, followed by scalar quantization and direct arithmetic coding. The quantization and coding parameters are adapted on the basis of local energy of the subband pixels. The proposed technique automatically achieves near-optimal rate allocation with respect to mean-square e...

Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers li as parameters such that Zi2"i 5 2". This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within E . The coding speed is comparable to that of conventional coding metho...

Tracking the movement of vehicles by transmitting or storing their position in regular intervals results in a great amount of redundancy, since vehicles are bound by physical barriers that greatly limit the possible movements. In a previous work, a lossy compression scheme was designed that exposed the redundancy in such discrete trajectories and provided an efficient arithmetic code for them. ...

units (adders, ALUs, multipliers, dividers) are essential to fault-tolerant computer designs. Some researchers based early design schemes for such units on arithmetic residue codes.1 Others proposed parity prediction schemes for the same purpose.2 These schemes compute the output operand’s parity as a function of the operator’s internal carries and of the input operands’ parities. The basic dra...

The Elias source coding scheme is modified to permit a source sequence of practically unlimited length to be coded as a single codeword using arithmetic of only limited precision. The result is shown to be a nonblock arithmetic code of the first in, first out (FIFO) typesource symbols are decoded in the same order as they were encoded. Codeword lengths which are near optimum for the specified s...

According to the characteristics of the map images, a practical data compression system was introduced in this paper. The main idea of this system is to segment the map image into two images: long-line image and the rest short-line image. For the first one, we use the cubic spline interpolation method to compress it; for the other image, we use arithmetic coding. It is proved by the experiments...

We study the problem of compressing a block of symbols (a block quantum state) emitted by a memoryless quantum Bernoulli source. We present a simple-to-implement quantum algorithm for projecting, with high probability, the block quantum state onto the typical subspace spanned by the leading eigenstates of its density matrix. We propose a fixed-rate quantum Shannon–Fano code to compress the proj...

| A novel middleware-based system providing eeective and eecient video access for mobile users communicating over low bandwidth error-prone wireless links is proposed. The middleware, implemented as mobile proxy server located at the mobile support station, is chosen for the seamless integration of mobile users and video servers by hiding the speciic details of the underlying system. For eecien...