Contrary to convention, we construct distributed image compression codecs that operate in the pixel-domain, yet exploit spatial correlation at the decoder only. For lossless compression of binary images of text, we propose two novel decoders: one assumes the image to be a one-dimensional stationary Markov process, and the other assumes it to be a two-dimensional stationary Markov random field. ...

The Mixed Raster Content (MRC) ITU document compression standard (T.44) specifies a multi-layer multiresolution representation of a compound document. It is expected that higher compression can be achieved if more efficient compression standards are used to compress each layer. In this paper we present an MRC compound document codec that uses the H.264/AVC operating in INTRA mode to encode back...

By the introduction of binary hydroxyl groups into poly(p-phenylenebenzoxazole) (PBO) macromolecular chains, a series of dihydroxypoly(p-phenylenebenzobisoxazole) (DHPBO) chains were prepared, and the effect of the hydroxyl groups on the axial compression property of DHPBO fibers was investigated. The variable-temperature Fourier transform infrared spectrum proved the existence of hydrogen bond...

6 This paper proposes to perform authorship analysis using the Fast Compression Distance (FCD), a similarity measure based on compression with dictionaries directly extracted from the written texts. The FCD computes a similarity between two documents through an effective binary search on the intersection set between the two related dictionaries. In the reported experiments the proposed method i...

A method to dynamically construct Markov models that describe the characteristics of binary messages is developed. Such models can be used to predict future message characters and can therefore be used as a basis for data compression. To this end, the Markov modelling technique is combined with Guazzo coding to produce a powerful method of data compression. The method has the advantage of being...

6 This paper proposes to perform authorship analysis using the Fast Compression Distance (FCD), a similarity measure based on compression with dictionaries directly extracted from the written texts. The FCD computes a similarity between two documents through an effective binary search on the intersection set between the two related dictionaries. In the reported experiments the proposed method i...

Video applications in mobile devices call for low complexity video compression algorithms. This paper presents a low complexity 2-power transform for video compression. The elements of the transform matrix are all in 2’s low-order power. The transform computation requires only 28 additions and 10 binary shifts. Computational complexity analysis, coding gains and RD curve comparison show that ou...

The article presents results of web services (WSs) efficiency tests carried out in the testbed emulating disadvantaged network environment. The authors discuss the advantage of different WS adaptation techniques that allow to minimize the XML message size (i.e. compression, filtering and binary coding) and the size of JPEG image attachment (i.e., resolution reduction, decreasing colour depth, J...

This paper proposed the modified approach to the new lossless data compression method. It is developed based on hiding data reversibly with a location map. It performs same as the earlier algorithm but it stands on lossless strategy where as the former approach could not do it. It can compress any kind of symbols as it operates on binary symbols. It is faster than many algorithms as it does not...

A method for compressing large binary images is proposed for applications where spatial access to the image is required. The proposed method is a two-stage combination of forward-adaptive modeling and backward-adaptive context based compression with re-initialization of statistics. The method improves compression performance significantly in comparison to a straightforward combination of JBIG a...