| Recently, there has been an outburst of research in image and video compression for transmission over noisy channels. Channel matched source quantizer design has gained prominence. Further, the presence of variable length codes in compression standards like the JPEG and the MPEG has made the problem more interesting. Error resilient entropy coding (EREC) 20] has emerged as a new and eeective ...

This report considers low resolution scalar quantization. Specifically, it considers entropyconstrained scalar quantization for memoryless Gaussian and Laplacian sources with both squared and absolute error distortion measures. The slope of the operational rate-distortion functions of scalar quantization for these sources and distortion measures is found. It is shown that in three of the four c...

This paper studies quantization error in the context of Matching Pursuit coded streams. The quantization noise is shown to depend on error on both coefficients and indexes. It is moreover influenced by the redundancy of the Matching Pursuit dictionary. A novel general formulation of the structural redundancy in overcomplete decompositions is shown to enhance the accuracy of classical redundancy...

AbdvactThe effects of quantization in an LMS-Newton adaptive filtering algorithm are investigated. The algorithm considered uses an optimum convergence factor, that forces the output ayoclteriori error to become zero in each iteration. The prOpagation of errors due to quantization in the internal variables of the algorithm is investigated and a closed-form formula for the excess mean square err...

We study the quantization problem for certain types of jump processes. The probabilities for the number of jumps are assumed to be bounded by Poisson weights. Otherwise, jump positions and increments can be rather generally distributed and correlated. We show in particular that in many cases entropy coding error and quantization error have distinct rates. Finally, we investigate the quantizatio...

We review two versions of a new topology preserving mapping, the HaToM. This mapping has previously been investigated as a data visualization tool but, in this paper, we investigate empirically the quantization errors in both versions of the mapping. We show that the more model driven version does not minimise the quantization error either when it is calculated in the usual manner or when we us...

Grayscale halftoning converts a continuous-tone image (e.g., 8 bits per pixel) to a lower resolution (e.g., 1 bit per pixel) for printing or display. Grayscale halftoning by error diffusion uses feedback to shape the quantization noise into high frequencies where the human visual system (HVS) is least sensitive. In color halftoning, the application of grayscale error-diffusion methods to the in...

The fast digital shearlet transform (FDST) was recently introduced as a means to analyze natural images efficiently, owing to the fact that those are typically governed by cartoon-like structures. In this paper, we introduce and discuss a first-order hybrid sigma-delta quantization algorithm for coarsely quantizing the shearlet coefficients generated by the FDST. Radial oversampling in the freq...

The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique cal...

Further improvement in performance, to achieve near transparent quality LSF quantization, is shown to be possible by using a higher order two dimensional (2-D) prediction in the coefficient domain. The prediction is performed in a closed-loop manner so that the LSF reconstruction error is the same as the quantization error of the prediction residual. We show that an optimum 2-D predictor, explo...