.png){kind=icon}
Return
Tabu search algorithm for codebook generation in vector quantization
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(97)00127-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A tabu search algorithm is proposed for the codebook generation in Vector quantization. The key question is the definition of neighboring solution. Making random modifications to the current solution alone is not sufficient. The proposed algorithm first makes non-local changes to the codebook which is then fine-tuned by the generalized Lloyd algorithm (GLA). For a set of gray-scale images, the new algorithm was better than GLA alone, and its results were comparable to simulated annealing. For binary images, the tabu search approach gave the best MSE-values. (C) 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keywords:
vector quantization
codebook generation
clustering problem
tabu search
image compression
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
ShareSaveTuning the Sensing Performance of Multilayer Plasmonic Core–Satellite Assemblies for Rapid Detection of Targets from Lysed Cells.png)
ACS Sensors
ACS SensorsIF0
PREAI
ShareSaveGenomic Mining for Novel FADH2-Dependent Halogenases in Marine Sponge-Associated Microbial Consortia
PREAI
ShareSave no more
no more