The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the BDD to 1-2 bits per node. Empirical results for our compression technique are presented, including comparis...

An antidictionary is a set of words that never appear in a binary string. In 2000, Crochemore et al. (2000) presented a compression algorithm of binary text using antidictionary called DCA. Their coding algorithm has been tested on the Calgary Corpus, and their experimental results show that we get compression ratios equivalent to those of most common compressors such as pkzip. Recently, an onl...

Lossless image compression has many applications, for example, in medical imaging, space photograph and film industry. In this thesis, we propose an efficient lossless image compression scheme for both binary images and gray-scale images. The scheme first decomposes images into a set of progressively refined binary sequences and then uses the context-based, adaptive arithmetic coding algorithm ...

This paper addresses about various image compression techniques. On the basis of analyzing the various image compression techniques this paper presents a survey of existing research papers. In this paper we analyze different types of existing method of image compression. Compression of an image is significantly different then compression of binary raw data. To solve these use different types of...

A web service is a modular application that is published, advertised, discovered, and invoked across a network, i.e., an intranet or the Internet. It is based on a “software-as-services” model and may participate as a component of other web services and applications. Binary and XML are two popular encoding/decoding mechanisms for network messages. Binary encoding is used when performance is cri...

This paper presents a new and efficient data compression algorithm, namely, the adaptive character wordlength (ACW) algorithm, which can be used as complementary algorithm to statistical compression techniques. In such techniques, the characters in the source file are converted to a binary code, where the most common characters in the file have the shortest binary codes, and the least common ha...

This document describes a convention for compressing FITS binary tables that is modeled after the FITS tiled-image compression method (White et al. 2009) that has been in use for about a decade. The input table is first optionally subdivided into tiles, each containing an equal number of rows, then every column of data within each tile is compressed and stored as a variable-length array of byte...

This paper presents a new multiresolution segmentationbased algorithm for image compression. High quality low bit rate image compression is achieved by recursively coding the Binary Space Partitioning (BSP) tree representation of images with multilevel Block Truncation Coding (BTC). Comparison with JPEG at rates below 0.25 bit/pixel shows superior performance both in terms of Power Signal-to-No...

We show how the intrinsically performed JPEG compression of many digital still cameras leaves margin for deriving and applying image-adapted coded apertures that support retention of the most important frequencies after compression. These coded apertures, together with subsequently applied image processing, enable a higher light throughput than corresponding circular apertures, while preserving...

Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.