JPEG-2000, the successor to JPEG, is emerging as an attractive candidate for the future de facto image compression standard. However, while it offers superior results over most other image compression techniques, it comes with a long list of features and options, and consequently a highly complex algorithm. We have developed an image coder that can compete with the performance of JPEG-2000 whil...

Arithmetic coding is a well-known technique for lossless coding or data compression. It is based on splitting a current interval into sub-intervals, each sub-interval corresponding to a possible symbol to be encoded and the size of each sub-interval corresponding to the probability of the associated symbol. This involves multiplying the current interval size A by one or more probabilities, whic...

section, leading to the introduction of our proposed variable bit rate system. After some coverage of the performance of the system with a standard linear predictor, we introduce a Kalman predictor, and show an approach to reduce the computational complexity. We discuss the use of perceptual weighting within the system, and bit error resynchronization for the Arithmetic Coding (AC) data stream....

We present the design and performance of a non-adaptive hardware system for data compression by arithmetic coding. The alphabet of the data source is the full 256-symbol ASCII character set, plus a non-ASCII end-ofle symbol. The key ideas of our system are the non-arithmetic representation of the current interval width, which yields improved coding e ciency in the interval-width update, and a r...

In the compression of medical images, region interest (ROI) based techniques seem to be promising, as they can result in high ratios while maintaining quality diagnostic importance, ROI, when image is reconstructed. this article, we propose a set-up for brain magnetic resonance imaging (MRI) images on automatic extraction tumor. Our approach first separate tumor, ROI our case, from image, using...

Significant progress has recently been made in lossless image compression using discrete wavelet transforms. The overall performance of these schemes may be further improved by properly designing efficient entropy coders. In this paper a new technique is introduced for the implementation of context-based adaptive arithmetic entropy coding. This technique is based on the prediction of the value ...

A numerical optical processor is described that performs operations in residue arithmetic. The position coding used to represent decimal and residue numbers allows one to describe the various conversions and operations in a correlation formulation. This description of residue arithmetic leads directly to novel residue adder and decimal/residue/decimal converter designs, which are described and ...

Redundancy is de ned as the excess of the code length over the optimal (ideal) code length. We study the average redundancy of an idealized arithmetic coding (for memoryless sources with unknown distributions) in which the Krichevsky and Tro mov estimator is followed by the Shannon{Fano code. We shall ignore here important practical implementation issues such as nite precisions and nite bu er s...

A new deterministic floating-point arithmetic called precision arithmetic is developed to track precision for arithmetic calculations. It uses a novel rounding scheme to avoid the excessive rounding error propagation of conventional floating-point arithmetic. Unlike interval arithmetic, its uncertainty tracking is based on statistics and the central limit theorem, with a much tighter bounding r...

The paper provides an overview of the quantization and entropy coding methods in Versatile Video Coding (VVC) standard. Special focus is laid on techniques that improve efficiency relative to included High Efficiency (HEVC) standard: inclusion trellis-coded quantization, advanced context modeling for transform coefficient levels, arithmetic engine with multi-hypothesis probability estimation, j...