Codebook design algorithm for image vector quantization based on improved artificial bee colony

2013 ◽  
Vol 33 (9) ◽  
pp. 2573-2576 ◽  
Author(s):  
Yanju GUO ◽  
Lei CHEN ◽  
Guoying CHEN
2017 ◽  
Vol 17 (03) ◽  
pp. 1750017 ◽  
Author(s):  
Ahmed A. Abdelwahab

Block coding is well known in the digital image coding literature. Vector quantization and transform coding are examples of well-known block coding techniques. Different images have many similar spatial blocks introducing inter-image similarity. The smaller the block size, the higher the inter-image similarity. In this paper, a new block coding algorithm based on inter-image similarity is proposed where it is claimed that any original image can be reconstructed from the blocks of any other image. The proposed algorithm is simply a vector quantization without the need to a codebook design algorithm and using matrix operations-based fast full search algorithm to find the local minimum root-mean-square error distortion measure to find the most similar code block to the input block. The proposed algorithm is applied in both spatial and transform domains with adaptive code block size. In the spatial domain, the encoding process has fidelity as high as 36.07[Formula: see text]dB with bit rate of 2.22[Formula: see text]bpp, while in the transform domain, the encoded image has good fidelity of 34.94[Formula: see text]dB with bit rate as low as 0.72[Formula: see text]bpp on the average. Moreover, the code image can be used as a secret key to provide secure communications.


2019 ◽  
Vol 10 (2) ◽  
pp. 48-59
Author(s):  
Zeeshan Danish ◽  
Habib Shah ◽  
Nasser Tairan ◽  
Rozaida Gazali ◽  
Akhtar Badshah

Data clustering is a widespread data compression, vector quantization, data analysis, and data mining technique. In this work, a modified form of ABC, i.e. global artificial bee colony search algorithm (GABCS) is applied to data clustering. In GABCS the modification is due to the fact that experienced bees can use past information of quantity of food and position to adjust their movements in a search space. Due to this fact, solution search equations of the canonical ABC are modified in GABCS and applied to three famous real datasets in this work i.e. iris, thyroid, wine, accessed from the UCI database for the purpose of data clustering and results were compared with few other stated algorithms such as K-NM-PSO, TS, ACO, GA, SA and ABC. The results show that while calculating intra-clustering distances and computation time on all three real datasets, the proposed GABCS algorithm gives far better performance than other algorithms whereas calculating computation numbers it performs adequately as compared to typical ABC.


Sign in / Sign up

Export Citation Format

Share Document