Results 91 to 100 of about 2,705,238 (250)

A Data Compression Method for Wellbore Stability Monitoring Based on Deep Autoencoder

open access: yesSensors
The compression method for wellbore trajectory data is crucial for monitoring wellbore stability. However, classical methods like methods based on Huffman coding, compressed sensing, and Differential Pulse Code Modulation (DPCM) suffer from low real-time
Shan Song   +3 more
doaj   +1 more source

Canonical Huffman code based full-text index

open access: yes, 2008
Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T
Yi Zhang   +3 more
semanticscholar   +1 more source

Partial Encryption of Entropy-Coded Video Compression Using Coupled Chaotic Maps

open access: yesEntropy, 2014
Due to pervasive communication infrastructures, a plethora of enabling technologies is being developed over mobile and wired networks. Among these, video streaming services over IP are the most challenging in terms of quality, real-time requirements and ...
Fadi Almasalha   +2 more
doaj   +1 more source

Real-time demonstration hardware for enhanced DPCM video compression algorithm [PDF]

open access: yes
The lack of available wideband digital links as well as the complexity of implementation of bandwidth efficient digital video CODECs (encoder/decoder) has worked to keep the cost of digital television transmission too high to compete with analog methods.
Bizon, Thomas P.   +2 more
core   +1 more source

Quantum-inspired Huffman Coding

open access: yes, 2013
Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable length that is a most frequent symbol has length smaller than a less frequent symbol.
Tolba, A. S.   +2 more
openaire   +2 more sources

An efficient chain code with Huffman coding

open access: yesPattern Recognition, 2005
This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative angle difference between it and the previous element. Statistical analysis showed that the probabilities of the Freeman codes differ importantly. Therefore, the Huffman coding was applied.
Liu, Yong Kui, Žalik, Borut
openaire   +2 more sources

An EMG Keyboard for Forearm Amputees

open access: yesApplied Bionics and Biomechanics, 2003
A high-efficiency, easy-to-use input device is not only important for data entry but also for human-computer interaction. To date, there has been little research on input devices with many degrees of freedom (DOF) that can be used by the handicapped ...
Wenwei Yu   +4 more
doaj   +1 more source

Empirical and Statistical Evaluation of the Effectiveness of Four Lossless Data Compression Algorithms

open access: yesNigerian Journal of Technological Development, 2017
Data compression is the process of reducing the size of a file to effectively reduce storage space and communication cost. The evolvement in technology and digital age has led to an unparalleled usage of digital files in this current decade. The usage of
N. A. Azeez, A. A. Lasisi
doaj   +1 more source

HUFFMAN CODING AS A NONLINEAR DYNAMICAL SYSTEM [PDF]

open access: yesInternational Journal of Bifurcation and Chaos, 2011
In this paper, source coding or data compression is viewed as a measurement problem. Given a measurement device with fewer states than the observable of a stochastic source, how can one capture their essential information? We propose modeling stochastic sources as piecewise-linear discrete chaotic dynamical systems known as Generalized Luröth Series ...
openaire   +2 more sources

Joint Source-Channel Coding Using Variable-Length Error-Correcting Codes

open access: yesJournal of Engineering and Sustainable Development, 2010
This paper explores the performance of both source coding and error-correction in a single coding step. Such joint source-channel coding is done here using codewords of varying lengths that have particular distance properties with each other, which ...
Maher K. M. AlAzawi, Suha Kassim Hadi
doaj  

Home - About - Disclaimer - Privacy