Huffman-based lossless image encoding scheme
[ X ]
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Spie-Soc Photo-Optical Instrumentation Engineers
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The data produced in today's Internet and computer world are expanding their wings day by day. With the passage of time, storage and archiving of this data are becoming a significant problem. To overcome this problem, attempts have been made to reduce data sizes using compression methods. Therefore, compression algorithms have received great attention. In this study, two efficient encoding algorithms are presented and explained in a crystal-clear manner. In all compression algorithms, frequency modulation is used. In this way, the characters with the highest frequency after each character are determined and the Huffman encoding algorithm is applied to them. In this study, the compression ratio (CR) is 49.44%. Moreover, 30 randomly selected images in three different datasets consisting of USC-SIPI, UCID, and STARE databases have been used to evaluate the performance of the algorithms. Consequently, excellent results have been obtained in all test images according to well-known comparison algorithms such as the Huffman encoding algorithm, arithmetic coding algorithm, and LPHEA. (C) 2021 SPIE and IS&T
Açıklama
Anahtar Kelimeler
image compression; encoding scheme; Huffman encoding algorithm; compression algorithm; lossless compression
Kaynak
Journal of Electronic Imaging
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
30
Sayı
5
