Search Results - universal data compression algorithm
-
1
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform--Part one: Without context models
ISSN: 0018-9448, 1557-9654Published: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.05.2000Published in IEEE transactions on information theory (01.05.2000)“…A grammar transform is a transformation that converts any data sequence to be compressed into a grammar from which the original data sequence can be fully reconstructed…”
Get full text
Journal Article -
2
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
ISSN: 0018-9448, 1557-9654Published: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.11.2003Published in IEEE transactions on information theory (01.11.2003)“… Given a countable-context model, a greedy CDG transform is proposed. Based on this greedy CDG transform, two universal lossless data compression algorithms…”
Get full text
Journal Article -
3
An on-line universal lossy data compression algorithm via continuous codebook refinement--Part I: Basic results
ISSN: 0018-9448, 1557-9654Published: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 1996Published in IEEE transactions on information theory (1996)“…A new on-line universal lossy data compression algorithm is presented. Candidate codewords are randomly generated according to an arbitrary and possibly…”
Get full text
Journal Article -
4
An on-line universal lossy data compression algorithm via continuous codebook refinement--part III: Redundancy analysis
ISSN: 0018-9448, 1557-9654Published: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.09.1998Published in IEEE transactions on information theory (01.09.1998)“…The Gold-washing data compression algorithm is an adaptive vector quantization algorithm with vector dimension n…”
Get full text
Journal Article -
5
An on-line universal lossy data compression algorithm via continuous codebook refinement--Part II: Optimality for phi-mixing source models
ISSN: 0018-9448, 1557-9654Published: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 1996Published in IEEE transactions on information theory (1996)“…Two versions of the gold-washing data compression algorithm, one with codebook innovation interval and the other with finitely many codebook innovations, were considered…”
Get full text
Journal Article -
6
Measuring the Efficiency of the Intraday Forex Market with a Universal Data Compression Algorithm
ISSN: 0927-7099, 1572-9974Published: Boston Springer US 01.03.2009Published in Computational economics (01.03.2009)“…Universal compression algorithms can detect recurring patterns in any type of temporal data…”
Get full text
Journal Article -
7
Real-Time Lossless Compression Algorithm for Ultrasound Data Using BL Universal Code
ISSN: 1424-8220, 1424-8220Published: Switzerland MDPI 02.10.2018Published in Sensors (Basel, Switzerland) (02.10.2018)“… Owing to the real-time encoding/decoding features without overheads, the universal code is a good solution to reduce the data transfer rate for software-based ultrasound imaging…”
Get full text
Journal Article -
8
A universal algorithm for sequential data compression
ISSN: 0018-9448, 1557-9654Published: IEEE 01.05.1977Published in IEEE transactions on information theory (01.05.1977)“…A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources…”
Get full text
Journal Article -
9
Time-Universal Data Compression
ISSN: 1999-4893, 1999-4893Published: Basel MDPI AG 01.06.2019Published in Algorithms (01.06.2019)“…Nowadays, a variety of data-compressors (or archivers) is available, each of which has its merits, and it is impossible to single out the best ones…”
Get full text
Journal Article -
10
The Universal LZ77 Compression Algorithm Is Essentially Optimal for Individual Finite-Length N-Blocks
ISSN: 0018-9448, 1557-9654Published: New York, NY IEEE 01.05.2009Published in IEEE transactions on information theory (01.05.2009)“… No a priori information about X is available at the encoder, which must therefore adopt a universal data-compression algorithm…”
Get full text
Journal Article -
11
A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm
ISSN: 1932-4553, 1941-0484Published: IEEE 01.06.2015Published in IEEE journal of selected topics in signal processing (01.06.2015)“… We present a novel lossless universal data compression algorithm that uses parallel computational units to increase the throughput…”
Get full text
Journal Article -
12
On the performance of recency-rank and block-sorting universal lossless data compression algorithms
ISSN: 0018-9448, 1557-9654Published: New York IEEE 01.09.2002Published in IEEE transactions on information theory (01.09.2002)“…Bounds on the redundancy of the recency-rank and block-sorting universal lossless data compression algorithms for finite-length sequences are presented…”
Get full text
Journal Article -
13
The universal coding method in the data compression algorithm
ISSN: 0146-4116, 1558-108XPublished: Heidelberg Allerton Press, Inc 01.10.2010Published in Automatic control and computer sciences (01.10.2010)“…A brand new constructive data compression algorithm is considered. The model’s basic elements are indicated…”
Get full text
Journal Article -
14
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models
ISSN: 0018-9448Published: IEEE 01.11.2003Published in IEEE transactions on information theory (01.11.2003)“… Given a countable-context model, a greedy CDG transform is proposed. Based on this greedy CDG transform, two universal lossless data compression algorithms…”
Get full text
Journal Article -
15
A survey and benchmark evaluation for neural-network-based lossless universal compressors toward multi-source data
ISSN: 2095-2228, 2095-2236Published: Beijing Higher Education Press 01.07.2025Published in Frontiers of Computer Science (01.07.2025)“…As various types of data grow explosively, large-scale data storage, backup, and transmission become challenging, which motivates many researchers to propose efficient universal compression algorithms…”
Get full text
Journal Article -
16
On Finite Memory Universal Data Compression and Classification of Individual Sequences
ISSN: 0018-9448, 1557-9654Published: New York, NY IEEE 01.04.2008Published in IEEE transactions on information theory (01.04.2008)“… No a priori information about is available at the encoder, which must therefore adopt a universal data-compression algorithm…”
Get full text
Journal Article -
17
An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis
ISSN: 0018-9448Published: IEEE 01.09.1998Published in IEEE transactions on information theory (01.09.1998)“…For pt.II see ibid., vol.42, p.822-36 (1996). The Gold-washing data compression algorithm is an adaptive vector quantization algorithm with vector dimension n…”
Get full text
Journal Article -
18
An on-line universal lossy data compression algorithm viacontinuous codebook refinement .III. Redundancy analysis
ISSN: 0018-9448Published: 01.09.1998Published in IEEE transactions on information theory (01.09.1998)“…For pt.II see ibid., vol.42, p.822-36 (1996). The Gold-washing data compression algorithm is an adaptive vector quantization algorithm with vector dimension n…”
Get full text
Journal Article -
19
Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder
ISSN: 0018-9448, 1557-9654Published: New York, NY IEEE 01.04.2010Published in IEEE transactions on information theory (01.04.2010)“…A source coding paradigm called interactive encoding and decoding (IED) is considered for a source network where a finite alphabet source X is to be encoded,…”
Get full text
Journal Article -
20
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
ISSN: 0018-9448Published: IEEE 01.05.2000Published in IEEE transactions on information theory (01.05.2000)“… Based on this grammar transform, three universal lossless data compression algorithms, a sequential algorithm, an improved sequential algorithm, and a hierarchical algorithm, are then developed…”
Get full text
Journal Article