Papers, Documentation, and web pages that are mostly expository in nature. Note that a high percentage of academic papers are stored in either PostScript or compressed PostScript format.
VCEG is responsible for standardization of the "H.26x" line of video coding standards and related technologies. The FTP has a lot of materials produced by VCEG, including information on prospective H.265.
Created: 16/04/2008
by Maxim SmirnovMore...
Paper on "In-place calculation of minimum-redundancy codes" by Alistair Moffat ,& Jyrki Katajainen. Tells how to deal with Huffman codes in the efficient way.
Created: 16/05/2007
More...
Avisynth's homepage: download, documentation, FAQ, plugins (including a list of external plugins), community.
Created: 18/01/2008
by Maxim SmirnovMore...
Contains the code and tells about BWTS which does not need the index. It's what BWT should have been to be length preserving.
Created: 10/01/2008
More...
A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbols. Algorithm is based on certain features of p-adic numbers and p-adic norm. p-adic coding algorithm may be considered as of generalization a popular compression technique - arithmetic coding algorithms. It is shown that for p = 2 the algorithm works as integer variant of arithmetic coding; for a special class of models it gives exactly the same codes as Huffman's algorithm, for another special model and a specific alphabet it gives Golomb-Rice codes.
Created: 12/04/2007
More...
Library of technical articles along with code samples written and supported by Andrew Polar. Contains articles and source codes on Huffman and range coder. Readers may found another topics of interest not related to data compression, e.g. a simple Web server in sources.
Created: 11/02/2007
by Maxim SmirnovMore...
Nice article by Andrew Polar on arithmetic and range coders. It can be read even by those not very closely acquainted with data compression. The article contains source code attached. The additional merit of this text is a discussion on several patent-relating issues.
Created: 11/02/2007
by Maxim SmirnovMore...
Nelle immagini compresse con la quantizzazione dei coefficienti DCT si possono individuare senza alcuna difficoltà i bordi dei blocchi usati per la compressione. Questo fenomeno è spiacevole da vedere e quindi si deve tentare la sua riduzione, in questo documento si trattano alcune tecniche per farlo.
Created: 22/01/2007
More...
Paper and source code of an efficient binary adaptive encoder of iid sequences.
Outperforms several existing arithmetic-codes-based implementations (JBIG's Q-coder, H.264's CABAC) on short sequences.
Created: 22/01/2007
More...
Boris Ryabko is a well-known Russian scientist with main scientific interests in Information Theory, Prediction, Complexity of Algorithms,
Cryptography and Mathematical Biology. Probably, he is most known as an inventor of "bookstack" or "move-to-front" coding. There is a number of selected publications and reports regarding Information Theory and compression issues on his homepage. The primary language is English, some papers have Russian version.
Created: 14/10/2006
by Maxim SmirnovMore...
This article by Gary Sullivan and Stephen Estrop describes the 8-bit YUV formats that are recommended for video rendering in the Microsoft Windows operating system. This article presents techniques for converting between YUV and RGB formats, and also provides techniques for upsampling YUV formats. This article is intended for anyone working with YUV video decoding or rendering in Windows.
Created: 28/03/2006
by Maxim SmirnovMore...
The European Broadcasting Union (EBU) is the largest professional association of national broadcasters in the world. Cooperation in the technical sphere is one of the EBU's major activities. The Union is in the forefront of research and development of new broadcast media, and has led or contributed to the development of many new radio and TV systems: radio data system (RDS), digital audio broadcasting (DAB), digital television (DVB), high- definition TV (HDTV). There are a number of open publications on video and audio streaming and broadcasting, relevant marketing and production issues (see EBU Technical Review).
Created: 01/03/2006
by Maxim SmirnovMore...
Quantized Indexing is a new practical form of combinatorial (enumerative) coding. Under proper conditions it can be faster and tighter than arithmetic coding. There is a demonstrative source code, but no off-the-shelf working compressor though. There were quite a lot of talks on QI in comp.compression newsgroup recently. See this thread as an example.
Created: 16/02/2006
by Ratko TomicMore...
Tilman Liebchen from Technical University of Berlin did a lot of research in the field of lossless audio compression. He is the author of LPAC codec and he was actively involved in the development of MPEG-4 Audio Lossless Coding (ALS) standard. There are a number of useful papers on his page, including articles on MPEG-4 ALS. Some papers are in German.
Created: 11/02/2006
by Maxim SmirnovMore...
An overview of the Coding Technologies' aacPlus audio codec. This article describes the principles of traditional audio coders and their limitations when used for low bit-rate applications. The second part describes the basic idea of SBR technology and demonstrates the improvements achieved through the combination of SBR technology with traditional audio coders such as AAC and MP3.
Created: 31/01/2006
by Maxim SmirnovMore...
National Software Testing Labs (NSTL), employed by Microsoft, ran a proctored double-blind test that compared 64 kilobits per second (Kbps) WMA Pro (stereo) to the High Efficiency AAC Profile (HE AAC). The 12 segments of audio were presented by a proctor in a double-blind test to 300 individual listeners of both sexes and over a wide variety of ages. The paper states that 37% of the listeners preferred WMA Pro, 34% expressed identical preferences, and 29% preferred HE AAC.
Created: 31/01/2006
by Maxim SmirnovMore...
The text has some charts on G.711, G.723.1, G.729A performance with increasing packet loss and increasing latency.
Created: 30/01/2006
by Maxim SmirnovMore...
Pizza&Chili Corpus: Paolo Ferragina of the University of Pisa and Gonzalo Navarro of the University of Chile have a web site dedicated to the exploration of compressed indices. Paolo and Gonzalo have posted links to quite a few papers on full text compressed indices, which expound the notion that you can pick and choose exactly what you want to decompress. The site has collections of texts, links to people and papers, and a proposed API for testing work in the future.
Created: 22/01/2006
by Sachin GargMore...
Two papers in which it is show how to combine the BWT with the suffix array
data structure, in order to build a sort of compressed suffix array.
In the first paper it is proven that
the space occupancy of the compressed suffix array can be bounded in
terms of the entropy of the input string. In the second paper it is
proposed and tested a practical implementation of this data structure.\
The first paper will appear in the Proc. of 41st IEEE Symposium on
Foundations of Computer Science; the second one in the Proc. of the 12th
SIAM-ACM Symposium on Discrete Algorithms.
Created: 23/09/2000
by Mark NelsonMore...
Links to the articles from this journal dating back to 1953!
(As former Trans. of the IRE professional group on comm. systems.)
Quite a number of compression-related articles were published
in this title, although it aims at channel coding problems. The bad news is that you are only allowed to see the abstracts if you're not an IEEE member.
Created: 10/10/2005
by Maxim SmirnovMore...
A site of Iain Richardson, author of "Video Codec Design" and "H.264 and MPEG-4 Video Compression" books. The site has a very nice set of H.264 white papers, some useful links and other resources.
Created: 18/11/2001
by Mark NelsonMore...
The aim of this paper is to improve the performances of the JPEG2000. In fact, the approach named PJPEG2000 consists in inserting a phase of pretreatment before initiating the JPEG2000 process. This investigation allows better quality compression. When compressing images, noise is fatal to compression performance, it can be both annoying for the observer and make transmission of the imagery consume excessive amounts of bandwidth. The pretreatment based on the filtering reduces noise and thus improve both visual impression and transmission properties. The comparison between JPEG2000 and PJPEG2000 shows that the latter is favourable in both PSNR and WPSNR and in visual inspection evaluation.
Created: 09/09/2005
by Sachin GargMore...
By Jesper Larsson, Published in Proceedings of the IEEE Data Compression Conference 1996. Hey Jesper, how about putting a PDF version online?
Created: 26/04/2003
by Mark NelsonMore...
Home page of MNG: A PNG-like Image Format Supporting
Multiple Images, Animation and Transparent JPEG. Was released on 31 January 2001.
MNG includes a number of interesting features:
* object or sprite-based approach to animation, with commands to move, copy and paste images (rather than replicate them as in GIF)
* nested loops for complex animations
* way better compression than GIF animations
* support for difference (or ``delta'') images for still better compression
* integration of both PNG and JPEG-based (``JNG'') images
* support for transparent JPEG images
* low-complexity and very low-complexity subsets for simpler implementation
Created: 14/11/1999
by Mark NelsonMore...
An introduction to Shannon's notion of probabilistic entropy, from the viewpoint of ergodic theory and dynamical systems theory. Includes a complete proof a reasonably general (and useful!) version of the Asymptotic Equipartition Principle (AEP). Includes figures.
Created: 12/10/2002
by Mark NelsonMore...
"The Context Trees of Block Sorting Compression" - paper By Jesper Larsson. Published in Proceedings of the IEEE Data Compression Conference 1998, PDF version of the paper.
Created: 26/04/2003
by Mark NelsonMore...
"Universal Data Compression Based on the Burrows and Wheeler Transformation: Theory and Practice" by Bernhard Balkenhol, Stefan Kurtz, 1998. Yet another analysis of the algorithm. Any exciting conclusions?
Created: 01/12/1999
by Mark NelsonMore...
by Balkenhol, Bernhard; Kurtz, Stefan; Shtarkov, Yuri M. The authors discuss some statistical qualities of BWT output and improve on the algorithm's performance. This paper was presented at the 1999 Data Compression Conference.
Created: 05/08/2000
by Mark NelsonMore...
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.
Also available on http://sourceforge.net/projects/xmill
Created: 19/12/1999
by Mark NelsonMore...
A grey-scale wavelet compressor written in C. Includes pointers to source code and the paper presented on this work.
Created: 20/08/2000
by Mark NelsonMore...
A big batch of image compression papers are on line here. I guess the entire contents of all the papers is online thanks to the contributions of the US government. For image compression, this is a fantastic resource.
Created: 26/04/2000
by Mark NelsonMore...
Bernhard have written quite a few papers on data compression. A few of them are in German, a few in English. All in ps.gz format. Bernhard has links to published papers and preprints on this page, be sure to check them all.
Created: 02/04/2000
by Mark NelsonMore...
This page describes Flexible Parsing, a proposed extension for dictionary based LZ 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 for the longest phrase in the dictionary instead of trying to find the longest possible phrase at hand."
Created: 14/12/1999
by Mark NelsonMore...
by Balkenhol, Kurtz, and Shtarkov. A paper that was published at DCC 1999. Some thoughts about BWT and the context tree model, alphabet modification, modification of MTF, and Grouping of symbols.
NOTE:The file type would indicate that this is a compressed file, but it actually appears to be unencoded PS format.
Created: 01/12/1999
by Mark NelsonMore...
A paper by Brent Chapin and Steve Tate describing some improvements in BWT compression. The abstract says that compression can be improved by alphabet ordering and reflecting the sorted binary strings. This version is in PDF format, a PS format is available as well.
Created: 27/11/1999
by Mark NelsonMore...
The home of Wim Swelden's monthly Wavelet Digest. The home page includes some spiffy search capabilities, back issues, forum and so on.
Created: 19/11/1999
by Mark NelsonMore...
David Scott occupies a unique niche in the world of data compression. He is very interested in how one can adapt existing compression technologies to be bijective, a term you can find defined on his web page. The stated motivation for this is to increase the difficulty of breaking an encrypted version of the file. On this page, David makes a first pass at modifying BWT to be bijective. He doesn't quite get there, but feels that he has taken some good steps towards his goal.
Created: 21/09/2000
by Mark NelsonMore...
Mark Nelson's magazine articles, including articles on LZW coding, arithmetic coding, BWT, Zlib, JavaZip and some other topics.
Created: 23/11/1999
by Mark NelsonMore...
This site contains the comp.speech FAQ, and also has links to their ftp site, which contains software for speech codecs.
Created: 21/11/1999
by Mark NelsonMore...
The documentation page for zlib, the free software that implement's PKWare's deflate algorithm. Contains links to the zlib specification, and the gzip specification. Links to versions all over the world, in HTML, ASCII, or PostScript.
Created: 23/08/2001
by Mark NelsonMore...
Home of Portable Network Graphics (PNG image format), Multiple-image Network Graphics (MNG and JNG image formats) and, of course, libpng (the free reference library for reading and writing PNGs). The source for libpng and zlib. Can't do PNG without them.
Created: 14/11/1999
by Mark NelsonMore...
The page contains prepublished versions of H.263 standard, H.264 / AVC standard, H.264 conformance specification, H.264 reference software specification. Other pages of the site--it's the homepage of the video trace research group at Arizona State University--have some papers and software.
There are also several video testing sequences. The sequences are in the common YUV 4:2:0 format (files are zipped) and in CIF (Bridge close, Bridge far, Highway, Mobile, Paris) and QCIF resolutions (Bridge close, Bridge far, Carphone, Claire, Container, Foreman, Grandma, Highway Mother and Daughter, News, Salesman, Silent).
Created: 11/07/2005
by Maxim SmirnovMore...
Not a bad site on wavelets in common, JPEG2000 and digital signal processing using wavelets. The main content is books, papers, thesises, sources. Partially in Russian, but there are a lot of English papers. There is a steganography page as well.
Created: 11/07/2005
by More...
This ftp site contains the PKZIP and InfoZip appnotes in various incarnations, plus RFCs 1950, 1951, and 1952. It is referenced in the zlib docs as if it were the official location for the gzip specification. If you are attempting to understand the format of PKZIP archives you need this document Copies of RFCs 1950, 1951, and 1952 are here as will.
Created: 07/11/1999
by Mark NelsonMore...
From the site: Computer images are extremely data intensive and hence require large amounts of memory for storage. As a result, the transmission of an image from one machine to another can be very time consuming. By using data compression techniques, it is possible to remove some of the redundant information contained in images, requiring less storage space and less time to transmit. Neural nets can be used for the purpose of image compression, as shown in the following demonstration.
Created: 02/11/1999
by Mark NelsonMore...
A page which links to about 70 online papers & books on the topics of enumerative (combinatorial) coding, arithmetic coding, universal codes. Truly a gem.
There are here some hard to find papers, Ph.D. theses (#23,#36,#42), books (#3 Abramson 1963 classic on Inf. Theory and coding, #37, #38 combinatorics textbook). Among the online papers: #27 from Rissanen (who invented arithmetic coding in 1976) on math of arithmetic coding (dual radix representation). Also interesting and hard to find #28,#33, #11 (Schalkwijk on lattice walks on Pascal triangle for enum. coding), #61-#62 on potentially fast combinatorial codes, #60 fast unranking … etc.
Created: 25/06/2005
by Sachin GargMore...
Charles is the author of PPMZ and has a really great collection of software he has written on this page, much of it is indexed here in the appropriate pages. His home page also contains links to some interesting papers and descriptions on various algorithms, as well as some archived posts that explain some compression topics. It's well worth nosing around this site a bit for more information.
Created: 25/12/1998
by Mark NelsonMore...
Byte pair encoding (BPE) is a simple universal text compression scheme with fast decompression which requires small work space which allows decompression of an arbitrary part of the original text. Compression is rather slow with ratios less than Lempel-Ziv type compression. This paper, brings out a potential advantage of BPE compression showing that it is very suitable from a practical view point of compressed pattern matching, where the goal is to find a pattern directly in
compressed text without decompressing it explicitly.
Created: 12/06/2005
by Sachin GargMore...
Quite a number of information theory classic papers. The parent node http://cg.ensmp.fr/~vert/proj/bibli/ has additional related articles.
Created: 13/06/2005
by Maxim SmirnovMore...
The Waterloo Fractal Compression Project is part of a general research programme dedicated to the study of fractal analysis and Iterated Function Systems/Fractal Transforms from both theoretical as well as practical perspectives.
Created: 14/11/1999
by Mark NelsonMore...
Burrows, M. and Wheeler, D.J., A Block-sorting Lossless Data Compression Algorithm, Digital Systems Research Center Research Report 124, May 1994. The original paper on BWT compression. This very effective compression technique was first described in this paper.
Michael Schindler reviewed it thus:Even through it is the first paper about blocksort it is still excellent literature for introduction to this method and its general ideas..
Note: after many years, the DEC web site hosting this paper finally disappeared, not surprisingly. The new link is via the CiteSeer search engine, which I hope is a permanent solution.
Created: 09/06/2002
by Mark NelsonMore...
An impressive set of links to papers, schedules, articles, and contacts for MPEG. Clearly the place to go for information relating to the standardization process.
Created: 15/05/2004
by Mark NelsonMore...
by A.Ratushnyak. A short discussion related to the compression of audio and pictures. A Library readher had this to say: Worth reading 2 or 3 times.
Created: 18/03/2001
by Mark NelsonMore...
A big batch of pointers to various MPEG documents. Includes press releases and docs on MPEG-2, MPEG-4, MPEG-7, and AAC.
Created: 14/11/1999
by Mark NelsonMore...
The range encoder is a fast multisymbol entropy coder (similar to arithmetic coding) with GNU general public license (other licenses on request). Its compression is within 0.01% of arithmetic coding. It is based on an article dated 1979, so it is believed to be patent free. This page includes a PS format paper by G.N.N Martin describing the range encoder.
Created: 28/10/1999
by Mark NelsonMore...
Alistair Moffat has put together all the links to his source code and articles on Arithmetic Coding in one tidy place.
Created: 19/11/1999
by Mark NelsonMore...
Steven Pigeon's Ph. D Thesis from the University of Montreal. Proposes a new set of universal codes, which he dubs taboo codes, as well as new optimization algorithms for (Start, Step, Stop) codes. Plus lossy variations on LZW.
Created: 17/03/2003
by Mark NelsonMore...
D. T. Hoang, P. M. Long and J. S. Vitter. ``Dictionary Selection using Partial Matching,'' Information Sciences, 119(1-2), 57-72, 1999. This paper describes an attempt to squeeze improved compression out of existing dictionary-based schemes by using multiple context-based dictionaries for encoding.
Created: 08/04/2002
by Mark NelsonMore...
by P. G. Howard and J. S. Vitter. This paper shows how images can be encoded and decoded using parallel processing. Both Huffman and arithmetic coding are examined.
Created: 28/07/2002
by Mark NelsonMore...
This page contains a paper "Improved Huffman coding using recursive splitting" that describes a program that attempts to improve on Huffman compression by manipulation of the data stream.
Created: 09/12/1999
by Mark NelsonMore...
Daniel Ricardo has a new algorithm for generation of Huffman codes. He claims superior performance and small memory footprint. Algorithm description here, but no code.
Created: 22/09/2001
by Mark NelsonMore...
It's a page on Huffman and Shannon-Fano methods on the Russian compression.ru site. It contains a number of papers and sources, and the major part is in English. It's unlikely that you will have any problems with downloading, since the titles are in English.
Created: 21/03/2005
by Maxim SmirnovMore...
In this paper we present a method that uses Genetic Algorithms (GAs) to find a Local Iterated Function System (LIFS) that encodes a single image. By doing this, the time needed to achieve this LIFS is reduced by about compared with Barnsley's method if similar image quality is desired. If less quality is acceptable, using a GA we can vary the time the encoding will take by changing parameters such as population size and number of generations allowed.
Created: 12/09/2004
by Mark NelsonMore...
A dissertation by Keith Howell which evaluates the suitability of Fractal Compression for spacecraft images. Keith says he is willing to supply source code upon request.
Created: 29/07/2004
by Mark NelsonMore...
I'm pleased to announce with my co-authors availability of a preprint on our new algorithm to estimate the Shannon entropy rate (bits/symbol) or (bits/sec) of an observed sequence of low-alphabet symbols. It uses the Context-Tree-Weighting universal compression method, but doesnot use the compression ratio directly as an entropy estimator but as a scaffold for a Bayesian estimate. The result is significantly lower bias.
Created: 10/07/2004
by Mark NelsonMore...
An updated and translated version of our German paper "Proseminar Datenkompression - Arithmetische Kodierung" from 2001. To the best of our knowledge, it is the first comprehensive paper that describes the whole way from the basic principles of AC up to a simple implementation, fully documented with C++ source code.
Created: 06/06/2004
by Mark NelsonMore...
by Ziv and Lempel. The seminal LZ78 paper which spawned LZW, GIF, and an entire academic industry.
Update 2004: Document is now packed in RAR format.
Created: 16/05/2004
by Mark NelsonMore...
The 1977 paper describing an algorithm for compression using pointers to previously seen text. This algorithm, later known as LZ77, is still one of the most widely used techniques for lossless data compression in use today.
Update 2004: Document is now packed in RAR format.
Created: 16/05/2004
by Mark NelsonMore...
This group at Loughborough University in the UK would like to use sophisticated compression techniques in high speed networks. To make it all happen, they need to do it in hardware, and do it in parallel. This page has information about their efforts, along with links to papers and other information.
Created: 15/05/2004
by Mark NelsonMore...
From Microsoft: This document describes Binary Delta Compression (BDC) technology and its use in software update deployment. This implementation of BDC technology developed by Microsoft reduces the download size of software update packages by downloading only the differences between old files and new files.
Created: 04/04/2004
by Mark NelsonMore...
A paper by Diego Santa Cruz, Touradj Ebrahimi, Mathias Larsson, Joel Askelof and Charilaos Cristopoulos. According to the abstract, this paper discusses ways to decode regions of an image on the fly without needing to do a complete decode of the entire image.
Created: 07/03/2004
by Mark NelsonMore...
by Maryline Charrier, Diego Santa Cruz and Mathias Larsson. This short paper gives an overview of the JPEG2000 standard, along with a java decoder.
Created: 07/03/2004
by Mark NelsonMore...
by Diego Santa-Cruz and Touradj Ebrahimi. A paper to be published in Proc. of the IEEE International Conference on Image Processing (ICIP), September, 2000.
Created: 07/03/2004
by Mark NelsonMore...
A paper by Timothy McLaughlin that gives an overview of HTTP Compression and tries to decide whether it's a good thing for not.
Created: 07/03/2004
by Mark NelsonMore...
A paper by Eduardo Enrique Gonzalez Rodriguez that describes a proposed new method of entropy encoding. Eduardo overcomes some of the problems faced by Huffman coding in certain circumstances, such as a very small alphabet.
Created: 05/10/2003
by Mark NelsonMore...
A survey paper that covers the current roster of popular encoding algorithms, such as Base64, Base32, Hex, etc.
Created: 01/10/2003
by Mark NelsonMore...
by Jurgen Abel and William Teahan. This paper looks at a few different techniques for preprocessing data before performing text compression, and compares the gains achieved when combining the preprocessors with PPM, BWT, and LZ algorithms.
Created: 19/07/2003
by Mark NelsonMore...
Robert Estes (UCDavis - image compression research). Robert has pointers to many of his papers on this page. He has info on Wavelet-based image compression, image compression, plus some peripherally related topics such as image quality.
Created: 26/05/2003
by Mark NelsonMore...
Current research projects in our lab include research into vector quantization (VQ), wavelets, image compression, edge detection using VQ, VQ for image browsing, VQ design for noisy channels, halftoning, and color palette management.
Created: 04/05/2003
by Mark NelsonMore...
By Jesper Larsson. Published in Proceedings of the IEEE Data Compression Conference 1998, a PDF version of the paper.
Created: 26/04/2003
by Mark NelsonMore...
by Jesper Larsson. Technical report. LU-CS-TR:98-204, LUNFD6/(NFCS-3134)/1-6/(1998). A PDF version of the paper.
Created: 26/04/2003
by Mark NelsonMore...
By Jesper Larsson, Arne Andersson and Kurt Swanson. Technical report. LU-CS-TR:95-158, LUNFD6/(NFCS-3107)/1-14/(1995). Early version of a paper published in Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching 1996; to appear in Algotrithmica
Created: 26/04/2003
by Mark NelsonMore...
Jesper Larsson spent a fair amount of his years in academia
studying Suffix Trees. His home page has links to his thesis and a few other papers on suffix trees and other string matching/Data Compression topics.
Created: 23/04/2003
by Mark NelsonMore...
This is another German preprint of Jurgen Abel describing the principles of the Burrows-Wheeler Compression Algorithm. An
implementation of a BWT based compressor with a compression rate of 2.25 bps on the Calgary Corpus is presented. The paper will be
published in the German journal "Informatik - Forschung und Entwicklung", Springer-Verlag Heidelberg, Association for Informatics
(Gesellschaft fur Informatik eV.)
Created: 14/04/2003
by Mark NelsonMore...
This preprint of Jurgen Abel gives a short introduction into the BWCA field and proposes several improvements for the WFC stage and the IF stage.
It further introduces a new RLE scheme for bypassing the run length
information around the WFC stage. The paper is the basis of the
BWCA program ABC and the revealed approach achieves a
compression rate of 2.238 bps, which is the best result for a pure
BWCA without any preprocessing before the BWT to date (March 2003).
Created: 22/03/2003
by Mark NelsonMore...
The whole contents of the journal, dating back to 1953. If only you were a member of the society, you could read all these great papers.
Created: 21/03/2003
by Mark NelsonMore...
Context Tree Weighting (CTW) has been a technique with great promise, but it hasn't ever been able to reach the critical mass needed to become more than a curiousity. Jurgen Abel is doing his best to overcome that problem. He's created a nice reference page for CTW on his data-compression.info web site. He has references to a few papers, a few people, and one piece of source code.
Created: 21/03/2003
by Mark NelsonMore...
This is a preprint of a paper by Jurgen Abel describing the functionality
of a basic but quite fast Burrows-Wheeler compressor. Jurgen reports that this will be published in PIK, a German-language journal on Communications and Information Theory.
Created: 21/03/2003
by Mark NelsonMore...
Jurgen Abel has done an enormous amount of research on the Burrows-Wheeler Transform, and has published the results on his web site. On this page you will find:
A summary of this compression technique.
Links to over 70 online papers.
Links to at least that many people involved in BWT research or development.
Extensive links to BWT source code.
This web page may now be the definitive source of information for this field.
Created: 18/03/2003
by Mark NelsonMore...
Filip is interested in wavelets and image restoration. In addition to a nice page of links (navigate from the main page) he has some software, publications, test results, and more.
Created: 17/03/2003
by Mark NelsonMore...
John Robinson's page on BTPC, which includes documentation, samples, links, and source. BTPC is designed to do both lossy and lossless compression of images.
John updated this package to version 5 in March, 2003.
Created: 13/03/2003
by Mark NelsonMore...
