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 conventional method for sending halftone images via facsimile machines is inefficient. The previously proposed ToneFac algorithm improves the transmission of halftone images. ToneFac represents a halftone image by mean gray values of the disjoint blocks and an error image, which records the difference between the desired halftone and the halftone generated using the mean gray values. To imp...

The idea of this paper is to invent a new strategy in steganography to get the minimum effect on the images which is used to hide data into it. This is by dividing the original image into a number of segments, these segments is achieved according to the number of characters included into the message which is going to be hided into the original image. In this approach the message will be coded b...

The problem of noiselessly encoding a message when prior statistics are known is considered. The close relationship of arithmetic and enumerative coding for this problem is shown by computing explicit arithmetic coding probabilities for various enumerative coding examples. This enables a comparison to be made of the coding efficiency of Markov models and enumerative codes as well as a new codin...

The trace of a moving object is commonly referred to as a trajectory. This paper considers the spatio-temporal information content of a discrete trajectory in relation to a movement prediction model for the object under consideration. The information content is the minimal amount of information necessary to reconstruct the trajectory, given the movement model. We show how the information conten...

It is well-known that for a given sequence, its optimal codeword length is fixed. Many coding schemes have been proposed to make the codeword length as close to the optimal value as possible. In this paper, a new block-based coding scheme operating on the subsequences of a source sequence is proposed. It is proved that the optimal codeword lengths of the subsequences are not larger than that of...

The trace of a moving object is commonly referred to as a trajectory. This paper considers the spatio-temporal information content of a discrete trajectory in relation to a movement prediction model for the object under consideration. The information content is the minimal amount of information necessary to reconstruct the trajectory, given the movement model. We show how the information conten...

A two-stage modelling schema to be used together with arithmetic coding is proposed. Main motivation of the work has been the relatively slow operation of arithmetic coding. The new modelling schema reduces the use of arithmetic coding by applying to large white regions global modelling which consumes less time. This composite method works well and with a set of test images it took only ca. 41%...

The paper deals with formal description of data transformation (compression and decompression process). We start by briefly reviewing basic concepts of data compression and introducing the model based approach that underlies most modern techniques. Then we present the arithmetic coding and Huffman coding for data compression, and finally see the performance of arithmetic coding. And conclude th...