Results 1  10
of
532,888
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1055 (1 self)
 Add to MetaCart
the infimum is with respect to all auxiliary random variables Z (which take values in a finite set 3) that satisfy: i) Y,Z conditiofally independent given X; ii) there exists a functionf: “Y x E +.%, such that E[D(X,f(Y,Z))] 5 d. Let Rx, y(d) be the ratedistortion function which results when the encoder
On Distortion Functionals
"... Distorted measures have been used in pricing of insurance contracts for a long time. This paper reviews properties of related acceptability functionals in risk management, called distortion functionals. These functionals may be characterized by being mixtures of average valuesatrisk. We give a dua ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Distorted measures have been used in pricing of insurance contracts for a long time. This paper reviews properties of related acceptability functionals in risk management, called distortion functionals. These functionals may be characterized by being mixtures of average valuesatrisk. We give a
Computation of channel capacity and ratedistortion functions
 IEEE Trans. Inform. Theory
, 1972
"... A&r&By defining mutual information as a maximum over an appropriate space, channel capacities can be defined as double maxima and ratedistortion functions as double minima. This approach yields valuable new insights regarding the computation of channel capacities and ratedistortion functi ..."
Abstract

Cited by 276 (1 self)
 Add to MetaCart
A&r&By defining mutual information as a maximum over an appropriate space, channel capacities can be defined as double maxima and ratedistortion functions as double minima. This approach yields valuable new insights regarding the computation of channel capacities and ratedistortion
On distortion functionals
 Statistics and Decisions
"... The highpressure phase transitions of silicon and gallium ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The highpressure phase transitions of silicon and gallium
Estimation of the ratedistortion function
 2007. [Online]. Available: http://arxiv.org/abs/cs/0702018v1
"... Motivated by questions in lossy data compression and by theoretical considerations, this paper examines the problem of estimating the ratedistortion function of an unknown (not necessarily discretevalued) source from empirical data. The main focus is the behavior of the socalled “plugin ” estimat ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Motivated by questions in lossy data compression and by theoretical considerations, this paper examines the problem of estimating the ratedistortion function of an unknown (not necessarily discretevalued) source from empirical data. The main focus is the behavior of the socalled “plug
Modular Equations and Distortion Functions
, 2007
"... Modular equations occur in number theory, but it is less known that such equations also occur in the study of deformation properties of quasiconformal mappings. The authors study two important plane quasiconformal distortion functions, obtaining monotonicity and convexity properties, and finding sha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Modular equations occur in number theory, but it is less known that such equations also occur in the study of deformation properties of quasiconformal mappings. The authors study two important plane quasiconformal distortion functions, obtaining monotonicity and convexity properties, and finding
Distortion invariant object recognition in the dynamic link architecture
 IEEE TRANSACTIONS ON COMPUTERS
, 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture exploits correlations in the finescale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract

Cited by 636 (81 self)
 Add to MetaCart
matching cost function. Our implementation on a transputer network successfully achieves recognition of human faces and office objects from gray level camera images. The performance of the program is evaluated by a statistical analysis of recognition results from a portrait gallery comprising images of 87
On Algorithmic RateDistortion Function
"... Abstract — We develop ratedistortion theory in the Kolmogorov complexity setting. This is a theory of lossy compression of individual data objects, using the computable regularities of the data. I. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — We develop ratedistortion theory in the Kolmogorov complexity setting. This is a theory of lossy compression of individual data objects, using the computable regularities of the data. I.
1Estimation of the RateDistortion Function
"... Abstract—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the ratedistortion function of an unknown (not necessarily discretevalued) source from empirical data is examined. The focus is the behavior of the socalled “plugin ” estimator, ..."
Abstract
 Add to MetaCart
Abstract—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the ratedistortion function of an unknown (not necessarily discretevalued) source from empirical data is examined. The focus is the behavior of the socalled “plugin ” estimator
Bounds and the Evaluation of Rate Distortion Functions
, 1976
"... This work is concerned with calculating (Chapters III and IV) and bounding (Chapter V) rate distortion functions and with some of their properties (Chapter II). A review of the basic notions and results in the rate distortion theory is included in Chapter I. In Chapter II, we consider a memoryless ..."
Abstract
 Add to MetaCart
This work is concerned with calculating (Chapters III and IV) and bounding (Chapter V) rate distortion functions and with some of their properties (Chapter II). A review of the basic notions and results in the rate distortion theory is included in Chapter I. In Chapter II, we consider a memoryless
Results 1  10
of
532,888