Results 21 to 30 of about 3,671 (229)

Lossless text compression using GPT-2 language model and Huffman coding [PDF]

open access: yesSHS Web of Conferences, 2021
Modern daily life activities produced lots of information for the advancement of telecommunication. It is a challenging issue to store them on a digital device or transmit it over the Internet, leading to the necessity for data compression.
Rahman Md. Atiqur, Hamada Mohamed
doaj   +1 more source

An Efficient Encoding Algorithm Using Local Path on Huffman Encoding Algorithm for Compression

open access: yesApplied Sciences, 2019
Huffman encoding and arithmetic coding algorithms have shown great potential in the field of image compression. These algorithms are the origin of current image compression techniques. Nevertheless, there are some deficiencies in both algorithms that use
Erdal Erdal, Atilla Ergüzen
doaj   +1 more source

Comparison of Effects of Entropy Coding Schemes Cascaded with Set Partitioning in Hierarchical Trees

open access: yesMehran University Research Journal of Engineering and Technology, 2018
WT (Wavelet Transform) is considered as landmark for image compression because it represents a signal in terms of functions which are localized both in frequency and time domain.
Ali Iqbal   +4 more
doaj   +1 more source

Arithmetic coding revisited

open access: yes, 1998
Over the last decade, arithmetic coding has emerged as an important compression tool. It is now the method of choice for adaptive coding on multisymbol alphabets because of its speed, low storage requirements, and effectiveness of compression.
Neal, Radford M.   +5 more
core   +1 more source

Analisis Perbandingan Kualitas Kompresi Citra Menggunakan Algoritma Shannon-Fano dan Huffman Coding Serta Pengujian Efek Noise AWGN Pada Citra Rekonstruksi

open access: yesKomputika
Kemajuan teknologi informasi saat ini berperan penting dalam pertukaran informasi yang cepat. Informasi dalam bentuk citra membutuhkan media penyimpanan yang memadai karena ukuran citra yang besar. Sehingga dibutuhkan cara yang efisien yaitu memampatkan
Mahalalila Hayuning Sekarbayu   +2 more
doaj   +1 more source

Model-Based Deep Encoding Based on USB Transmission for Modern Edge Computing Architectures

open access: yesIEEE Access, 2020
With the advance of deep neural networks (DNNs), artificial intelligence (AI) has been widely applied to various applications in our daily lives. These DNN-based models can be stored in portable storage disks or low-power Neural Compute Sticks.
Li-Qun Yang   +3 more
doaj   +1 more source

On the redundancy achieved by Huffman codes [PDF]

open access: yesInformation Sciences, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto De Prisco, Alfredo De Santis
openaire   +1 more source

2-D Bi-Level Block Coding for Color Image Compression and Transmission With Bit-Error Awareness

open access: yesIEEE Access, 2020
In this paper, we develop a new color image lossless compression algorithm with bit-error awareness based on a general bi-level block coding method. The proposed method contains three stages.
Xuan Peng   +3 more
doaj   +1 more source

Peer-to-Peer Multicasting Inspired by Huffman Coding

open access: yesJournal of Computer Networks and Communications, 2013
Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast ...
Bartosz Polaczyk   +2 more
doaj   +1 more source

Space-efficient Huffman codes revisited

open access: yesInformation Processing Letters, 2023
Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding capable to encode or decode a symbol in constant worst case time. It uses $σ\lg \ell_{\text{max}} + o(σ) + O(\ell_{\text{
Szymon Grabowski, Dominik Köppl
openaire   +3 more sources

Home - About - Disclaimer - Privacy