Preprocessing Text to Improve Compression Ratios
Holger Kruse, Amar Mukherjee
In this paper we discuss the use of a text preprocessing algorithm that can improve the compression ratio of standard data compression algorithms, in particular 'bzip2' when used on text files.
The text preprocessing algorithm uses a static dicitonary of the english language that is kept seperately from the compressed file. The method in which the dictionary is used by the algorithm to transform the text is based on published earlier.
Improve Text Compression Ratios with the Burrows-Wheeler Transform
Holger Kruse, Amar Mukherjee
In this paper we describe several methods that can be used to improve the compression ration of compression algorithms based on the Burrows-Wheeler Transform, as, for instance, implemented in 'bzip2', when used in combination with English language text files.
We first briefly describe the Burrows-Wheeler Transform and some of its strenghts and weakness, and motivate enhancements to the exisiting algorithm, specifically for the purpose of text compression. We then describe our implementation of these enhancements and test results, compared to the original algorithm.
Algorithms for Text and Image Compression
Amar Mukherjee, Holger Kruse, Kunal Mukherjee
The primary objective of data compression algorithms is to reduce redundancy in data representation in order to decrease data storage requirement. Data compression also offers an attractive approach to reduce the communication cost by effectively utilizing the available bandwidth in the data links. In the nineties, we have seen an unprecedented explosion of digital data on the information superhighways of the world. This data represents a variety of objects from the multimedia spectrum such as text, images, video, sound, computer programs, graphs,charts,maps,tables.....
Recursive Merge-Filter Algorithm for Computing the Discrete Wavelet Transform
Kunal Mukherjee, Amar Mukherjee
We present a new wavelet transform algorithm with a data flow that can fully exploit the locality property of wavelets. This leads to highly optimized fine grained wavelet coding algorithms, in terms of pipelinging performance,flexible data granularity and reliablity of transmission. It can be used by all wavelet coding methods, and hass been demonstrated to improve the performance of the most successful ones. We propse a new bottom-up Embedded Zerotree Wavelet(EZW) image coding algorithm, and demonstrate a 5-10% speedup over EZW, by means of close coupling between the new wavelet transform algorithm and EZW encoding....
RMF based Adaptive Block-wise Compression
Tao Tao, Amar Mukherjee
In this paper, we present a new RMF(Recursive Merge Filter) based adaptive block-wise compression method. We propose this method based on two works, one is the FWT(fast Wavelet transform) based adaptive block-wise compression method and the other one is a new DWT (discrete wavelet transform) algorithm called RMF algorithm. The FWT based adaptive block-wise compression method has the limitation that it is not possible to do sub-image level encoding necessary for progressive encoding. The RMF algorithm, which has the same computation result as FWT but has different data flow, has the advantage that it maintains the spatial locality property of wavelet coefficients which are computed in a bottom up fashion...
RMF Based EZW Image Compression Method
Tao Tao, Kunal Mukherjee, Amar Mukherjee
In this paper, we present a new RMF(Recursive Merge Filter) based EZW (Embedded Image Coding Using Zero-trees of Wavelet coefficients) image compression method. We propose this method based on two works, one is the EZW algorithm and the other one is a new DWT(Discrete Wavelet Transform) algorithm called RMF algorithm. The EZW algorithm, which is a veru successful wavelet based image compression method, has two main limitations - the sub-image level encoding is not possible and the computational complexity is high. The RMF algorithm, which has the same computation result as FWT(Fast Wavelet Transform) but has a different data flow, has the advantage that it maintains the spatail locality property of wavelet coefficients which are computed in a bottom up fashion...
Lossless,Reversible Transformation that improve Text compression Ratios
Robert Franceschini, Holger Kruse, Nan Zhang, Raja Iqbal, Amar Mukherjee
Lossless Compression researchers have developed highly sophisticate approaches such as huffman coding, airthmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression(DMC), Prediciton by Partial Matching(PPM), and Burrow-Wheeler Transform(BWT) based algorithms. However none of these methods has been able to reach the theoretical best case compression ratio consistely, which suggest that better algorithms may be possible. Once approach for trying to attain better compression ratio is to develop different compression algorithm. As alternative approach, however, is to develop generic, reversible transformations that can be applied to a source text that improve an exisiting, or backend, algorithm's ability to compress. This paper explores the latter strategy...
Novel Hardware-Software Architecture for the Recursive Merge Filtering Algorithm.
Piyush Jamkhandi, Amar Mukherjee Kunal Mukherjee, Robert Franceschini
As reconfigurable devices move to the forefront of mainstream processing, the spectrum of application areas for such devices is also increasing. One such area is image processing. In this paper we present a novel hardware-software codesign architecture for computation of the Discrete Wavelet Tranform(DWT), based on a new recursive Merge Filtering (RMF) algorithm. The architecture aims at reducing the overall data routing during computation of the DWT. The method shows how data routing can be transofrmed into a series of index computation carried out on reconfigurable device.
Download PowerPoint Presentation cancun.ppt (1488384)
|Copyright (C) 1996-2003, M5 Lab||
Maintained by: weifeng