|
|
|
|
|
|
Voici un petit algorithme particulièrement simple, couramment utilisé, et qui illustre bien comment on peut compresser des données, avec un taux typique entre 30% et 60%, et sans endommagement (le fichier décompressé est une copie conforme de l'original). Here the Huffman compression algorithm is presented in french. If you can't read french but are curious to see how it works, I recommend you to go and see the example. I think the drawing should be self explanatory.
Here I propose a UML/C++ implementation of the Huffman compression algorithm. A central class Zipper is developped, which proposes two main functions Zip and Unzip. A header file and the corresponding lib file are available for download. The set of classes have been designed with reusability in mind, and some additional reusable components have been extracted (separate download). Note: All library files (.lib) available here were built on a PC platform, using Borland C++ compiler. Please report to me how it works with other platforms, compilers (ex: VC++).
Now ready, in either french or english, a page on a reusable sort engine, along with UML diagrams, header and library files.
I am working on the design of a generic, multiple-document 3d engine. Here you will find screenshot, brief description of the engine, and downloads of test programs.
The JPEG compression Sooner or later, the JPEG format explained. For the moment, see my links page.
More work to do Fractal images: the Julia algorithm.
|