Results 301 to 310 of about 21,889,530 (328)
Some of the next articles are maybe not open access.

Lossless Compression of Cytometric Data

Cytometry Part A, 2019
AbstractNowadays, most cytometrists apply lossless compression by storing their FCS files in ZIP archives. Unfortunately, ZIP only achieves modest space savings in cytometric data, due to DEFLATE being used as the underlying lossless compression algorithm (LCA).
Anne E. Bras   +1 more
openaire   +4 more sources

EEG data compression techniques

IEEE Transactions on Biomedical Engineering, 1997
In this paper, electroencephalograph (EEG) and Holter EEG data compression techniques which allow perfect reconstruction of the recorded waveform from the compressed one are presented and discussed. Data compression permits one to achieve significant reduction in the space required to store signals and in transmission time. The Huffman coding technique
G. Antoniol, Tonella, Paolo
openaire   +3 more sources

ECG Data Compression by Modeling

Computers and Biomedical Research, 1993
This paper presents a novel algorithm for data compression of single lead Electrocardiogram (ECG) data. The method is based on Parametric modeling of the Discrete Cosine Transformed ECG signal. Improved high frequency reconstruction is achieved by separately modeling the low and the high frequency regions of the transformed signal.
I. S. N. Murthy, Budagavi Madhukar
openaire   +3 more sources

Data compression with substitution

1989
All the data compression methods described in this paper are based on substitutions acting on characters or factors occurring inside the source texts. The average expected compression ratio is often close to 2. Most methods have a bad behaviour when error appears in encoded texts. One bit lost and the decompression is almost impossible!
openaire   +3 more sources

Learning as Data Compression

2007
In this paper I describe the general principles of learning as data compression. I introduce two-part code optimization and analyze the theoretical background in terms of Kolmogorov complexity. The good news is that the optimal compression theoretically represents the optimal interpretation of the data, the bad news is that such an optimal compression ...
openaire   +3 more sources

Pointwise redundancy in lossy data compression and universal lossy data compression

IEEE Transactions on Information Theory, 2000
Summary: The author characterizes achievable pointwise redundancy rates for lossy data compression at a fixed distortion level. Pointwise redundancy refers to the difference between the description length achieved by an \(n\)th-order block code and the optimal \(nR(D)\) bits.
openaire   +2 more sources

Data Compression

Identification and Other Probabilistic Models, 2021
R. Ahlswede
semanticscholar   +1 more source

Data Compression in the Marketplace

1997
Table 1.2 in Chapter 1 presents an extensive list of applications that use data compression to store or transmit data more efficiently or to transmit it in less time. This chapter examines what the end users of those applications require, expect, and will get from data compression.
openaire   +2 more sources

Managing Compressed Data

1997
In Part III — Applications we explored many digital systems and observed that the compression process and compressed data interact with the physical system and with other logical functions in the system. This chapter takes a closer look at some issues that digital systems designers face when managing compressed data.
openaire   +2 more sources

Music Analysis and Data Compression

2019
David Meredith focuses on how the musical knowledge that underpins both music perception and musical imagery can be acquired by compressing musical information. He works from the notion that the goal of music analysis is to find the best possible explanations for the structures of musical “objects,” such as individual works or movements as well as ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy