Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2018 | 2018 25TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP) | Image coding, Ant Colony Optimization, Entropy, Color, Data compression |
Field | DocType | ISSN |
Ant colony optimization algorithms,Pattern recognition,Matrix (mathematics),Computer science,Algorithm,Travelling salesman problem,Compression ratio,Artificial intelligence,General-purpose computing on graphics processing units,Data compression,Cluster analysis,Genetic algorithm | Conference | 1522-4880 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| oliver giudice | 1 | 13 | 3.21 |
| Dario Allegra | 2 | 56 | 12.89 |
| Filippo Stanco | 3 | 139 | 28.91 |
| Giorgio Mario Grasso | 4 | 4 | 6.82 |
| Sebastiano Battiato | 5 | 659 | 78.73 |