Search Results - "Shtar’kov, Yu. M."
-
1
Wavelet transforms and compression of computer tomograms
Published in Journal of communications technology & electronics (01-12-2010)“…A distortion-free method for compression of computer tomograms is proposed. The method is based on description (compression) of data obtained as a result of 2D…”
Get full text
Journal Article -
2
Organization of the remote access to tomographic data through a slow communications link
Published in Automation and remote control (01-06-2008)“…Consideration is given to the problem of organization of the remote access to tomographic data obtained as a result of the investigation on the computerized…”
Get full text
Journal Article -
3
Universal coding algorithm for a family of context Markov sources
Published in Problems of information transmission (01-07-2014)“…Often, for a source to be encoded it is only known (or assumed) that its model belongs to some known family; parameters of models are unknown. The number of…”
Get full text
Journal Article -
4
Individual redundancy of adaptive and weighted source coding
Published in Problems of information transmission (01-10-2013)“…We define individual redundancy of adaptive codes. We propose a method of weighted coding asymptotically optimal with respect to the maximal average and…”
Get full text
Journal Article -
5
Text compression by context tree weighting
Published in DCC (Los Alamitos, Calif.) (1997)“…The results of an experimental study of different modifications of the context tree weighting algorithm are described. In particular, the combination of this…”
Get full text
Conference Proceeding Journal Article
-
6
Non-uniform PPM and context tree models
Published in DCC (Los Alamitos, Calif.) (1998)“…The problem of optimizing PPM with the help of different choices of estimators and their parameters for different subsets of nodes in the context tree is…”
Get full text
Conference Proceeding Journal Article -
7
Towards understanding and improving escape probabilities in PPM
Published in DCC (Los Alamitos, Calif.) (1997)“…The choice of expressions for the coding probabilities in general, and the escape probability in particular, is of great importance in the family of prediction…”
Get full text
Conference Proceeding Journal Article -
8
Optimal Universal Coding with Respect to the Maximal Individual Relative Redundancy Criterion
Published in Problems of information transmission (01-01-2004)Get full text
Journal Article -
9
Fuzzy estimation of unknown source model for universal coding
Published in 1998 Information Theory Workshop (Cat. No.98EX131) (1998)“…An "estimation-like" algorithm of sequential universal coding of sources with unknown model is proposed. It is shown that for the set of all context tree…”
Get full text
Conference Proceeding -
10
Estimation of escape probabilities for PPM based on universal source coding theory
Published in 1997 IEEE International Symposium on Information Theory, ISIT 1997,Ulm, Germany,1997-06-29 - 1997-07-04 (1997)“…Some of the best compression ratios for text compression are provided by the PPM (prediction by partial matching) class of algorithms. These algorithms are…”
Get full text
Conference Proceeding -
11
Optimal universal coding with respect to the maximal individual relative redundancy criterion
Published in Proceedings of IEEE International Symposium on Information Theory (1997)“…In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a…”
Get full text
Conference Proceeding -
12
Multialphabet coding with separate alphabet description
Published in Proceedings of the 1997 International Conference on Compression and Complexity of Sequences,Positano, Italy,1997-06-11 - 1997-06-13 (1997)“…For lossless universal source coding of memoryless sequences with an a priori unknown alphabet size (multialphabet coding), the alphabet of the sequence must…”
Get full text
Conference Proceeding