Results 171 to 180 of about 1,866 (211)

Machine Learning-Based Depression Recognition With Preserved Efficacy From Compressed EEG Signals Using Wavelet Transform and Adaptive Filtering. [PDF]

Healthc Technol Lett
Rezakhani Taleghani M, Grailu H.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Algorithms for adaptive Huffman codes

Information Processing Letters, 1984
L'algorithme d'Huffman permet de generer des codes a redondance minimum pour un ensemble fini de message a frequences de transmissions connues. On considere ici seulement les codes d'Huffman binaires. On decrit un algorithme qui peut etre generalise, mais le systeme binaire reste certainement le mieux adapte aux applications ...
Gordon V Cormack
exaly   +2 more sources

Weighted Adaptive Huffman Coding

2020 Data Compression Conference (DCC), 2020
Huffman coding is known to be optimal in case the alphabet is known in advance, the set of codewords is fixed and each codeword consists of an integral number of bits. If one of these conditions is violated, optimality is not guaranteed. In the dynamic variant of Huffman coding the encoder and decoder maintain identical copies of the model; at each ...
Shmuel T Klein, Dana Shapira
exaly   +2 more sources

A fast-adaptive Huffman coding algorithm

IEEE Transactions on Communications, 1993
The Huffman code in practice suffers from two problems: the prior knowledge of the probability distribution of the data source to be encoded is necessary, and the encoded data propagate errors. The first problem can be solved by adaptive coding, while the second problem can be partly solved by segmenting data into segments.
M P Gough
exaly   +3 more sources

An Adaptive Huffman Decoding Algorithm for MP3 Decoder

2010 Fifth IEEE International Symposium on Electronic Design, Test & Applications, 2010
This paper proposes a novel array data structure to represent Huffman code table and an adaptive algorithm for Huffman decoding based on Single-side Growing Huffman Coding approach which provides a memory efficient and high-speed decoding algorithm. The search time of the proposed algorithm for finding a symbol is the ceiling of (CL/4) where CL is the ...
Hoang-Anh Pham
exaly   +2 more sources

Huffman Coding-Based Adaptive Spatial Modulation

IEEE Transactions on Wireless Communications, 2017
Antenna switch enables multiple antennas to share a common RF chain. It also offers an additional spatial dimension, i.e., antenna index, that can be utilized for data transmission via both signal space and spatial dimension. In this paper, we propose a Huffman coding-based adaptive spatial modulation that generalizes both conventional spatial ...

exaly   +2 more sources

Adaptive Region Based Huffman Compression Technique with Selective Code Interchanging

Advances in Intelligent Systems and Computing, 2012
Adaptive version of loss-less Region Based Huffman compression techniques are proposed where a proposed region formation algorithm is used to divide the input file into a number of regions that adapts region size depending on the ASCII value difference of symbols. Huffman codes are obtained for entire file after formation of regions. Code interchanging
Utpal Nandi, Jyotsna Kumar Mandal, Nandi Utpal   +2 more
exaly   +2 more sources

AHCM: Adaptive Huffman Code Mapping for Audio Steganography Based on Psychoacoustic Model

IEEE Transactions on Information Forensics and Security, 2019
Most current audio steganographic methods are content non-adaptive which have poor security and low embedding capacity. This paper proposes a generalized adaptive Huffman code mapping (AHCM) framework for obtaining higher secure payload. To avoid the frame-offset effect of audio codec, we first establish a distortion-limited suppressible code space ...
Xiaowei Yi, Xianfeng Zhao, Yuntao Wang   +2 more
exaly   +2 more sources

Huffman coding of DCT coefficients using dynamic codeword assignment and adaptive codebook selection

Signal Processing: Image Communication, 1998
In many image sequence compression applications, Huffman coding is used to eliminate statistical redundancy resident in given data. The Huffman table is often pre-defined to reduce coding delay and table transmission overhead. Local symbol statistics, however, may be much different from the global ones manifested in the pre-defined table. In this paper,
Byeungwoo Jeon, Jechang Jeong
exaly   +2 more sources

High-performance reversible data hiding in encrypted images with adaptive Huffman code

Digital Signal Processing, 2023
Guangyong Gao, Liping Zhang, Chengsheng Yuan   +2 more
exaly   +2 more sources