Chain codes are the most size-efficient representations of rasterised binary shapes and contours. This paper considers a new lossless chain code compression method based on move-to-front transform and an adaptive run-length encoding. The former reduces the information entropy of the chain code, whilst the latter compresses the entropy-reduced chain code by coding the repetitions of chain code s...

In this paper, we will present p roposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consist...

– In this report, a new fuzzy 2bit-AND parallel-to-OR, or simply, a fuzzy binary AND/OR (FBAR) text data compression model as an algorithm is suggested for bettering spatial locality limits on nodes during database transactions. The current model incorporates a four-layer application technique: string-to-AND/OR pairwise binary bit + fuzzy quantum with noise conversions. This technique promotes ...

We introduce the concept of joint source coding, channel coding, and secrecy. In particular, we propose two practical joint schemes: the first one is based on error-correcting randomized arithmetic codes, while the second one employs turbo codes with compression, error protection, and securization capabilities. We provide simulation results on ideal binary data showing that the proposed schemes...

RC-coding, developed by Cederberg and Danielsson for encoding of binary images, has been gener-alised to allow encoding of any image. Both`compact RC' encoding andèntity' encoding have been generalised. The generalised compact RC encoding algorithm allows for very simple colour image encoding. The generalised entity encoding algorithm is suitable for raster-scan boundary encoding of images, whi...

Abstruct-In the testing of logic circuits, two of the proposed data compression methods are the number of ones (syndrome) and the number of sequence changes (transition count). An enumeration N ( m , k , t ) of the number of length-m binary sequences having syndrome value k and transition count t is developed. Examination of this result reveals that the parallel compression of these two methods...

We present a new method for lossless image compression that gives compression comparable to JPEG lossless mode with about ve times the speed. Our method, called FELICS, is based on a novel use of two neighboring pixels for both prediction and error modeling. For coding we use single bits, adjusted binary codes, and Golomb or Rice codes. For the latter we present and analyze a provably good meth...

Digital maps can be stored and distributed electronically using compressed raster image formats. In this paper, we evaluate the most suitable compression methods for storing digital map images. We apply the latest compression standards for binary images (G4, JBIG2), and the standards for computer graphics with limited number of color tones (GIF, PING). Experimental results are given for two set...

In this work, a subband domain textual image compression method is developed. The document image is first decomposed into subimages using binary subband decompositions. Next, the character locations in the subbands and the symbol library consisting of the character images are encoded. The method is suitable for keyword search in the compressed data. It is observed that very high compression rat...

We propose a method for efficient coding of sources with two-sided geometric distribution (TSGD) and entropy near to or less than 1 bit. This method is based on the binary tree decomposition of source symbols combined with binary arithmetic coding and allows for fast and efficient implementation. It can be used for coding of transform coefficients in low bit-rate video and image compression sys...