This paper presents an approach for fractal image compression that yields the best performance compared to fractal methods that do not rely on hybrid transform coding. The achievement is obtained using the standard algorithm in which the image is partitioned into non-overlapping range blocks which are approximated by corresponding larger domain blocks with image intensities that are affinely si...

The contribution deals with the most important methods for decomposition of binary images into union of rectangles. The overview includes run-length encoding and its generalization, decompositions based on quadtrees, on the distance transformation, and a theoretically optimal decomposition based on maximal matching in bipartite graphs. We experimentally test their performance in binary image co...

      Extended release formulation of alfuzosin, an a-antagonist used for prostatic hypertrophy, is available in market. It is convenient for older patients to take only one tablet a day. Marketed alfuzosin formulation is three layered geomatrix tablet that requires special facilities, high cost, more time and complex operation than normal direct compression formulation. Therefore, a less compl...

We consider the variable-to-fixed length lossy source coding (VFSC) problem. The optimal compression rate of the average length of variable-to-fixed source coding, allowing a non-vanishing probability of excess-distortion ε, is shown to be equal to (1−ε)R(D), where R(D) is the rate-distortion function of the source. In comparison to the related results of Koga and Yamamoto as well as Kostina, P...

Recognition of binary images through the use of a string of numbers is outlined. The string of numbers representing the image leads to a large amount of compression and this compressed image comprising of strings of numbers can be successfully transmitted and reproduced with desired fidelity. Recognition of binary images in the form of Bengali alphabets has been successfully achieved for differ...

We describe a sequential universal data compression procedure for binary tree sources that performs the " double mixture. " Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and ...

The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Sz&kely we generalize this bound to binary codes with a transitive automorphism group. @ 1998 Elsevier Scienc B.V. All rights reserved

In this paper the eld of lossless bi-level image compression standards is examined. Particularly the characteristics of the latest standard, JBIG, are discussed and compared to earlier standards. Furthermore, the elements of JBIG compression method are explained. Practical compression results are also shown. Finally, the latest trends of lossless bi-level compression are discussed.

ABSTRACT ____________________________________________________________ This thesis investigates the prospect of using a Binary Discrete Cosine Transform as an integral component of an image compression system. The Discrete Cosine Transform (DCT) algorithm is well known and commonly used for image compression. Various compression techniques are actively being researched as they are attractive for...

In this paper, we have described the theory of binary wavelet decomposition as applied to the compression of binary images. It has been shown that this is similar to other transforms like the real field transforms. Applying real field transforms for binary images results in increased complexity, and so we have used a transform called the Binary Field Transform. By using this transform, the comp...