William B. Pennebaker

An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder

The Q-Coder is a new form of adaptive binary arithmetic coding. The binary arithmetic coding part of the technique is derived from the basic concepts introduced by Rissanen, Pasco, and Langdon, but extends the coding conventions to resolve a conflict between optimal software and hardware implementations. In addition, a robust form of probability estimation is used in which the probability estimate is derived solely from the interval renormalizations that are part of the arithmetic coding process. A brief tutorial of arithmetic coding concepts is presented, followed by a discussion of the compatible optimal hardware and software coding structures and the estimation of symbol probabilities from interval renormalization.

Probability estimation for the Q-Coder

The Q-Coder is an important new development in binary arithmetic coding. It combines a simple but efficient arithmetic approximation for the multiply operation, a new formalism which yields optimally efficient hardware and software implementations, and a new technique for estimating symbol probabilities which matches the performance of any method known. This paper describes the probability-estimation technique. The probability changes are estimated solely from renormalizations in the coding process and require no additional counters. The estimation process can be implemented as a finite-state machine, and is simple enough to allow precise theoretical modeling of single-context coding. Approximate models have been developed for a more complex multi-rate version of the estimator and for mixed-context coding. Experimental studies verifying the modeling and showing the performance achieved for a variety of image-coding models are presented.

Software implementation of the Q-Coder

The Q-Coder is an important new development in arithmetic coding. It combines a simple but efficient arithmetic approximation for the multiply operation, a new formalism which yields optimally efficient hardware and software implementations, and a new technique for estimating symbol probabilities which matches the performance of any method known. This paper describes implementations of the Q-Coder following both the hardware and software paths. Detailed flowcharts are given.

Optimal hardware and software arithmetic coding procedures for the Q-Coder

The Q-Coder is an important new development in arithmetic coding. It combines a simple but efficient arithmetic approximation for the multiply operation, a new formalism which yields optimally efficient hardware and software implementations, and a new form of probability estimation. This paper describes the concepts which allow different, yet compatible, optimal software and hardware implementations. In prior binary arithmetic coding algorithms, efficient hardware implementations favored ordering the more probable symbol (MPS) above the less probable symbol (LPS) in the current probability interval. Efficient software implementation required the inverse ordering convention. In this paper it is shown that optimal hardware and software encoders and decoders can be achieved with either symbol ordering. Although optimal implementation for a given symbol ordering requires the hardware and software code strings to point to opposite ends of the probability interval, either code string can be converted to match the other exactly. In addition, a code string generated using one symbol-ordering convention can be inverted so that it exactly matches the code string generated with the inverse convention. Even where bit stuffing is used to block carry propagation, the code strings can be kept identical.

Gray-Scale Image Coding for Freeze-Frame Videoconferencing

A new gray-scale image coding technique has been developed, in which an extended DPCM approach has been combined with entropy coding. This technique has been implemented in a freeze-frame videoconferencing system which is now operational at IBM sites throughout the world. Following image preprocessing, the two fields of the interlaced 512 x 480 pixel video frame are compressed sequentially with different algorithms. The reconstructed image quality is improved by subsequent image postprocessing, the final reconstructed image being almost indistinguishable from the original image. Typical gray-scale video images compress to about a half bit per pixel and transmit over 4.8 kbit/s dial-up telephone lines in about a half minute. The gray-scale image processing and compression algorithms are described in this paper.

Series/1-based videoconferencing system

Discussed is a new videoconferencing system that has been developed and deployed at several IBM locations. This system transmits high-quality monochrome, freeze-frame images over dial-up telephone lines between two (or three) dedicated videoconferencing rooms. There are two main system components. An IBM Series/1 provides control, communication, data compression, and storage, and a Grinnell GMR-270 image processing display system implements image acquisition, processing, and video buffering functions. Conference participants may choose either a basically black and white rendering of an image for fast transmission or a continuous-tone rendering with a longer transmission time. Details are given regarding the system configuration, function, and operation.

Graphics image coding for freeze-frame videoconferencing

A technique is presented for coding images that are bilevel in nature but have been captured in continuous-tone format. Following various stages of image processing, a three-level image is generated, and compressed to about 0.1 to 0.2 b/pixel. The technique has been implemented in the IBM freeze-frame videoconferencing system. >

Displaying Photographic Images On Computer Monitors With Limited Colour Resolution

In this paper we address the problem of displaying continuous tone photographic colour images on CRT monitors on which only a limited number of colours can be displayed simultaneously. An algorithm is presented which generates a palette of a limited number of colours, and a method is given for the actual display of a full colour image using such a palette and its associated tables.

Tracking nonstationary probabilities in adaptive binary arithmetic coding

Adaptive arithmetic coders sometimes exhibit nonstationary symbol probabilities when coding digital halftone images with neighborhood-template models. If these nonstationary probabilities vary nonrandomly, the variations can be tracked robustly when each context derived from the coding model is expanded by conditioning on previously coded values for that model context.

DCT-based video compression using arithmetic coding

We describe a tnotion-compensated hybrid DCT/DPCM video compression scheme that incorporates arithmetic coding. The scheme is based on a current ISO/CCITT standards proposal for compressing still images with suitable extensions to handle video sequences. Compared to Iluffman coding, arithmetic coding can increase compression efficiency for the same image quality or, alternately, improve image quality for the same transmission rate. We have extended the use of arithmetic for coding motion vector data and motion-compensated interframe data. We have also investigated the trade-off in image quality, transmission bandwidth, and algorithm complexity between using I-Iuffman or arithmetic coding in motion video.