Developers can use lossy compression on images and many other artifacts to reduce size and improve network transfer times. Native program instructions, however, are typically not considered candidates for lossy compression since arbitrary losses in instructions may dramatically affect program output. In this paper we show that lossy compression of compiled native instructions is possible in cer...

A compression/decompression scheme based on statistical coding is presented for reducing the amount of test data that must be stored on a tester and transferred to each core in a core-based design. The test vectors provided by the core vendor are stored in compressed form in the tester memory and transferred to the chip where they are decompressed and applied to the core. Given the set of test ...

A run length code compression scheme of extreme simplicity, used for image storage in an automated bacterial morphometry system, is compared with more common compression schemes, such as are used in the tag image file format. These schemes are Lempel-Ziv and Welch (LZW), Macintosh Packbits, and CCITT Group 3 Facsimile 1-dimensional modified Huffman run length code. In a set of 25 images consist...

One of the most important consideration techniques when one want to solve the protecting of digital signal is the golden matrix. The golden matrices can be used for creation of a new kind of cryptography called the golden cryptography. Many research papers have proved that the method is very fast and simple for technical realization and can be used for cryptographic protection of digital signal...

Data hiding, which embeds secret data into cover media, is one type of technology used to achieve the multimedia security. A reversible data hiding method has the characteristic that the cover media can be completely reconstructed after secret data are extracted. Recently, some reversible data hiding schemes have focused on the vector quantization (VQ)-compressed format. Using the modified fast...

In this paper a new model for compression of Laplacian source is given. This model consists of hybrid quantizer whose output levels are coded with Golomb-Rice code. Hybrid quantizer is combination of uniform and nonuniform quantizer, and it can be considered as generalized quantizer, whose special cases are uniform and nonuniform quantizers. We propose new generalized optimal compression functi...

Adaptive variable-length codes associate a variable-length codeword to the symbol being encoded depending on the previous symbols in the input string. This class of codes has been recently presented in [Dragoş Trincă, arXiv:cs.DS/0505007] as a new class of non-standard variable-length codes. New algorithms for data compression, based on adaptive variable-length codes of order one and Huffman’s ...

Image Compression is the application of Data Compression on digital image. The techniques used for the image compression are broadly divided into lossy and lossless compression techniques. One of the lossless compression techniques is Huffman encoding. In this paper, the new method MH Encoding (Median Filter + Huffman Encoding) is used to compress the images. Here the images are preprocessed us...

• Arithmetic Coding is universal • Arithmetic coding is suitable for small alphabet (binary sources) with highly skewed probabilities. • Huffman cannot allocate fractional bits to symbols: , but the algorithm will assign 1 bit. Huffman needs at least one bit per symbol. If, however, the alphabet is large and probabilities are not skewed, Huffman rate is pretty close to entropy (H). , 01 . 0 , 9...

We report the design, implementation, and deployment of Lepton, a fault-tolerant system that losslessly compresses JPEG images to 77% of their original size on average. Lepton replaces the lowest layer of baseline JPEG compression—a Huffman code—with a parallelized arithmetic code, so that the exact bytes of the original JPEG file can be recovered quickly. Lepton matches the compression efficie...