Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,444
Successive refinement of information
- Applications
, 1989
"... Abstrocr-The successive refinement of information consists of first approximating data using a few bits of information, then iteratively improving the approximation as more and more information is supplied. The god is to achieve an optimal description at each stage. In general an ongoing description ..."
Abstract
-
Cited by 218 (0 self)
- Add to MetaCart
Abstrocr-The successive refinement of information consists of first approximating data using a few bits of information, then iteratively improving the approximation as more and more information is supplied. The god is to achieve an optimal description at each stage. In general an ongoing
Additive successive refinement
- IEEE Trans. Inf. Theory
, 1983
"... Abstract—Rate-distortion bounds for scalable coding, and conditions under which they coincide with nonscalable bounds, have been extensively studied. These bounds have been derived for the general tree-structured refinement scheme, where reproduction at each layer is an arbitrarily complex function ..."
Abstract
-
Cited by 16 (3 self)
- Add to MetaCart
of all encoding indexes up to that layer. However, in most practical applications (e.g., speech coding) “additive ” refinement structures such as the multistage vector quantizer are preferred due to memory limitations. We derive an achievable region for the additive successive refinement problem
Successive Refinement of Empirical Models
"... An approach for automatic control using on-line learning is presented. The controller’s model for the system represents the effects of control actions in v,’u’ious (hyperspherical) regions of state space. The partition produced by these regions is initially coarse, limiting optimization of the corre ..."
Abstract
- Add to MetaCart
partition undergoes successive refinement, with "generalization " occurring over successively smaller areas. The system model effectively grows and becomes more accurate with time. 1
TEXTURE MAPPING BY SUCCESSIVE REFINEMENT
"... We define texture mapping as an optimization problem for which the goal is to preserve the maximum amount of information in the mapped texture. We derive a solution that is optimal in the least-squares sense and that corresponds to the pseudo-inverse of the texture-mapping transformation. In practic ..."
Abstract
- Add to MetaCart
. In practice, a first-order ap-proximation of the least-squares solution is used as an initial estimate for the mapped texture. This initial solution is refined by successive approximation to yield the least-squares optimal result. In essence, the pro-posed multi-pass method acts like an adaptive anti
Design of Successively Refinable Scalar Quantizers
"... The problem of successively refinable scalar quantizer design is considered. The weighted average of the expected distortion at each level of refinement is used as a quantizer figure of merit. Quantizers designed using this criterion can find application in many practical situations. Algorithms are ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
The problem of successively refinable scalar quantizer design is considered. The weighted average of the expected distortion at each level of refinement is used as a quantizer figure of merit. Quantizers designed using this criterion can find application in many practical situations. Algorithms
On Successive Refinement for the Wyner-Ziv Problem
- IEEE Trans. Inf. Theory
, 2003
"... Achievable rates are characterized for successive re nement in the Wyner{Ziv scenario, namely, in the presence of correlated side information (SI) at the receiver. In this setting, the encoder is assumed to operate in two stages, where the rst corresponds to relatively low rate and high distorti ..."
Abstract
-
Cited by 56 (9 self)
- Add to MetaCart
Achievable rates are characterized for successive re nement in the Wyner{Ziv scenario, namely, in the presence of correlated side information (SI) at the receiver. In this setting, the encoder is assumed to operate in two stages, where the rst corresponds to relatively low rate and high
Distributed Source Coding Via Successive Refinement
, 2004
"... We show that any point in the Berger-Tung rate region can be achieved via successive Wyner-Ziv coding. We generalize the concept of successive refinement from single source coding to multisource coding, where we refer to it as distributed successive refinement. The quadratic Gaussian CEO problem is ..."
Abstract
- Add to MetaCart
We show that any point in the Berger-Tung rate region can be achieved via successive Wyner-Ziv coding. We generalize the concept of successive refinement from single source coding to multisource coding, where we refer to it as distributed successive refinement. The quadratic Gaussian CEO problem
Entropy-Constrained Successively Refinable Scalar Quantization
- Proc. IEEE Data Compression Conf
, 1997
"... We study the design of entropy--constrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rate ..."
Abstract
-
Cited by 9 (2 self)
- Add to MetaCart
We study the design of entropy--constrained successively refinable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate
On Common Information and the Encoding of Sources that are Not Successively Refinable
"... Abstract—This paper focuses on a new framework for scalable coding of information based on principles derived from common information of two dependent random variables. In the conventional successive refinement setting, the encoder generates two layers of information called the base layer and the en ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
Abstract—This paper focuses on a new framework for scalable coding of information based on principles derived from common information of two dependent random variables. In the conventional successive refinement setting, the encoder generates two layers of information called the base layer
Reachability analysis of probabilistic systems by successive refinements
- Proc. 1st Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Veri (PAPM/PROBMIV'01), volume 2165 of LNCS
, 2001
"... Abstract. We report on a novel development to model check quantitative reachability properties on Markov decision processes together with its prototype implementation. The innovation of the technique is that the analysis is performed on an abstraction of the model under analysis. Such an abstraction ..."
Abstract
-
Cited by 73 (3 self)
- Add to MetaCart
. Such an abstraction is significantly smaller than the original model and may safely refute or accept the required property. Otherwise, the abstraction is refined and the process repeated. As the numerical analysis necessary to determine the validity of the property is more costly than the refinement process
Results 1 - 10
of
3,444
