Results 1  10
of
226,158
Order Compression Schemes
, 2013
"... Sample compression schemes are schemes for “encoding” a set of examples in a small subset of examples. The longstanding open sample compression conjecture states that, for any concept class C of VCdimension d, there is a sample compression scheme in which samples for concepts in C are compressed t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Sample compression schemes are schemes for “encoding” a set of examples in a small subset of examples. The longstanding open sample compression conjecture states that, for any concept class C of VCdimension d, there is a sample compression scheme in which samples for concepts in C are compressed
Survey of SIFT Compression Schemes
, 2010
"... Transmission and storage of local feature descriptors are of critical importance for mobile visual search applications. We perform a comprehensive survey of Scale Invariant Feature Transform (SIFT) compression schemes proposed in the literature and evaluate them in a common framework. Further, we c ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Transmission and storage of local feature descriptors are of critical importance for mobile visual search applications. We perform a comprehensive survey of Scale Invariant Feature Transform (SIFT) compression schemes proposed in the literature and evaluate them in a common framework. Further, we
Multiresolution Lossless Compression Scheme
 in Proc. of the IEEE International Conference on Image Processing (ICIP96
, 1996
"... A multiresolution lossless image compression scheme based on several new tools will be presented in this paper. An improved multiresolution Haar transform will be developed, combined with pre and postprocessing and with a new entropy coder, to give the overall compression scheme. This research is ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
A multiresolution lossless image compression scheme based on several new tools will be presented in this paper. An improved multiresolution Haar transform will be developed, combined with pre and postprocessing and with a new entropy coder, to give the overall compression scheme. This research
Implementing the PPM Data Compression Scheme
, 1990
"... The “Prediction by Partial Matching” (PPM) data compression algorithm developed by Cleary and Witten is capable of very high compression rates, encoding English text in as little as 2.2 bits/character. Here it is shown that the estimates made by Cleary and Witten of the resources required to implem ..."
Abstract

Cited by 150 (5 self)
 Add to MetaCart
to implement the scheme can be revised to allow for a tractable and useful implementation. In particular, a variant is described that encodes and decodes at over 4 kbytes/s on a small workstation, and operates within a few hundred kilobytes of data space, but still obtains compression of about 2.4 bits
Survey of SIFT Compression Schemes
"... Abstract. Transmission and storage of local feature descriptors are of critical importance for mobile visual search applications. We perform a comprehensive survey of Scale Invariant Feature Transform (SIFT) compression schemes proposed in the literature and compare them in a common framework. Furth ..."
Abstract
 Add to MetaCart
Abstract. Transmission and storage of local feature descriptors are of critical importance for mobile visual search applications. We perform a comprehensive survey of Scale Invariant Feature Transform (SIFT) compression schemes proposed in the literature and compare them in a common framework
On the Temporal HZY Compression Scheme
"... The HZY compression scheme. We consider ( �)HZY compression scheme with temporal ordering. Given an input string T = T [1: n] from a constant sized alphabet, the ( �)HZY scheme compresses T as follows. T is partitioned into disjoint blocks (substrings) of size, T [1:]�T [ + 1: 2]�:::. For 1 k n ..."
Abstract
 Add to MetaCart
The HZY compression scheme. We consider ( �)HZY compression scheme with temporal ordering. Given an input string T = T [1: n] from a constant sized alphabet, the ( �)HZY scheme compresses T as follows. T is partitioned into disjoint blocks (substrings) of size, T [1:]�T [ + 1: 2]�:::. For 1 k n
A Locally Adaptive Data Compression Scheme
, 1986
"... A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for selforganizing sequential search and on variablelength encoding ..."
Abstract

Cited by 173 (2 self)
 Add to MetaCart
A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for selforganizing sequential search and on variable
On the Temporal HZY Compression Scheme
 ACMSIAM Symp. Discrete Algorithms (SODA
"... 08> [(k \Gamma1)fi+1 : kfi] defined to be the number of distinct occurrences of the context T [(k \Gamma 1)fi \Gamma x : (k \Gamma 1)fi] between the leftmost occurrence of T [(k \Gamma 1)fi \Gamma x : kfi] and its current occurrence. (When counting the number distinct occurrences of a context we ..."
Abstract
 Add to MetaCart
only consider its occurrences with distinct blocks following it.) Comments on the HZY compression scheme. The HZY scheme given above is a contextbased compression method recently proposed in [HZ98] and independently in [Yok95]. It is a onepass algorithm as the codeword of a given block T [(k \Gamma
Evolving better wavelet compression schemes
 in Proc. of Wavelet Applications in Signal and Image Processing III, 12{14
, 1995
"... Wavelet based compression schemes belong to the general class of transform coding schemes. We show how the genetic programming approach can be used to optimize such a compression scheme in the sense of ratedistortion. The results of optimized wavelet based compression schemes are compared with the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Wavelet based compression schemes belong to the general class of transform coding schemes. We show how the genetic programming approach can be used to optimize such a compression scheme in the sense of ratedistortion. The results of optimized wavelet based compression schemes are compared
Unlabeled Compression Schemes for Maximum Classes
 J. Machine Learning Research,vol
, 2007
"... Abstract. We give a compression scheme for any maximum class of VC dimension d that compresses any sample consistent with a concept in the class to at most d unlabeled points from the domain of the sample. 1 ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Abstract. We give a compression scheme for any maximum class of VC dimension d that compresses any sample consistent with a concept in the class to at most d unlabeled points from the domain of the sample. 1
Results 1  10
of
226,158