Image compression based on vector quantization using cuckoo search optimization technique

Abstract Most common vector quantization (VQ) is Linde Buzo Gray (LBG), that designs a local optimal codebook for image compression. Recently firefly algorithm (FA), particle swarm optimization (PSO) and Honey bee mating optimization (HBMO) were designed which generate near global codebook, but search process follows Gaussian distribution function. FA experiences a problem when brighter fireflies are insignificant and PSO undergoes instability in convergence when particle velocity is very high. So, we proposed Cuckoo search (CS) metaheuristic optimization algorithm, that optimizes the LBG codebook by levy flight distribution function which follows the Mantegna’s algorithm instead of Gaussian distribution. Cuckoo search consumes 25% of convergence time for local and 75% of convergence time for global codebook, so it guarantees the global codebook with appropriate mutation probability and this behavior is the major merit of CS. Practically we observed that cuckoo search algorithm has high peak signal to noise ratio (PSNR) and better fitness value compared to LBG, PSO-LBG, Quantum PSO-LBG, HBMO-LBG and FA-LBG at the cost of high convergence time.