The use of arithmetic coding for binary image compression achieves a high compression ratio while the running time remains rather slow. A composite modelling method presented in this paper reduces the size of the data to be coded by arithmetic coding. The method is to code the uniform areas with less computation and apply arithmetic coding to the areas with more variation.

Let v1; : : : ; vn be unit vectors in R such that vi ¢ vj = ¡w for i 6= j where ¡1 < w < 1 n¡1 . The points Pn i=1 ‚ivi (1 ‚ ‚1 ‚ ¢ ¢ ¢ ‚ ‚n ‚ 0) form a “Hill-simplex of the first type”, denoted by Qn(w). It was shown by Hadwiger in 1951 that Qn(w) is equidissectable with a cube. In 1985, Schöbi gave a three-piece dissection of Q3(w) into a triangular prism cQ2(2) £ I, where I denotes an interv...

Color separation and highly optimized context tree modeling for binary layers have provided the best compression results for color map images that consist of highly complex spatial structures but only a relatively few number of colors. We explore whether this kind of approach works on photographic and palette images as well. The main difficulty is that these images can have a much higher number...

Context tree weighting method is a universal compression algorithm for FSMX sources. Though we expect that it will have good compression ratio in practice, it is difficult to implement it and in many cases the implementation is only for estimating compression ratio. Though Willems and Tjalkens showed practical implementation using not block probabilities but conditional probabilities, it is use...

We consider here the case of XForms applications on small mobile devices. The aim is to find out whether a schema-aware binary XML format is better suited to this area than generic compression applied to regular XML. We begin by limiting the potential areas of improvement through considering the features of the binary format, and then proceed to measure effects in the identified areas to determ...

Chung and Chang proposed an encryption scheme for binary images based on two-dimensional run-encoding (2DRE) and scan patterns. In this paper, we indicate that their scheme is still not secure and efficient enough. Hence, an improvement scheme is proposed. There are two contributions in the proposed improvement scheme using partial image encryption techniques. O n e i s t o scrambling the pixel...

In this paper, we show an effective way of using adaptive self-organizing data structures in enhancing compression schemes. We introduce a new data structure, the Partitioning Binary Search Tree (PBST), which is based on the well-known Binary Search Tree (BST), and when used in conjunction with Fano encoding, the PBST leads to the so-called Fano Binary Search Tree (FBST). The PBST and FBST can ...

Binary arithmetic coding is, compression-wise, the most effective statistical coding method used in image and video compression. It is being used for compressing bi-level images/videos (JBIG, JBIG2, MPEG-4 shape coding) and is also optionally being utilized for coding of continuous-tone images/videos (JPEG, H.264). Despite its wide use, different arithmetic coders are generally incompatible wit...

The splitting a non-binary input image into a number of lower, but not neccessarily binary, resolution subgroups is explored as a technique to improve lossless compression. The idea is to accelerate the learning in the Markov models used as part of arithmetic coders. Our technique typically improves on the \standard" JBIG method of using single (Gray coded) bit planes by approximately 4%.

When working with color images, many processing algorithms and procedures can perform separation of pixel values into their luminance and chrominance components .This paper presents a new approach to compress the luminance and chrominance components using lossy and lossless Binary Plane Techniques respectively. The results are compared with the compression applied directly on RGB image using lo...