We propose a balanced multiple description coding framework using rate-distortion splitting for three dimensional DCT (3D DCT) coded video data. The proposed algorithm produces correlated and balanced descriptions, wi...
详细信息
We propose a balanced multiple description coding framework using rate-distortion splitting for three dimensional DCT (3D DCT) coded video data. The proposed algorithm produces correlated and balanced descriptions, with balancing in terms of bit rate and receiver distortion. Our description splitting and balancing algorithm takes advantage of the structural properties of the 3D DCT video volume and the method of shifted compliment hyperboloid used in scanning and quantization of 3D DCT coefficients. Given the available bit rate and redundancy our simulations show high PSNR values for the reconstructed video. The proposed video codec requires a simple implementation, has a low complexity, and produces a high reconstruction quality. Comparative results with other schemes are included.
multiple description coding refers to the encoding of an information source into multiple bit streams, in a manner that each bit stream independently represents a "coarse" description of the source, while mu...
详细信息
multiple description coding refers to the encoding of an information source into multiple bit streams, in a manner that each bit stream independently represents a "coarse" description of the source, while multipledescriptions jointly convey a higher fidelity source representation. Thus multiple description coding allows enhanced resilience to loss of individual descriptions, and can be viewed as a form of source-based diversity coding. This paper addresses the design of subband filter banks to optimize the rate-distortion performance of multipledescription subband coding. The problem is formulated in a Lagrangian optimization framework, and is solved directly in the frequency domain to produce the optimal filter spectral responses. By varying the Lagrangian parameter, our design obtains all points on the redundancy-distortion curve for Gaussian wide-sense stationary input processes, We consider the cases of both orthonormal and more general biorthogonal filter banks. We also analyze the connections between these two solutions, and quantify the gap in their optimal performance. Application of the proposed methods to the popular first-order autoregressive (AR(1)) model yields very interesting and insightful results. In the two extreme cases of maximum and minimum redundancy, our solutions degenerate to previously known results. Finally, comparisons with popularly deployed biter banks reveal large gaps from the theoretical performance bound.
The polyphase-based mechanism is the basis of many multipledescriptions coding schemes. Its main drawback is the inefficient exploitation of the inserted redundancy, especially when the redundancy is large. In this p...
详细信息
The polyphase-based mechanism is the basis of many multipledescriptions coding schemes. Its main drawback is the inefficient exploitation of the inserted redundancy, especially when the redundancy is large. In this paper we propose a novel approach that uses mid-tread quantizers with tunable deadzone, in order to efficiently exploit the inserted redundancy. In particular, the deadzone width is selected based on the statistical distribution of the data, and the approximated level of redundancy to be inserted. The proposed approach is tailored for those codecs that use mid-tread quantizers with tunable step-size and deadzone width. This is particularly interesting given that the majority of codecs use this topology of quantization, and they rarely allow changing it. Moreover, the proposed scheme can be extended to the case of more than two descriptions. Finally, it is worth reporting that the results of the proposed approach outperform that of state-of-the-art schemes. In fact with the same side performance, the central quality can achieve up to 1 dB gain.
This paper studies the tight rate-distortion bound for L-channel symmetric multiple-descriptioncoding of a scalar Gaussian source with two levels of receivers. Each of the first-level receivers obtains kappa of the L...
详细信息
This paper studies the tight rate-distortion bound for L-channel symmetric multiple-descriptioncoding of a scalar Gaussian source with two levels of receivers. Each of the first-level receivers obtains kappa of the L descriptions (kappa < L). The second-level receiver obtains all.. descriptions. We find that if the central distortion (corresponding to the second-level receiver) is much smaller than the side distortion (corresponding to the first-level receivers), the product of a function of the side distortions and the central distortion is asymptotically independent of the redundancy between the descriptions. Using this property, we analyze the asymptotic behavior of a practical multiple-description lattice vector quantizer (MDLVQ). Our analysis includes the treatment of the MDLVQ system from a new geometric viewpoint, which results in an expression for the side distortions using the normalized second moment of a sphere of higher dimensionality than the quantization space. The expression of the distortion product derived from the lower bound is then applied as a criterion to assess the performance loss of the considered MDLVQ system. In principle, the efficiency of other practical MD systems can also be evaluated using the derived distortion product.
To combat erasure channels, multiple description coding (MDC) introduces diversity at source coding level. Each description provides a coarse reconstruction of source information at destination. As the number of recei...
详细信息
To combat erasure channels, multiple description coding (MDC) introduces diversity at source coding level. Each description provides a coarse reconstruction of source information at destination. As the number of received description increases, the reconstruction quality would be improved. Rate region of MDC is the set of achievable rates for a given set of expected distortions. In this paper, coalitional game theory is proposed as a nontrivial approach for determining rate region of MDC. To this end, elaborate game theoretic analysis is provided. Moreover, Shapley value is utilized to determine each description's rate. As a result, a fair rate adjustment is obtained that comprises entropy and mutual information of original and reconstructed descriptions.
In this correspondence, we consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstru...
详细信息
In this correspondence, we consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An achievable region is given for the two-user two-layer case and it provides the complete rate-distortion region for the Gaussian source under the MSE distortion measure. The key observation is that this problem includes the multipledescription (MD) problem (with two descriptions) as a subsystem, and the techniques useful in the MD problem can be extended to this case. It is shown that the coding scheme based on the universality of random binning is suboptimal, because multiple Gaussian side informations only at the decoders do incur performance loss, in contrast to the case of single side information at the decoder. It is further shown that unlike the single user case, when there are multiple users, the loss of performance by a multistage coding approach can be unbounded for the Gaussian source. The result suggests that in such a setting, the benefit of using successive refinement is not likely to justify the accompanying performance loss. The MSR problem is also related to the source coding problem where each decoder has its individual side information, while the encoder has the complete set of the side informations. The MSR problem further includes several variations of the MD problem, for which the specialization of the general result is investigated and the implication is discussed.
In a hybrid network, both the packet losses and the bit errors may affect the signal delivery performance. This problem becomes more serious when the packet loss rate (PLR) and the bit error rate (BER) change over tim...
详细信息
In a hybrid network, both the packet losses and the bit errors may affect the signal delivery performance. This problem becomes more serious when the packet loss rate (PLR) and the bit error rate (BER) change over time. Most existing solutions focus on either the packet loss problem or the bit error problem. We designed an adaptive multiple description coding (AMDC) scheme with the index assignment (IA) technique to solve these two problems simultaneously. The redundancy is added to AMDC to overcome the packet losses. And the redundancy rate can be precisely controlled to optimize the delivery performance for a given PLR, according to the end-to-end distortion model. Meanwhile, for any given BER, the bit error resilience of the scheme is guaranteed well by further exploiting the added redundancy in AMDC. Simulating results for an Lid. Gaussian source show that, the proposed scheme achieved significant improvement for both redundancy control and bit-error resilience simultaneously, comparing with existing solutions. (c) 2013 Elsevier B.V. All rights reserved.
The most recent literature indicates multiple description coding (MDC) as a promising coding approach to handle the problem of video transmission over unreliable networks with different quality and bandwidth constrain...
详细信息
The most recent literature indicates multiple description coding (MDC) as a promising coding approach to handle the problem of video transmission over unreliable networks with different quality and bandwidth constraints. In this work, we describe an approach that moves from the concept of spatial MDC and improves coding efficiency by exploiting some form of scalability. In the algorithm, we first generate four subsequences by sub-sampling, these subsequences are then taken in pairs that will form each of the two descriptions. For each description, one of the original subsequences is predicted from the other one via some scalable algorithms, focusing on the inter layer prediction scheme. The proposed algorithm has been implemented as pre- and post- processing of the standard H.264/SVC coder. The experimental results presented show that the algorithm provides excellent results in several conditions including 3D video sequences.
In this paper, we propose a novel multipledescription image coding (MDC) method,which can be called adaptive reconstruction based multiple description coding with randomly offset quantizations (ARMDROQ). In this sche...
详细信息
In this paper, we propose a novel multipledescription image coding (MDC) method,which can be called adaptive reconstruction based multiple description coding with randomly offset quantizations (ARMDROQ). In this scheme, two prediction modes are proposed, which are be defined as mode 1 and mode 2 respectively. Specifically, in the proposed ARMDROQ scheme, the input image is partitioned into M subsets and obtaining M descriptions. Then one subset of each description is encoded and decoded directly, while others are predicted encoded and decoded by using adaptive prediction modes. The experimental results show that the proposed scheme achieves better performance than other existing methods.
It is shown that the coding problem for an arbitrary point on the dominant face of an L-description El Gamal-Cover (EGC) region can be converted to that for a vertex of a K-description EGC region for some K <= 2L -...
详细信息
It is shown that the coding problem for an arbitrary point on the dominant face of an L-description El Gamal-Cover (EGC) region can be converted to that for a vertex of a K-description EGC region for some K <= 2L - 1, where the latter problem can be solved via successive coding. A practical scheme is proposed for the quadratic Gaussian case by reducing each step in successive coding to a Gaussian quantization operation and implementing such an operation using low-density generator matrix codes. The effectiveness of this scheme is verified through extensive simulation experiments.
暂无评论