Embedded Multiple Description Scalar Quantizers

نویسندگان

  • A. I. Gavrilescu
  • A. Munteanu
  • P. Schelkens
  • J. Cornelis
چکیده

A new class of Embedded Multiple Description Scalar Quantizers (EMDSQ) is proposed. EMDSQ meet the desired features of high redundancy level, fine grain rate adaptation and progressive transmission of each description. Experimental results show that EMDSQ yield better rate-distortion performance in comparison to Multiple Description Uniform Scalar Quantizers (MDUSQ) previously proposed in the literature. Introduction: Multiple Description Coding (MDC) was introduced to efficiently overcome the channel impairments over diversity-based systems by allowing decoders to extract meaningful information from a subset of the bit-stream. Previous research focused on finding the optimal achievable rate-distortion regions [1], followed by the design of practical compression systems [2] to meet these theoretical boundaries. For robust communication over unreliable channels, the MDC system must deliver error-resilient bit-streams with a corresponding high redundancy level. Additionally a fine-grain scalability of the bit-stream is also a desirable feature for bandwidth varying channels. The proposed EMDSQ meet these desired features consisting of a high redundancy level, fine-grain rate adaptation and progressive transmission of each description. The above-mentioned MDUSQ [3] and EMDSQ are incorporated in a wavelet-based coding system and the rate-distortion performances of both MDC systems are compared when applied on a common dataset. Finally, the generalized form of EMDSQ targeting an arbitrary number of channels allows the design of realistic coders for practical multi-channel communication systems. Embedded Multiple Description Scalar Quantizers: For the two-channel EMDSQ we denote the set of embedded side-quantizers as ,0 m S Q , ,1 m S Q ,..., , m P S Q with 1,2 m = , and the set of embedded central-quantizers as 0 C Q , 1 C Q , ..., P C Q , where 1 1 1 1, 2, 1 2 1 2 ( , ) ( ) ( ) p p p k k k k C S S Q q q Q q Q q − − − = I for any quantization level , 0 p p P ≤ ≤ . The partition cells of any quantizer , m p S Q and p C Q are embedded in the partition cells of , m P S Q , , 1 m P S Q − ,..., , 1 m p S Q + and P C Q , 1 P C Q − ,..., 1 p C Q + respectively. Vaishampayan’s method [2] to design MDSQ for two channels relies on generating 2D index allocation matrices. Theoretically, the index allocation method of [2] can be generalized to more than two channels and more than two receivers, respectively. For an arbitrary number of channels M, an M-dimensional index allocation matrix must be generated. However such a matrix can no longer be graphically represented as in [2] for 2 M = . Thus, M channel quantizers can only be formulated analytically. For M-channels, the analytical expression of the proposed EMDSQ is: ) ) ) ) , , , , , , , , , , , ( ) , , ( ) ( ) , , m p m p m p m p m p A Sup Sup Inf Inf m p S m p m p m p m p m p B Sup Sup Inf Inf Q x x A A A A Q x Q x x B B B B    ∈ − −    =     ∈ − −    U U , (1)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedded multiple description scalar quantizers for progressive image transmission

Equation Section 1 Robust progressive image transmission over unreliable channels with variable bandwidth requires Multiple Description Coding (MDC) systems that produce highly error-resilient embedded bitstreams. The proposed Embedded Multiple Description Scalar Quantizers (EMDSQ) meet the desired features consisting of a high redundancy level, fine grain rate adaptation and progressive transm...

متن کامل

Codecell Contiguity in Optimal Fixed-Rate and Entropy-Constrained Network Scalar Quantizers

We consider the properties of optimal xed-rate and entropy-constrained scalar quantizers for nite alphabet sources. In particular, w econsider conditions under which the optimal scalar quantizer with contiguous codecells achieves performance no worse than the optimal scalar quantizer without the constraint of codecell contiguit y.In addition to traditional scalar quantizers, w econsider multi-r...

متن کامل

Quantization as Histogram Segmentation: Globally Optimal Scalar Quantizer Design in Network System

We propose a polynomial-time algorithm for optimal scalar quantizer design on discrete-alphabet sources. Special cases of the proposed approach yield optimal design algorithms for fixed-rate and entropy-constrained scalar quantizers, multi-resolution scalar quantizers, multiple description scalar quantizers, and Wyner-Ziv scalar quantizers. The algorithm guarantees globally optimal solutions fo...

متن کامل

Design of multiple description scalar quantizers

AbsPuct-The design of scalar quantizers for communication systems that use diversity to overcome channel impairments is considered. The design problem is posed as an optimization problem and necessary conditions for optimality are derived. A design algorithm, a generalization of Lloyd’s algorithm for quantizer design, is developed. Unlike a single channel scalar quantizer, the performance of a ...

متن کامل

Multiple Description Lattice Vector Quantization

We consider the problem of designing structured multiple description vector quantizers. We present a general procedure for designing such quantizers based on the algebraic structure of the lattices, and we present detailed results for the hexagonal lattice: algorithms, asymptotic performance, and numerical simulations. A salient property of the proposed construction is that the second moment of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003