{'fraction_non_alphanumeric': 0.012468827930174564, 'fraction_numerical': 0.0012468827930174563, 'mean_word_length': 5.224806201550388, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Codebook design by a hybridization of ant colony with improved LBG algorithm

Ant colony algorithm is a newly emerged stochastic searching optimization algorithm in recent years. In this paper, an appropriately adapted ant colony system embedded with a simple improved LBG algorithm is proposed for vector quantization codebook design. The emphasis is put on the design of the probability transfer function and the tabu list in the ant colony algorithm, the utilization of the next nearest neighborhood in the LBG algorithm, as well as the update of the pheromone in both local and global sense. Experimental results show that the new algorithm outperforms other well-known codebook design algorithms, and particularly, the improvement of PSNR exceeds 2 dB compared with the conventional LBG algorithm.