A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established by generalizing Ozarow's celebrated converse argument through the introduction ...
详细信息
A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established by generalizing Ozarow's celebrated converse argument through the introduction of auxiliary random variables that form a Markov tree. For the quadratic vector Gaussian case, this lower bound is shown to be achievable by an extended El Gamal-Cover scheme, yielding a complete characterization of the minimum sum rate.
In this paper we examine the Distortion-Rate (D-R) performance of two competing approaches for error-resilient transmission of scalable sources over error-prone packet-based memoryless channels. Thereby, we consider s...
详细信息
ISBN:
(纸本)9781424432974
In this paper we examine the Distortion-Rate (D-R) performance of two competing approaches for error-resilient transmission of scalable sources over error-prone packet-based memoryless channels. Thereby, we consider scalable Joint Source-Channel coding (JSCC) based on Forward Error Correction (FEC) and scalable multiple description coding (MDC). Our analysis considers memoryless Gaussian input sources encoded using source coders that can achieve theoretical performance bounds. This input source model is independent of actual implementations of the source coders and therefore allows drawing conclusions on the theoretical D-R performance of both approaches. Our comparative analysis indicates that in matched channel conditions, the use of an optimized FEC-based JSCC approach yields significantly better error resilience compared to the use of scalable MDC. Moreover, it is shown that in mismatched conditions a scalable JSCC approach has the potential to outperform a scalable MDC approach.
The data delivery performance of multiple description coding (MDC) over unreliable network with capacity constraints is always related with three factors: redundancy rate, packet loss rate (PLR), bit error rate (BER)....
详细信息
ISBN:
(纸本)9780769543529
The data delivery performance of multiple description coding (MDC) over unreliable network with capacity constraints is always related with three factors: redundancy rate, packet loss rate (PLR), bit error rate (BER). It is supposed that the packet losses have been settled by MDC with certain redundancy. We simplified the network-adaptive data delivery problem to only relating with the redundancy rate factor, because the bit-error resilience of the system can be self-adaptively guaranteed well enough for any redundancy case by the proposed codeword ordering method. Then the problem becomes explicit, and is easily and precisely solved by the proposed iterative redundancy control method. The proposed scheme is an extension of scalar quantization (SQ) based MDC, either balanced or unbalanced case. The related index assignment (IA) problem is well solved, and the R-D bound is proved trending to be optimal. This method can be incorporated into any SQ-based MDC system to simplify the network-adaptive delivery problem, fully considering the related factors.
Different system may have different request on coding efficiency and security, even the characteristics of the unreliable networks are fixed, such as bit error rate, packet loss rate and bandwidth. In this paper, a no...
详细信息
ISBN:
(纸本)9781612842547
Different system may have different request on coding efficiency and security, even the characteristics of the unreliable networks are fixed, such as bit error rate, packet loss rate and bandwidth. In this paper, a novel multiple description coding (MDC) scheme is presented for the unreliable networks, considering both the network characteristics and system request. An error-resilient problem based on MDSQ [1] method is proposed and analyzed, and then an iterative redundancy-control method is designed based on ERMDC [2] by index pair ordering. Accordingly, a fast IA method is proposed only considering the high redundancy case. Simulation results show that the redundancy can be easily and precisely adjusted to meet all the requests. Meanwhile, the error resilience and R-D bound of MDC is self-adaptively guaranteed well enough for all cases.
In this paper, a weighted reconstruction method for the prediction-compensated multiple description coding (PC-MDC) with two descriptions is proposed. Different from the original PC-MDC, where the redundant data are s...
详细信息
ISBN:
(纸本)9781424416424
In this paper, a weighted reconstruction method for the prediction-compensated multiple description coding (PC-MDC) with two descriptions is proposed. Different from the original PC-MDC, where the redundant data are simply discarded when both descriptions are received, we use a weighted average of all available data to recover the signal. The closed-form solution of the optimal weighting factors and the corresponding bit allocations are derived for M-band perfect reconstruction filter bank based PC-MDC. The asymptotic performance of the method is also studied. Theoretical analysis shows that the proposed method further reduces the expected distortion and the distortion product of the non-weighted PC-MDC method.
In this paper, we revisit the multiple description coding problem with one semi-deterministic distortion measure, which we term as the Fu-Yeung problem (Fu and Yeung, 2002). We present the properties of optimal test c...
详细信息
ISBN:
(纸本)9781509050192
In this paper, we revisit the multiple description coding problem with one semi-deterministic distortion measure, which we term as the Fu-Yeung problem (Fu and Yeung, 2002). We present the properties of optimal test channels for the minimum sum-rate function, a non-asymptotic converse bound and second-order asymptotics for discrete memoryless sources. Since the successive refinement problem is a special case of the Fu-Yeung problem, as a by-product, we obtain a non-asymptotic converse bound for the successive refinement problem, which turns out to be a strict generalization of the non-asymptotic converse bound for successively refinable sources (Zhou, Tan and Motani, 2017).
In this paper, a comparison of a scalable multiple description coding (MDC) scheme and the forward error correction (FEC) coding using Raptor code for the scalable extension of H.264/AVC (SVC) is presented. Unequal an...
详细信息
ISBN:
(纸本)9781467345729
In this paper, a comparison of a scalable multiple description coding (MDC) scheme and the forward error correction (FEC) coding using Raptor code for the scalable extension of H.264/AVC (SVC) is presented. Unequal and equal protection of the base and enhancement layer with different amount of redundancy at the average burst lengths of 2, 5 and 20 are considered. The experimental results show that scalable MDC is generally preferable at the low redundancy rate and long average burst length, while FEC using Raptor code is favorite in case of high redundancy rate and the channel with short average burst length for the resilient delivery of scalable video.
Offering a real time video transmission service, using mobile ad hoc networks (MANETs) and granting a specific Quality of Service (QoS) is a hard challenge. In fact, the network topology is extremely unstable and its ...
详细信息
ISBN:
(纸本)9783642024719
Offering a real time video transmission service, using mobile ad hoc networks (MANETs) and granting a specific Quality of Service (QoS) is a hard challenge. In fact, the network topology is extremely unstable and its variability causes the loss of transmitted information. However, powerful mechanisms against channel failures can be incorporated to avoid the system breakdown. In this paper, we evaluate the effect of multiple description coding (MDC) technique for improving video quality in a multimedia content distribution system. The architecture proposed is a hybrid fixed and wireless ad hoc network where nodes can move freely. Due to multipoint to point nature of this system, multidescription can be combined with multipath transmission to increase its efficiency and, at last, the Quality of Experience (QoE) of the final receiver. The simulation lets us compare the quality of the video streaming paying attention to quality parameters (PSNR, packet delivery ratio, decodable frame rate and interruptions). Results show that MDC improves video quality in high mobility scenarios.
In the studies related to multiple description coding (MDC), applying zero padding not only improves the spatial correlation between the descriptions but also increases the size. However, as we pad more zeros, the spa...
详细信息
ISBN:
(纸本)9781614994848;9781614994831
In the studies related to multiple description coding (MDC), applying zero padding not only improves the spatial correlation between the descriptions but also increases the size. However, as we pad more zeros, the spatial correlation does not improves linearly. Therefore, the distortion is not reduced as the same amount as the size increases. In this paper we focus on how to efficiently find an acceptable trade-off between the number of padded zeros and the increase of distortion. Based on a MDC method named "multiple description coding with Zero Padding based on spatial Quincunx distribution (QZP-MDC)", in this paper we propose a distortion estimation, which is "Standard Deviation for Distortion Estimation (STD-DE)" to efficiently calculate the distortion with specific padding direction and the number of padded zeros. To search for the acceptable the number of padded zeros, we design two search methods, Naive Search and Best Division Search, based on the proposed rate-distortion trade-off indicator. Our experiment results show that errors of distortion estimation by STD-DE are all less than 2%, and the executing times by best division search is about twice faster more than those of naive search for 11 test sequences. To summarize our work, we confirm that the best division search on STD-DE can find the acceptable trade-off between rate and distortion in low computational complexity.
This paper presents a formal study on the optimal layer bandwidth allocation for non-cumulative layered video or multiple description coding based broadcasting over broadband wireless networks. We first formulate the ...
详细信息
ISBN:
(纸本)0780374428
This paper presents a formal study on the optimal layer bandwidth allocation for non-cumulative layered video or multiple description coding based broadcasting over broadband wireless networks. We first formulate the optimal bandwidth allocation problem with the objective of maximizing goodput, the total bandwidth delivered to all the receivers in a session. We show that this problem, in its most general form, is computationally intractable. We then propose three practically effective heuristic algorithms for wireless broadcast environments, namely, Merge-Based Allocation (MBA), Multi-Granular Allocation (MGA), and Cumulative Layering based Allocation (CLA). Numerical results show that all three heuristic algorithms significantly outperform non-adaptive allocation algorithms.
暂无评论