Re: New lossless image compression algorithm
- From: Thomas Richter <thor@xxxxxxxxxxxxxxxxx>
- Date: Sun, 10 Feb 2008 23:47:27 +0100
Stefano Brocchi wrote:
I have developed a new lossless compression algorithm for true color
images, and created a website that describes it in detail. The
obtained compression ratios are still not comparable to the state of
art, but benchmarks report that the new algorithm outperforms the
widely used format PNG and gives results comparable to those of the
lossless mode of Jpeg2000.
State of the art lossless compression is actually JPEG-LS, not JPEG2000,
which has a low-complexity ultra-fast compression technique. It typically outperforms JPEG2000. The entropy coding technique used here is Golomb-coding (as simple as it is!).
The algorithm is based on Huffman coding to keep time requirements
low. There are also two new techniques (to my knowledge) that are
worth mentioning: a color filtering phase, made to reduce color
correlation on a local basis, and the use of polyominoes, to group and
encode conveniently similar values close to each other in the image.
On the site both the program and the Java source code are available
for download. There are also some pages about benchmark results and an
explanation of how the algorithm works. The link to the site is
http://www.researchandtechnology.net/pcif/index.php
The work on the algorithm is actually under development, so
suggestions are welcome
A couple of comments, maybe: The waterloo corpus is aged, and the images you use are too small to be useful. Niels Fröhlich recently made an extended corpus available, and the corpus used by the JPEG is also available (but beware, this is *huge*. Several hundred MBs, acutally.)
Concerning JPEG2000, this was mostly optimized towards photographic images and not computer generated images. If you want to compress the latter, JBIG2 might be your best bet (and not even JPEG-LS, which is also designed with natural images in mind). There is a recent effort to apply it to color images.
One of the design goals of JPEG2000 was to offer ultimate flexibility, which is why certain coding options haven't been considered. One of them is a better inter-color decorrelation, another the usage of inter-band correlations (e.g. the SPIHT algorithm uses them with good success, but wasn't picked because it's not as scalable as the EBCOT was).
You may find it amusing that in part-2 of JPEG2000 the color-transformation can be defined freely, and can be re-defined from tile to tile, i.e. each image tile can select from a set of pre-defined transforms. I'm not aware of a codec that really tries to exploit this, but there are at least two codecs out that would be able to decode those codestreams correctly. (-:
I would furthermore consider a more modern entropy coding backend, i.e. arithmetic coding.
Concerning Polynomios, I'm unclear whether this is a good model for image data. It would be helpful to give some insight into this.
So long,
Thomas
.
- Follow-Ups:
- Re: New lossless image compression algorithm
- From: Stefano Brocchi
- Re: New lossless image compression algorithm
- References:
- New lossless image compression algorithm
- From: Stefano Brocchi
- New lossless image compression algorithm
- Prev by Date: Re: Choose the best Rice index
- Next by Date: Re: Choose the best Rice index
- Previous by thread: New lossless image compression algorithm
- Next by thread: Re: New lossless image compression algorithm
- Index(es):
Relevant Pages
|
Loading