Yilong Liu, S. Oraintara · 2006
In this paper, we introduce a novel wavelet-based multiple description image coder, referred to as the feature-oriented MDC (FO-MDC). The proposed multiple description coders exploit the statistics of the wavelet coefficients, and identify the subsets of samples those are sensitive to packet loss. A joint optimization between tree-pruning and quantizer selection in the rate-distortion sense is used in order to allocate more bits to these sensitive coefficients. When compared with the state-of-the-art multiple description scalar quantization coders, the proposed FO-MDC yields a more efficient central-side distortion tradeoff control mechanism. Furthermore, it proves to be more robust for image transmission even with high packet loss ratios.
Cited by 0
Anthony Chen, Shiwen Mao, Zhu Li et al. · 2024
With the advances of Virtual Reality (VR) / Augmented Reality (AR), there arises a compelling need for transmission of point clouds over lossy channels (e.g., a 5G millimeter wave (mmWave) link that tends to be easily blocked). In this paper, we revisit the traditional Multiple Description Coding (MDC) concept and propose a simple point cloud MDC scheme that takes advantage of voxelization and is built upon a typical geometric point cloud compression codec. Our simulation study demonstrates the efficacy of the proposed scheme, as well as the tradeoff between compression efficiency and point cloud quality gain offered by MDC.
Cited by 1
Clver, Kai, Sikora, Thomas · Zenodo (CERN European Organization for Nuclear Research) · 2005
Publication in the conference proceedings of EUSIPCO, Antalya, Turkey, 2005
Cited by 0Open access
Michael Gallant, Shahram Shirani, F. Kossentini · 2002
We address the problem of robust video transmission over unreliable networks. Our approach employs the principle of multiple-descriptions, through pre- and post-processing of the video data, without modification to the source or channel codecs. We employ oversampling to add redundancy to the original video data followed by a decomposition of the oversampled video frames into "equal" sub-images which can be coded and transmitted over separate channels. Simulations using two descriptions show that this approach maintains excellent reconstructed video quality when only one description is received.
Cited by 33
Jingxiu Zong, Lili Meng, Huaxiang Zhang et al. · KSII Transactions on Internet and Information Systems · 2017
In this paper, a novel multiple description image coding (MDC) scheme is proposed, which is based on the characteristics of the human visual model. Due to the inherent characteristics of human vision, the human eye can only perceive the change of the specific thresholds, that is, the just noticeable difference (JND) thresholds. Therefore, JND model is applied to improve MDC syetem. This paper calculates the DCT coefficients firstly, and then they are compared with the JND thresholds. The data that is less than the JND thresholds can be neglected, which will improve the coding efficiency. Compared with other existing methods, the experimental results of the proposed method are superior.
Cited by 20
Fabio Verdicchio, Adrian Munteanu, A.I. Gavrilescu et al. · IEEE Transactions on Image Processing · 2006
Real-time delivery of video over best-effort error-prone packet networks requires scalable erasure-resilient compression systems in order to 1) meet the users' requirements in terms of quality, resolution, and frame-rate; 2) dynamically adapt the rate to the available channel capacity; and 3) provide robustness to data losses, as retransmission is often impractical. Furthermore, the employed erasure-resilience mechanisms should be scalable in order to adapt the degree of resiliency against transmission errors to the varying channel conditions. Driven by these constraints, we propose in this paper a novel design for scalable erasure-resilient video coding that couples the compression efficiency of the open-loop architecture with the robustness provided by multiple description coding. In our approach, scalability and packet-erasure resilience are jointly provided via embedded multiple description scalar quantization. Furthermore, a novel channel-aware rate-allocation technique is proposed that allows for shaping on-the-fly the output bit rate and the degree of resiliency without resorting to channel coding. As a result, robustness to data losses is traded for better visual quality when transmission occurs over reliable channels, while erasure resilience is introduced when noisy links are involved. Numerical results clearly demonstrate the advantages of the proposed approach over equivalent codec instantiations employing 1) no erasure-resilience mechanisms, 2) erasure-resilience with nonscalable redundancy, or 3) data-partitioning principles.
Cited by 38
Chao Tian, S.S. Hemami · 2006
We consider the problem of constructing visually optimized balanced multiple descriptions of images, instead of being op- timized with the conventional measure of mean squared error (MSE). The recently proposed Modified Multiple Description Scalar Quantizer (MMDSQ) is used because its central and side quantizers all have convex and uniform cells. Since the majority of research results on the visual distortion caused by quantization noise assumes convex and uniform quantizer cells, they can be conveniently applied to the system based on MMDSQ. The technique provides substantially higher side reconstruction perceived quality when compared at the same central reconstruction quality, which is verified through per- ceptual tests.
Cited by 2
Wei Zhang · 2004
Recently, the problem of packet loss and errors in image communication over erasure channels, such as Internet and wireless networks, becomes an important topic. This creates the need for new approaches to image coding, which combine high compression efficiency and robustness. As a new approach, multiple description coding (MDC) is attractive in this field, which separates the source into several equally important bit streams(descriptions) and then transmitted over different channels. Based on many related literatures, an overview on the state of the art of MDC is given in this paper. Firstly, MDC's history and background in information theory are introduced. And then MDC is classified into several categories, including quantizion based, transform based, space expansion based and so on. Each is described respectively from the mathematic model and its applied conditions. Comparisons between MDSQ and MDPCT are made followed. At the end, some conclusions are given, including problems in MDC and what will MDC be in the future.
Cited by 0
Real-time Low, Bit-rate Voice, Over Ip · 2008
Abstract—A fundamental issue in real-time interactive voice transmissions over unreliable IP networks is the loss or late arrival of packets for playback. This problem is especially serious when transmitting low bit rate-coded speech with pervasive dependencies introduced. In this case, the loss or late arrival of a single packet will lead to the loss of subsequent dependent frames. In this paper, we study end-to-end loss-concealment schemes for ensuring high quality in playback. We propose a novel multiple description-coding method for concealing packet losses in transmitting low bit rate-coded speech. Based on high correlations observed in linear predictor parameters–in the form of Line Spectral Pairs (LSPs)–of adjacent frames, we generate multiple descriptions in senders by interleaving LSPs, and reconstruct lost LSPs in receivers by linear interpolations. As excitation codewords have low correlations, we further enlarge the segment size for excitation generation and replicate excitation codewords in all the descriptions in order to maintain the same transmission bandwidth. Our proposed scheme can be extended easily to more than two descriptions and can adapt its number of descriptions dynamically to network-loss conditions. Experimental results on FS-1016 CELP, ITU G.723.1, and FS MELP coders show good performance of our scheme. Index Terms—Internet, Line Spectral Pairs, loss concealment, low bit-rate speech coding, multiple-description coding, single-description
Cited by 0
Xin Zhong, Biing-hwang Juang · 2008
Most existing speech and audio coders were developed to meet a single purpose of delivering the best quality possible under fixed constraints in bit-rate, computational complexity, and algorithmic delay. Recent expansion in network communications demands the additional capability to cope with the packet-lossy nature associated with these networks. The problem lies within the research area of multiple description coding (MDC). In this report we investigate its essence, state its inherent limitations and tradeoffs, and propose a novel method to design efficient MDC systems for speech.
Cited by 0
Vivek K Goyal, Jelena Kovačević, R. Arean et al. · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2002
Generalized multiple description coding (GMDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction. This paper reports on applications of two recently proposed methods for GMDC to image coding. The first produces statistically correlated streams such that lost streams can be estimated from the received data. The second uses quantized frame expansions and hence is conceptually similar to block channel coding, except it is done prior to quantization.
Cited by 147Open access
Morten Holm Larsen, Petar Popovski, S.V. Andersen · Kluwer Academic Publishers eBooks · 2006
Cited by 2
M. Oguz Bici, Gözde Bozdağı Akar · Signal Processing Image Communication · 2010
Cited by 0Open access
Mehrdad Valipour, Farshad Lahouti · IEEE Transactions on Signal Processing · 2011
In this paper, for robust and efficient transmission of multiple correlated sources over noisy channels with packet loss, a channel optimized distributed multiple description vector quantization (CDMD) scheme is presented. The proposed CDMD scheme enjoys low-complexity encoding and delay and a scalable CDMD decoder, which jointly reconstructs the symbols of an arbitrary number of correlated sources. This, for example, suits data-gathering applications in wireless sensor networks. The CDMD encoder is designed using a deterministic annealing approach based on a minimum mean squared error asymmetric CDMD. A CDMD decoder for asymmetric distributed source coding is presented, which takes into account the side information, as well as channel noise and packet loss. Two types of iterative symmetric CDMD decoders, namely the estimated-SI and the soft-SI decoders, are presented, which respectively exploit the reconstructed symbols and a posteriori probabilities of other sources as SI in iterations. In a multiple-source CDMD setting, for reconstruction of a source, three methods are proposed to select another source as its SI during the decoding. The methods operate based on minimum physical distance, maximum mutual information, and minimum end-to-end distortion. The performance of the proposed systems and algorithms are evaluated and compared in detail.
Cited by 5Open access
Cheng Wu · 2005
With the development of communication and video coding technology, it is possible to transport video content via network and wireless channel at present. In these circumstances, with the existence of packet loss (network) and bit errors (wireless channel), video data is corrupted usually. To overcome this, many methods have been proposed. These methods can be classified into three main fields: source coding, channel coding and joint source and channel coding. Multiple description(MD) coding has been proved to be an effective method of source coding to overcome errors(packet loss specially) in channel transport. To make people have a concise knowledge on the multiple description coding, the main features of MD coding are presented. From the views of source coding and channel coding, the main methods used to solve the problem of packet loss are concluded respectively. Additionally, some new advances in the application and research of MD are discussed. Finally, the authors point out the of the future work.
Cited by 0
S.D. Servetto, Kannan Ramchandran, Vinay A. Vaishampayan et al. · IEEE Transactions on Image Processing · 2000
We consider the problem of coding images for transmission over error-prone channels. The impairments we target are transient channel shutdowns, as would occur in a packet network when a packet is lost, or in a wireless system during a deep fade: when data is delivered it is assumed to be error-free, but some of the data may never reach the receiver. The proposed algorithms are based on a combination of multiple description scalar quantizers with techniques successfully applied to the construction of some of the most efficient subband coders. A given image is encoded into multiple independent packets of roughly equal length. When packets are lost, the quality of the approximation computed at the receiver depends only on the number of packets received, but does not depend on exactly which packets are actually received. When compared with previously reported results on the performance of robust image coders based on multiple descriptions, on standard test images, our coders attain similar PSNR values using typically about 50-60% of the bit rate required by these other state-of-the-art coders, while at the same time providing significantly more freedom in the mechanism for allocation of redundancy among descriptions.
Cited by 227Open access
Ottavio Campana, T.Q. Nguyen · Zenodo (CERN European Organization for Nuclear Research) · 2007
Publication in the conference proceedings of EUSIPCO, Poznan, Poland, 2007
Cited by 0Open access
Shaoshuai Gao, H. Gharavi · 2006
This paper presents a multiple description (MD) video-coding scheme, which uses interlaced high signal to noise ratio (H-SNR) and low signal to noise ratio (L-SNR) coded frames to produce two bitstreams. At the decoder, when both bit-streams are received a high quality video will be reconstructed. If either one is received, a poorer but acceptable quality video can be reconstructed. In this approach, we also considered the mismatch between the encoding and decoding loops due to motion compensation if only one bit-stream is received. We first give the results of the rate distortion performance of our scheme assuming that only one description is received. We then present simulation results under packet loss circumstances, which are simulated by real-world IP networks and adhoc networks. It is shown that the proposed scheme has a superior performance when compared with the single description MPEG-4 video coder and MD coding using video redundancy coding.
Cited by 12
Niklas Wernersson, Mikael Skoglund · 2006
Summary form only given. This paper proposes a technique that would address the problem of designing multiple description source codes for J channels. Instead of implementing optimal combining we propose to simply average the decoded output of the individual channels and then adjust the length of the resulting vector based on a theoretical analysis valid for permutation codes. The choice of using permutation codes comes from the fact that their low complexity makes high dimensional vector quantization possible, i.e. large TV's, and our simulations have indicated that the random generation of rotation matrices works well when the dimension is high. For low dimensions, different outcomes of the generated rotation matrices seem to yield quite different performance, meaning that the random design may not be as appropriate for this case. Hence, any vector quantization scheme able to perform quantization in high dimensions could potentially replace the permutation coding in the proposed scheme. We also extend the method to use a fraction rho of the rate R to quantize the quantization error of the decoded data, when all descriptors are received, rather then using the whole rate to quantize the individual descriptors. This improves the performance when receiving all the descriptors at the cost of a decreased performance when some of the descriptors are lost. Varying rho therefore produces different operation points in the tradeoff between side and central distortion. The main advantages of the proposed method are its relatively low complexity and its ability to easily implement any number of descriptions
Cited by 2
Zhen Zhang, Thomas Berger · 2002
Multiple description source coding concerns situations in which the transmission of the source information is distributed over two channels at rates R/sub 1/ and R/sub 2/, respectively. When both channels are operative, the decoder receives data at rate R/sub 1/+R/sub 2/ which is used to reconstruct the source information with average distortion d/sub 0/. If one of the channels breaks down, the receiver has to base its reconstruction solely on the data available at rate either R/sub 1/ or R/sub 2/, depending on which channel is operative. This results in a higher distortion of either d/sub 1/ or d/sub 2/, respectively. The region R of all quintuples (R/sub 1/,R/sub 2/, d/sub 0/, d/sub l/, d/sub 2/) has been determined in the so-called /spl Sigma/'no excess rate' case defined by imposing the requirement R/sub 1/+R/sub 2/=R(d/sub 0/), where R(/spl middot/) is the rate-distortion function of the source. The case with excess rate in which R/sub 1/+R/sub 2/>R(d/sub 0/) is permitted seems difficult. Hence we study here a special case of the excess rate problem.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 0