Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Special Section: Similarity, correlation and association measures - dedicated to the memory of Lotfi Zadeh
Guest editors: Ildar Batyrshin, Valerie Cross, Vladik Kreinovich and Maria Rifqi
Article type: Research Article
Authors: Hasnat, Abul | Barman, Dibyendu; *
Affiliations: Department of Computer Science and Engineering, Government College of Engineering and Textile Technology, Berhampore, West Bengal, India
Correspondence: [*] Corresponding author. Dibyendu Barman, Department of Computer Science and Engineering, Government College of Engineering and Textile Technology, Berhampore, West Bengal, India. E-mail: dibyendu.barman@gmail.com.
Abstract: Image compression is a process that reduces memory space required to store an image. The image compression techniques are broadly classified into two categories a) Lossless technique b) Lossy technique. Lossy compression technique achieves higher result, but due to data loss it may cause spatial inconsistency, blocking artifact, quantization noise in the decompressed image degrading the image quality. Most of the existing compression techniques are applicable on single image separately. In this study an image compression method is proposed where multiple images of the same size are combined together and compressed to achieve higher compression ratio while keeping image quality as close as standard image compression techniques. Luminance channel of each image is compressed separately using Vector Quantization (VQ) algorithm while two chrominance channels, Cb and Cr of all images are combined into a three dimensional matrix that forms training vector. Clustering is applied on the training vector to get the initial color representatives. Thus, for the chrominance channels of n number of images, the proposed method generates one index matrix and one centroid matrix of size 256×2× n where 256 is the number of clusters. This centroid matrix contains one 256×2 dimensional centroid matrix for each individual image. This 256×2 matrix contains centroid of each cluster. The centroids of each and every cluster of an image are updated individually using optimization technique to get a better centroid (Cb, Cr) pair. This process updates the color representative pair of Cb and Cr further. This method has been applied on standard images in literature and images collected from UCID v. 2 color image database. Experimental results are analyzed in terms of PSNR and space reduction. Experimental results show that the proposed method achieves a higher compression ratio retaining almost similar image information as other standard lossy compression algorithm.
Keywords: Color image quantization, de-correlated color space, JPEG, K-Means clustering, lossless compression, lossy compression, optimization, PSNR, Vector Quantization, YCbCr
DOI: 10.3233/JIFS-18360
Journal: Journal of Intelligent & Fuzzy Systems, vol. 36, no. 4, pp. 3177-3193, 2019
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl