Archives
RAD Game Tools
Makers of Blink and Smacker, a pair of Video codecs targeted towards game developers. These products appear to be carefully targeted towards the perfomance needs of PC-based games.
http://www.radgametools.com/Cysip DSP Courses
These folks offer some seminars on communcations. On their page, if you go to the links to free software, you will find Matlab code for CELP and LPC Vocoders. This same page also has a wide variety of links for speech coding stuff.
http://www.cysip.com/IEEE International Conference on Acoustics, Speech, and Signal Processing
This conference is being held June 5-9 in Istanbul Turkey. The call for papers deadling is June 10, 2000. This is the 25th anniversary meeting of the ICASSP.
http://icassp2000.sdsu.edu/read more from " IEEE International Conference on Acoustics, Speech, and Signal Processing "
comp.speech FAQ
A web site containing the comp.speech FAQ. In particular, you will be interested in section 3 for this FAQ, which discusses speech coding and compression.
http://svr-www.eng.cam.ac.uk/comp.speech/UnicodeCompressor : another alphaworks technology
IBM has developed a pair of Java clases that compress Unicode according to the Standard Compression Scheme for Unicode. Looks like they might be giving it away here.
http://www.alphaworks.ibm.com/tech/UnicodeCompressorread more from " UnicodeCompressor : another alphaworks technology "
MegaSafe
MegaSafe is advertised as being “one finger archive control of your critical data.” I’m not sure what that means, and there is not much more description than that on the web site.
http://venus.spaceports.com/~donsoft/downmega.htmlJPEG2000 wavelet compression spec approved
At long last the JPEG 2000 spec has been approved. Developers can now start working on products that will support this quantum leap in image compression.
http://www.eet.com/story/OEG19991228S0028read more from " JPEG2000 wavelet compression spec approved "
Maxime Zakharov - Compression Links
Compression links to papers and web sites, mostly in Russian language.
http://sochi.net.ru/~maxime/compression.shtmlMrSID 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 […]
http://www.lizardtech.com/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; }
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.
http://www-video.eecs.berkeley.edu/download/mp/read more from " Public Source Code Release of Matching Pursuit Video Codec "
Oingo’s Compression Algorithms Page
Oingo is a human-edited directory, sort of a super-duper search engine.
http://www.oingo.com/topic/11/11238.html4i2i 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.
http://www.4i2i.com/products.htmXmill - 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.
http://www.research.att.com/sw/tools/xmill/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 […]
http://bijective.dogma.net/compres1.htmFinite 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.
http://www.arturocampos.com/ac_finite_context_modeling.htmlXmill paper
A technical paper describing the principles behind Xmill, the AT&T package that compresses XML data items.
http://www.cis.upenn.edu/~liefke/papers/xmill.ps.gzCurrent 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.
http://www.libpng.org/pub/png/pngstatus.htmlPPMD 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.
ftp://ftp.nsk.su/.3/windows/compress/ppmde.zipDavid’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 […]
http://bijective.dogma.net/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 […]
http://www.xcf.berkeley.edu/~ali/K0D/Algorithms/huff/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.
http://www.cbloom.com/src/adaphuff.zipProof 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.
http://maths.abdn.ac.uk/~igc/tch/mx4002/notes/node59.htmlread more from " Proof of Theorem 3.7 The Huffman tree is optimal. "
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.
http://www.programmersheaven.com/zone22/mh142.htmData 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.
http://www.ics.uci.edu/~dan/pubs/DC-Sec3.htmlread more from " Data Compression - Static Defined-Word Schemes "
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/read more from " Welcome to the Binary Huffman Coding demonstration "
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 […]
http://www.dcs.warwick.ac.uk/~nasir/work/fp/read more from " Flexible Parsing (FP) - The Optimal Parsing for Dictionary Based Compression "
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.
read more from " An Optimizing Hybrid LZ77 RLE Data Compression Program "
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.
http://www.limes-datentechnik.de/