The current international standard, the Joint Bilevel Image Experts Group (JBIG), is a representative of a bilevel image compression algorithm. It compresses bilevel images with high performance, but it shows relatively low performance in compressing error-diffused halftone images. This paper proposes a new bilevel image compression for error-diffused images, which is based on Bayes' theorem. T...

The most popular adaptive dictionary coding scheme used for text compression is the LZW algorithm [2]. In the LZW algorithm, a changing dictionary contains common strings that have been encountered so far in t,he text. The dictionary can be represented by a dynamic trie. The input text is examined character by character and the longest substring (called a prefix string) of the text which alread...

This article describes a technique of using a trigonometric function and combinatorial calculations to code or transform any finite sequence of binary numbers (0s and 1s) of any length to a unique set of three Real numbers. In reverse, these three Real numbers can be used independently to reconstruct the original Binary sequence precisely. The main principles of this technique are then applied ...

In multimedia applications, XML is being increasingly used to represent metadata; examples are MPEG-7 multimedia description schemes and MPEG-21 usage environment descriptions. As with the media data, the size of, or the overhead induced by, the XML metadata is important, particularly when used on constrained mobile devices. Therefore, compression (binary encoding) of the XML data becomes relev...

In this paper, a new lossless data compression method that is based on digram coding is introduced. This data compression method uses semi-static dictionaries: All of the used characters and most frequently used two character blocks (digrams) in the source are found and inserted into a dictionary in the first-pass, compression is performed in the second-pass. This two-pass structure is repeated...

The use of files in digital form is currently growing and requires media to store them. more that store, the storage space need. This encourages development file reduction techniques or data compression with aim reducing required space. technique has several algorithms can be used compress such as Yamamoto's recursive code algorithm Fixed Length Binary Encoding (FLBE). These have different perf...

A model of a rigid-plastic rate-independent polycrystalline aggregate wherein subaggregates are represented as the nodes of a binary tree is proposed. The lowest nodes of the binary tree represent grains. Higher binary tree nodes represent increasingly larger sub-aggregates of grains, culminating with the root of the tree, which represents the entire polycrystalline aggregate. Planar interfaces...

Compressing an image is significantly different than compressing raw binary data. For this different compression algorithm are used to compress images. Fractal image compression (FIC) has been widely used to compress the image. Apart from FIC, their also exist another algorithm well known as Discrete Wavelet Transform (DWT). Wavelet transform are very powerful compared to other transform becaus...

A direct-write maskless lithography system using 25nm for 50nm feature sizes requires data rates of about 10 Tb/s to maintain a throughput of one wafer per minute per layer achieved by today’s optical lithography systems. In a previous paper, we presented an architecture that achieves this data rate contingent on 25 to 1 compression of lithography data, and on implementation of a real-time deco...