For low bit-rate compression applications, segmentation-based coding methods provide, in general, high compression ratios when compared with traditional (e.g., transform and subband) coding approaches. In this paper, we present a segmentation based image coding method that divides the desired image using binary space partitioning (BSP). Geometric wavelet is a recent development in the field of ...

Binary factor analysis (BFA, also known as Boolean Factor Analysis) is a nonhierarchical analysis of binary data, based on reduction of binary space dimension. It allows us to find hidden relationships in binary data, which can be used for data compression, data mining, or intelligent data comparison for information retrieval. Unfortunately, we can’t effectively use classical (i.e. non-binary) ...

A new compression algorithm is derived that computes and encodes the Minimum Message Length (MML) near optimal partition of symbols in a string for compression. Using Symbol Compression Ratio (SCR) as a driving function this algorithm produces a binary tree model of the data that introduces a fundamental parameter of information related to Kolmogorov Complexity – the size of the alphabet in the...

Lossy compression algorithms take advantage of the inherent limitations of the human eye and discard information that cannot be seen. [1] In the present paper a technique termed as Lossy Data Compression using Logarithm (LDCL) is proposed to compress incoming binary data in the form of a resultant matrix containing the logarithmic values of different chosen numeric sets. The proposed method is ...

We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is fully static and optimized off-line for a training image. The structure of the tree is similar for different images of the same type. The benefit from optimizing the tree for each input image separately is usually overweig...

This research paper presents a proposed method for the compression of medical images using hybrid compression technique (DWT, DCT and Huffman coding). The objective of this hybrid scheme is to achieve higher compression rates by first applying DWT and DCT on individual components RGB. After applying this image is quantized to calculate probability index for each unique quantity so as to find ou...

A significant cost in PPM data compression (and often the major cost) is the provision and efficient coding of escapes while building contexts. This paper presents some recent work on eliminating escapes in PPM compression, using bit-wise compression with binary contexts. It shows that PPM without escapes can achieve averages of 2.5 bits per character on the Calgary Corpus and 2.2 bpc on the Ca...

In this work, we investigate the nearly lossless image compression technique, which provides a better compression ratio than purely loss-less compression schemes and has a better reconstructed image quality than lossy ones. In particular, we introduce a new idea called the soft decision quantization and integrate it with the binary arithmetic QM coder. The superior performance of the developed ...