A quantization based codebook formation method of vector quantization algorithm to improve the compression ratio while preserving the visual quality of the decompressed image

被引:2
作者
Barman, Dibyendu [1 ]
Hasnat, Abul [1 ]
Barman, Bandana [2 ]
机构
[1] Govt Coll Engn & Text Technol, Berhampur, WB, India
[2] Kalyani Govt Engn Coll, Nadia, WB, India
关键词
Codebook; Codeword; Compression ratio; Image compression; Psnr; Ssim; Vector quantization;
D O I
10.1007/s11045-022-00856-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
An extremely difficult problem in an image compression method is increasing the compression ratio while maintaining the visual quality of the image. One of the popular imae compression strategies that can be found in literature is vector quantization. The size of the Codebook and Index matrix created as a result of this procedure determines how effective it is. The Codebook has a size of nc*cwd, where cwd is the codeword dimension and nc is the number of clusters. These n number of codewords do not all have an equal impact on the visual quality of the decompressed image. Some of these are essential for rebuilding the decompressed image, while others are less significant. In this paper, a novel strategy is put forth to divide a codebook's nc number of codewords into two groups. The codewords used most frequently in reconstructing the image are in one section, while the rest are included in the second group of less crucial codewords. The first group's codewords are left in tact to preserve the decompressed image's visual quality, but the second group's codewords are quantized into two bit values, namely 0, 1, 2, and 3, to increase compression ratio. The suggested technique is used on numerous colour images from the UCIDv.2 database as well as images from the standard image database. Peak signal to noise ratio, structural similarity index measure and Compression Ratio are used to analyse the experimental outcomes. Depending on the size of the original image, experimental results reveal that the suggested method reduces the codebook size by 32.01-54.80% while maintaining the quality of the decompressed image. This greatly improves the compression ratio of the algorithm.
引用
收藏
页码:127 / 145
页数:19
相关论文
共 36 条
[1]   A progressive lossless/near-lossless image compression algorithm [J].
Avcibas, I ;
Memon, N ;
Sankur, B ;
Sayood, K .
IEEE SIGNAL PROCESSING LETTERS, 2002, 9 (10) :312-314
[2]  
Barman Dibyendu, 2022, High Performance Computing and Networking: Select Proceedings of CHSN 2021. Lecture Notes in Electrical Engineering (853), P227, DOI 10.1007/978-981-16-9885-9_19
[3]  
Barman D., 2016, IEEE INT C INV COMP, DOI [10.1109/INVENTIVE.2016.7823295, DOI 10.1109/INVENTIVE.2016.7823295]
[4]  
Barman D., 2022, ADV COMPUTING INTELL, V914, DOI [10.1007/978-981-19-2980-9_25, DOI 10.1007/978-981-19-2980-9_25]
[5]   An adjustable algorithm for color quantization [J].
Bing, Z ;
Shen, JY ;
Peng, QK .
PATTERN RECOGNITION LETTERS, 2004, 25 (16) :1787-1797
[6]  
Celebi ME, 2011, IEEE IMAGE PROC, P1729, DOI 10.1109/ICIP.2011.6115792
[7]   Reducing Artifacts in JPEG Decompression Via a Learned Dictionary [J].
Chang, Huibin ;
Ng, Michael K. ;
Zeng, Tieyong .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (03) :718-728
[8]   Optimizing Multiscale SSIM for Compression via MLDS [J].
Charrier, Christophe ;
Knoblauch, Kenneth ;
Maloney, Laurence T. ;
Bovik, Alan C. ;
Moorthy, Anush K. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2012, 21 (12) :4682-4694
[9]   A fast and novel technique for color quantization using reduction of color space dimensionality [J].
Cheng, SC ;
Yang, CK .
PATTERN RECOGNITION LETTERS, 2001, 22 (08) :845-856
[10]   Image compression based on vector quantization using cuckoo search optimization technique [J].
Chiranjeevi, Karri ;
Jena, Uma Ranjan .
AIN SHAMS ENGINEERING JOURNAL, 2018, 9 (04) :1417-1431