This paper deliberates for a multimedia transmission scheme combining multiple description coding (MDC) and network coding (NC). Our goal is to take advantage from the property of MDC to provide quantized and compressed independent and identically distributed (iid) descriptions and also from the benefit of network coding, which uses network resources efficiently to recover lost data in the netw...

Multiple description coding is a promising solution for robust video communication over non-prioritized and unpredictable networks. In this paper, we propose a new multiple description coding scheme for the H.264/AVC video coding standard which enables adaptive and robust video transmission in wireless networks. In the proposed MDC, each description has a different prediction loop and contains ...

In this paper we introduce and advocate the use of multiple description coding (MDC) in presence of channel diversity for fourth generation (4G) wireless communication networks. MDC allows to use the spectrum efficiently and simultaneously supporting heterogenous terminals. In this paper the investigations are made for voice and video type traffic. We present the drawbacks of the MDC scheme in ...

This book examines distributed video coding (DVC) and multiple description coding (MDC), two novel techniques designed to address the problems of conventional image and video compression coding. Covering all fundamental concepts and core technologies, the chapters can also be read as independent and self-sufficient, describing each methodology in sufficient detail to enable readers to repeat th...

Multiple description lattice vector quantization (MDLVQ) is a technique for two-channel multiple description coding. We observe that MDLVQ, in the form introduced by Servetto, Vaishampayan and Sloane in 1999, is inherently optimized for the central decoder; i.e., for a zero probability of a lost description. With a nonzero probability of description loss, performance is improved by modifying th...

New achievability results for the L-stage successive refinement problem with L > 2 are presented. These are derived from a recent achievability result for the more general problem of multiple description coding with L > 2 channels. It is shown that successive refinability on chains implies successive refinability on trees and that memoryless Gaussian sources are successively refinable on chains...

… This research was supported by a grant from the Indiana 21 Century Research and Technology Fund. Address all correspondence to P. Salama at [email protected] or E. J. Delp at [email protected]. ABSTRACT In this paper, we focus on the leaky prediction based scalable coding (LPSC) structure and present a general framework for LPSC. We demonstrate the similarity between LPSC and a motion compen...