𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A data compression algorithm for the electroencephalogram

✍ Scribed by Charles McLochlin; Jose C. Principe; Jack R. Smith

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
803 KB
Volume
22
Category
Article
ISSN
0020-7101

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Data compression using the deconvolution
Data compression using the deconvolution algorithm CLEAN
✍ Nathan Cohen; Guido Sandri πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 396 KB

We describe an application of the nonlinear deconvolution algorithm CLEAN in which a priori knowledge of the point-spread function allows transmission of nonredundant information. We refer to this as CLEAN compression. The point-spread function is viewed as a redundancy function. The data set may be

An adaptive character wordlength algorit
An adaptive character wordlength algorithm for data compression
✍ Hussein Al-Bahadili; Shakir M. Hussain πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 350 KB

This paper presents a new and efficient data compression algorithm, namely, the adaptive character wordlength (ACW) algorithm, which can be used as complementary algorithm to statistical compression techniques. In such techniques, the characters in the source file are converted to a binary code, whe

Greedy Algorithms for On-Line Data Compr
Greedy Algorithms for On-Line Data Compression
✍ JΓ³zsef BΓ©kΓ©si; GΓ‘bor Galambos; Ulrich Pferschy; Gerhard J Woeginger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 191 KB

We consider on-line text-compression problems where compression is done by Ε½ . substituting substrings according to some fixed static dictionary code book . Due to the long running time of optimal algorithms, several heuristics have been introduced in the literature. In this paper, we continue the i