Color re-indexing is one of main approaches for improving the loss-less compression of color indexed images. Zero-order entropy reduction of indexes matrix is the key to obtain high compression ratio. However, obtaining the optimal re-indexed palette is a challenging problem that cannot be solved by brute-force approaches. In this paper we propose a novel re-indexing approach where the Travelling Salesman Problem is solved through Ant Colony Optimization. Our method is proved to achieve high quality results by outperforming state-of-art ones in term of compression gain. Additionally, we exploit clustering and GPU computing to make our solution extremely fast.
Titolo: | A FAST PALETTE REORDERING TECHNIQUE BASED ON GPU-OPTIMIZED GENETIC ALGORITHMS | |
Autori interni: | ||
Data di pubblicazione: | 2018 | |
Serie: | ||
Handle: | http://hdl.handle.net/20.500.11769/361904 | |
Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |