191,885 research outputs found
Optimal Design of Multiple Description Lattice Vector Quantizers
In the design of multiple description lattice vector quantizers (MDLVQ),
index assignment plays a critical role. In addition, one also needs to choose
the Voronoi cell size of the central lattice v, the sublattice index N, and the
number of side descriptions K to minimize the expected MDLVQ distortion, given
the total entropy rate of all side descriptions Rt and description loss
probability p. In this paper we propose a linear-time MDLVQ index assignment
algorithm for any K >= 2 balanced descriptions in any dimensions, based on a
new construction of so-called K-fraction lattice. The algorithm is greedy in
nature but is proven to be asymptotically (N -> infinity) optimal for any K >=
2 balanced descriptions in any dimensions, given Rt and p. The result is
stronger when K = 2: the optimality holds for finite N as well, under some mild
conditions. For K > 2, a local adjustment algorithm is developed to augment the
greedy index assignment, and conjectured to be optimal for finite N.
Our algorithmic study also leads to better understanding of v, N and K in
optimal MDLVQ design. For K = 2 we derive, for the first time, a
non-asymptotical closed form expression of the expected distortion of optimal
MDLVQ in p, Rt, N. For K > 2, we tighten the current asymptotic formula of the
expected distortion, relating the optimal values of N and K to p and Rt more
precisely.Comment: Submitted to IEEE Trans. on Information Theory, Sep 2006 (30 pages, 7
figures
Approximation of fuzzy numbers by convolution method
In this paper we consider how to use the convolution method to construct
approximations, which consist of fuzzy numbers sequences with good properties,
for a general fuzzy number. It shows that this convolution method can generate
differentiable approximations in finite steps for fuzzy numbers which have
finite non-differentiable points. In the previous work, this convolution method
only can be used to construct differentiable approximations for continuous
fuzzy numbers whose possible non-differentiable points are the two endpoints of
1-cut. The constructing of smoothers is a key step in the construction process
of approximations. It further points out that, if appropriately choose the
smoothers, then one can use the convolution method to provide approximations
which are differentiable, Lipschitz and preserve the core at the same time.Comment: Submitted to Fuzzy Sets and System at Sep 18 201
- …