An optimised clustering algorithm with dual tree DS for lossless image compression
by Ruhiat Sultana; Nisar Ahmed; Syed Abdul Sattar
International Journal of Biomedical Engineering and Technology (IJBET), Vol. 37, No. 3, 2021

Abstract: The emerging utilisation of web and other electronic applications have expedited much consideration on image compression systems to spare storage room and diminish transmission time by compressing the size of an image by discarding the repetitive data sequences. Most of the techniques are based on lossy compression techniques where the compression ratio would be low. The proposed system based on lossless compression technique achieves best compression ratio, good image quality and less PSNR value by extracting the best features of an image, which is to be compressed and encoded by incorporating firefly algorithm with k means algorithm there by avoids local optima problem. To make the eminent compression of best derived features, quad tree decomposition and Huffman encoding technique are combined, which provide high compression ratio by fetching correct probabilities of occurrence of pixel intensity. This proposed technique is actualised in MATLAB and in this manner the trial results demonstrated the effectiveness of the proposed image compression technique regarding high compression ratio, low noise ratio, and reduced compression and decompression time when compared with existing techniques.

Online publication date: Tue, 04-Jan-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Biomedical Engineering and Technology (IJBET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com