مرکز منطقه ای اطلاع رساني علوم و فناوري - Design of absolutely optimal quantizers for a wide class of distortion measures

Abstract :

In this paper designs of two types of quantizers are presented. The first type is designed to minimize a distortion measure under the constraint that the number of levels is fixed or the entropy of the output signal is bounded below a given value. The distortion measure is defined as $E[f(x,\\eta)]$ , the expected value of an error weighting function $f(x, \\eta)$ , where $x$ is the quantizer input and $\\eta$ is the corresponding quantization error. This paper departs from the quautization work reported in the literature heretofore in allowing $f$ to be a function of $x$ as well as $\\eta$ . Algorithms to minimize such a distortion measure ander the constraints mentioned above are presented. They use a combination of dynamic programming and Fibonacci search. It is shown that if $f(x,\\eta)$ is semiconvex in $\\eta$ for all fixed values of $x$ , Fibonacci search can be used in one of the steps of the minimization algorithm. This reduces the number of multiplications by a factor of $M/(5 \\log M)$ when the range of input values is divided into $M$ parts. Some examples are considered. The first deals with an $f(x,\\eta)$ which is zero if $\\eta$ is below a certain threshold $T(x)$ and $\\eta_{2}-T_{2}(x)$ otherwise. It arises in coding video signals by differential pulse-code modulation (PCM). The second deals with the minimum mean-square quantization of a truncated Laplacian input density. The step sizes of the near-optimal uniform quantizers are obtained under varions entropy constraints. The third example shows that the optimal quantizer can be asymmetric, even when the probability density and the error weighting function are symmetric. The second type of quantizer is designed to minimize the number of levels or the output entropy, when the quantization error is constrained not to exceed a threshold function. Methods to design them are presented that involve, respectively, a geometric construction and a dynamic programming algorithm in which the domain of search is modified according to the constraint mentioned above.