Author Page
MrSID by LizardTech
LizardTech has developed a portable image format called MrSID that is used by people who have huge files and want to render them in a nearly lossless manner. I think the idea is to render it on a given output device using just as many pixels as is absolutely necessary. Looks like they are pitching […]
A C++ wrapper class for the zlib
A short but sweet wrapper that lets you stream input and output using zlib’s deflate engine.
Note that in order to get this code to work with gcc, you might have to add the following lines of code:
int zapeof( char c ) { return 1; }
int zapeof( int c ) { return 1; }
http://www.geocities.com/SiliconValley/Lakes/2883/zlibwra.html
Public Source Code Release of Matching Pursuit Video Codec
This codec appears to use techniques which are compatible with H.263 and MPEG-2, although it is not compatible with those standards. The Matching Pursuit algorithm is used in place of DCT after motion compensation.
Oingo’s Compression Algorithms Page
Oingo is a human-edited directory, sort of a super-duper search engine.
4i2i Communications Systems
These folks make H.261 and H.263 codecs for applications that need video compression. They have source and object software for the PC, as well as IP versions of their hardware design. The web site is reputed to have demo versions of some of their software.
Xmill - An Efficient Compressor for XML
Those folks at AT&T have developed a compressor that can be used to squeeze individual data items in XML documents. AT&T says this is “essentially free” software. Read the license on-line to determine exactly what that means.
One to One Compression
This site discusses a characteristic of some compression algorithms that the author refers to as One to One compression. In a nutshell, this property means that for any file X, F( F’( X ) ) == X. (F is either the compressor or decompressor, and F’ is its opposite number.) This is definitely not the […]
Finite context modeling
An article by Arturo Campos that describes and discusses Finite Context Modeling. This modeling technique is uses by PPM compressors, although Campos makes the point that the ideas in this article can be used in other compressors as well.
Xmill paper
A technical paper describing the principles behind Xmill, the AT&T package that compresses XML data items.
Current Status of PNG
Want to know how things are going in the world of PNG? Come check this page from time to time. See the current ratings for Stability, User Acceptance, Application Support, and so on.
PPMD Var ‘E’ (Dmitry Shkarin)
Another version of the PPMD program by Dmitry Shkarin. Readme says this includes a bug fix, and removal of one model.
David’s Compression Page
This page has a some Huffman compression code that has been adapted to implement a unique property that author refers to as one to one compression. In a nutshell, this property means that for any file X, F( F’( X ) ) == X. (F is either the compressor or decompressor, and F’ is its […]
Adaptive Huffman Encoding
A library to perform adpative Huffman coding as described by Knuth in J. Alg. Nice clean looking C source code.
This link continues to be one of the most popular links at DataCompression.info. Reader Karl M. had this comment about the page: The program has a few problems converting from one-based to zero-based arrays. The […]
Charles Bloom’s Adaptive Huffman Program
This is a fairly small C program that was developed on the Amiga.
Note: I’m not sure why, but this page gets a very high number of ratings, nearly all very favorable, although Kate W. did claim: Parts missing from the source code, can’t build.
Proof of Theorem 3.7 The Huffman tree is optimal.
A nice tidy proof that the Huffman tree is an optimal prefix code for a given message. Note that a library reader finds that there is an error in the fixed-length codes listed in Table 1, a and b have duplicate values.
Programmer’s Heaven Compression Programs
A really nice set of programs and source code for all sorts of data compression. This area doesn’t appear to be actively maintained, so there are plenty of out-of-date files, but good stuff mixed in as well.
Data Compression - Static Defined-Word Schemes
A very nice description of Huffman coding, as well as a few other types of coding. I believe this is part of a survey paper by Debra A. Lelewer and Daniel S. Hirschberg.
Huffman Coding
The Data Compression Reference Center talks about Huffman coding. A short but fairly succint explanation.
This link points to an archived site, as the original has disappeared. Links on the archived page may or may not work properly.
Welcome to the Binary Huffman Coding demonstration
Another java graphical demonstration of Huffman tree building.
http://www.ee.uwa.edu.au/~roberto/teach/itc314/java/Huffman/
Flexible Parsing (FP) - The Optimal Parsing for Dictionary Based Compression
This page describes Flexible Parsing, a proposed extension for dictionary based compression schemes. Yossi Matias, Nasir Rajpoot, and Cenk Sahinalp have a summary of their work on this page, along with links to three PS format papers that go into detail on the results. The authors summarize this improved technique as “looking one step ahead […]
An Optimizing Hybrid LZ77 RLE Data Compression Program
An Optimizing Hybrid LZ77 RLE Data Compression Program, aka Improving Compression Ratio for Low-Resource Decompression by Pasi Ojala.
Presents a new literal tagging system, a fast exhaustive string
match algorithm, an optimal parsing algorithm, and results on
Calgary Corpus and Canterbury Corpus.
limes datentechnik® gmbh
These folks deliver a tool called FLAM which uses a patented data compression algorithm to do something. The site has English and German language versions, but doesn’t seem to have any detailed information on FLAM.
Improved Huffman coding using recursive splitting.
This page contains a paper that describes a program that attempts to improve on Huffman compression by manipulation of the data stream.
Top Ten Reasons why Fractal Image Compression is not Fractal
A not very serious trashing of fractal compression.
Independent JPEG Group
The Independent JPEG Group is a source of free JPEG software. It is in wide use. Oddly enough, the groups home page doesn’t have anything interesting on it except a link to an ftp site, and a link to a couple of FAQs.
An Algorithmic Study on Lossless Image Compression
by Xiaolin Wu, University of Western Ontario. A paper on the CALIC algorithm, first presented at DCC 96. This file is in PS format.
Lossless Compression of Continuous-Tone Images via Context Selection, Quantization, and Modeling
by Xiaolin Wu, University of Western Ontario. A paper on high performance lossless image compression. I’m not sure if this paper was a predecessor to CALIC/JPEG-LS or not.
The Design and Analysis of Efficient Lossless Data Compression Systems
by Paul Glor Howard, Brown University, 1993. This thesis looks at statistical methods for performing data compression.
Graphics and Image File FTP Archives and WWW Pages
A collenction of links to graphics file format information.
http://www.ora.com/centers/gff/gff-faq/gff-faq1.htm#FILE_ARCS
http://www.ora.com/centers/gff/index.htm
The home page of the Encyclopaedia of Graphics File Formats.
