Papers › A Fast Palette Reordering Technique Based on GPU-Optimized Genetic Algorithms
A Fast Palette Reordering Technique Based on GPU-Optimized Genetic Algorithms
Oliver Giudice, Dario Allegra, Filippo Stanco, Giorgio Grasso, Sebastiano Battiato
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
1 archive task tag without a task page not shown.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections