CompuServe Messages

Vic, Ariel Thanks for your replies. There is an interesting recent paper on fast compression algorithms with very fast (~1 sec) decompression in the Proceedings of the 1990 International Conference on Pattern Recognition. IEEE publish these. The paper is: "Hierarchical Visual Pattern Image Coding" Dapang Chen and Alan C. Bovik I've been experimenting with variants on these methods to suit my problem since the conference in June. The algorithms are much faster than JPEG. Claimed compression figures for 3 example images (8 bit monochrome) are: Lena (girl): 16.7 – 31.7 Mandrill: 12.2 – 21.3 Peppers: 16.7 – 33.3 Usual 3 way trade offs, compression, speed, quality. For 24 bit color images the compression would be better. At the meeting decompression times of about 1 sec on a 68020 were claimed. I believe it. Bovik's address is: Laboratory for Vision Systems Department of Electrical and Computer Engineering The University of Texas at Austin Austin TX 78712-1084 Hope this is of interest Kevin e