Results 21 to 30 of about 2,145 (185)
An Efficient Encoding Algorithm Using Local Path on Huffman Encoding Algorithm for Compression
Applied 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
A quantum analog of Huffman coding [PDF]
IEEE Transactions on Information Theory, 2000 Revised version, 7 pages, two-column, RevTex.
Samuel L. Braunstein +3 more
openaire +4 more sources
Comparison of Effects of Entropy Coding Schemes Cascaded with Set Partitioning in Hierarchical Trees
Mehran 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
KomputikaKemajuan 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
IEEE 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
Peer-to-Peer Multicasting Inspired by Huffman Coding
Journal 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
2-D Bi-Level Block Coding for Color Image Compression and Transmission With Bit-Error Awareness
IEEE 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
Space-efficient Huffman codes revisited
Information 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
Agribusiness, EarlyView.ABSTRACT This paper explores the convergence in on‐farm diversification strategies of agricultural holdings, between remote areas and more central ones. Using Italian farm‐level data, we explore the determinants of diversification strategies across farms.
Gianluca Grilli +2 more
wiley +1 more source
Dianzi Jishu YingyongLossless compression algorithms work as the core algorithms for information processing and storage in the process-level networks of smart substations. The Huffman algorithm, a universal lossless compression method, is applied in communication networks of
Xu Zhengyu, Wang Feng, Li Yan
doaj +1 more source