A Fast Palette Reordering Technique Based on GPU-Optimized Genetic Algorithms
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 (1)
Tasks
ClusteringGPUSimilar Papers 제목 키워드 기반
MetaPalette: A $k$-mer painting approach for metagenomic taxonomic profiling and quantification of novel strain variation
Metagenomic profiling is challenging in part because of the highly uneven sampling of the tree of life by genome sequencing projects and the limitations imposed by performing phylogenetic inference at fixed taxonomic ran…
Q-Palette: Fractional-Bit Quantizers Toward Optimal Bit Allocation for Efficient LLM Deployment
We study weight-only post-training quantization (PTQ), which quantizes the weights of a large language model (LLM) without retraining, using little or no calibration data. Weight-only PTQ is crucial for reducing the memo…
Factorization-in-Loop: Proximal Fill-in Minimization for Sparse Matrix Reordering
Fill-ins are new nonzero elements in the summation of the upper and lower triangular factors generated during LU factorization. For large sparse matrices, they will increase the memory usage and computational time, and b…
RecolorNeRF: Layer Decomposed Radiance Fields for Efficient Color Editing of 3D Scenes
Radiance fields have gradually become a main representation of media. Although its appearance editing has been studied, how to achieve view-consistent recoloring in an efficient manner is still under explored. We present…
Color ManipulationNeRFFast and Accurate Reordering with ITG Transition RNN
Attention-based sequence-to-sequence neural network models learn to jointly align and translate. The quadratic-time attention mechanism is powerful as it is capable of handling arbitrary long-distance reordering, but com…
DecoderFeature EngineeringMachine TranslationMorphological Inflection+3