An algorithm for lossy compression of scanned map images is proposed. The algorithm is based on color quantization, efficient statistical context tree modeling and arithmetic coding. The ratedistortion performance is evaluated on a set of scanned maps and compared to JPEG2000 lossy compression algorithm, and to ECW, which is a commercially available solution for compression of satellite and aer...

This paper proposes a universal variable-length lossless compression algorithm based on fountain codes. The compressor concatenates the Burrows-Wheeler block sorting transform (BWT) with a fountain encoder, together with the closed-loop iterative doping algorithm. The decompressor uses a Belief Propagation algorithm in conjunction with the iterative doping algorithm and the inverse BWT. Linear-...

Data compression algorithms can be categorized into lossless and lossy. Bit streams generated by lossless compression algorithm can be faithfully recovered to the original data. If loss of one single bit may cause serious and unpredictable consequences in original data (for example, text and medical image compression) lossless compression algorithm should be applied. If data consumers can toler...

Abstract Sample compression using

Lots of repetition units exist in digital multimedia especially television programmes and other kinds of broadcastings. In this paper a new information compression algorithm named Auditory Content-Based Information Compression (ACBIC) is proposed to detect repeated programme segments in order to further reduce information redundancy. This algorithm is quite different from former data compressio...