This paper examines some one-dimensional lossy image compression schemes. To perform one-dimensional compression, an image is scanned into a one-dimensional array which is then compressed. Three types of scanning are considered: raster scan, Hilbert scan, and binary scan. Hilbert and binary scan are found to outperform raster scan. The methods considered for compression are integer wavelet tran...

The voltage gained by a charged particle traversing an accelerator section is proportional to the peak power into the section. Thus a high peak power results in high particle voltages in a relatively short distance, a practical requirement of high particle energy accelerators. Pulse compression is a means to obtain high peak power. This note describes a new method of pulse compression, the Bina...

Conventional halftoning methods such as error diffusion and ordered dithering are poorly suited to the compression of halftone images using the baseline fax compression schemes CCITT G3 and G4. This paper proposes an efficient and flexible solution for binary representation of mixed content documents using CCITT G3/G4 compression. The solution includes two variations which we refer to as FastFa...

In this paper we address the new lossy coding method for digital transmission or storage of binary images using hierachical decomposition based on the vector quantization. Binary(white-and-black) images , especially engineering drawings and weather maps, are containing a lot of blank spaces in the entire image. From this aspect, the proposed method are employed two popular compression thechniqu...

Best basis searc hing algorithm based on binary in general M ary segmentation was constructed by Coifman and Wickerhauser and widely used for signal processing How ever there are several problems with the binary scheme First the binary segmentation is in exible in group ing signals along the axis Secondly the binary based segmentation method is very sensitiv e to time space shifts of the origin...

Two new facilities for Haskell are described: compression of data values in memory, and a new scheme for binary I/O. These facilities, although they can be used individually, can also be combined because they use the same binary representations for values. Heap compression in memory is valuable because it enables programs to run on smaller machines, or conversely allows programs to store more d...

We show how concatenated (convolutional) codes can be used to compress close to the Wyner-Ziv limit for binary sources. Focusing on the case of lossy compression of an equiprobable memoryless binary source with side information at the decoder, the approach is based on nested binary linear codes, which is the extension of Wyner’s lossless compression scheme to the lossy case proposed by Shamai, ...

Raster document coders are typically based on the use of a binary mask layer that efficiently encodes the text and graphic content. While these methods can yield much higher compression ratios than natural image compression methods, the binary representation tends to distort fine document details, such as thin lines, and text edges. In this paper, we describe a method for encoding and decoding ...

A binary string of length 2 induces the Boolean function of k variables whose Shannon expansion is the given binary string. This Boolean function then is representable via a unique reduced ordered binary decision diagram (ROBDD). The given binary string is fully recoverable from this ROBDD. We exhibit a lossless data compression algorithm in which a binary string of length a power of two is com...