Abstract
Colour quantised images consist of a colour palette which contains all colours in the image and an index image which still constits of indices into the palette to make up the image. The index image still contains a large amount of redundant information and can therefore be compressed using lossless image compression algorithms. The achieved compression ratio however depends on the ordering of colour in the palette. In this paper we show that a generic optimisation technique such as simulated annealing can be used reorder the palette entries for subsequent JPEG2000 lossless compression of the index information, and demonstrate that our approach allows for improved compression compared to previous reordering techniques.
Original language | English |
---|---|
Title of host publication | 13th International Conference on Soft Computing: Evolutionary Computation, Genetic Programming, Fuzzy Logic, Rough Sets, Neural Networks, Fractals, Bayesian Methods, MENDEL 200 |
Pages | 117-121 |
Number of pages | 5 |
Volume | 2007-January |
Publication status | Published - 2007 |
Keywords
- Colour palette
- Colour quantisation
- Image compression
- Optimisation
- Simulated annealing