Loss-resilient Coding of Texture and Depth for Free-viewpoint Video Conferencing

Free-viewpoint video conferencing allows a participant to observe the remote 3D scene from any freely chosen viewpoint. An intermediate virtual viewpoint image is commonly synthesized using two pairs of transmitted texture and depth maps from two neighboring captured viewpoints via depth-image-based rendering (DIBR). To maintain high quality of synthesized images, it is imperative to contain the adverse effects of network packet losses that may arise during texture and depth video transmission. Towards this end, we develop an integrated approach that exploits the representation redundancy inherent in the multiple streamed videos a voxel in the 3D scene visible to two captured views is sampled and coded twice in the two views. In particular, at the receiver we first develop an error concealment strategy that adaptively blends corresponding pixels in the two captured views during DIBR, so that pixels from the more reliable transmitted view are weighted more heavily. We then couple it with a sender-side optimization of reference picture selection (RPS) during real-time video coding, so that blocks containing samples of voxels that are visible in both views are more error-resiliently coded in one view only, given adaptive blending will erase errors in the other view. Further, synthesized view distortion sensitivities to texture versus depth errors are analyzed, so that relative importance of texture and depth code blocks can be computed for system-wide RPS optimization. Experimental results show that the proposed scheme can outperform the use of a traditional feedback channel by up to 0.82 dB on average at 8% packet loss rate, and by as much as 3 dB for particular frames

Real-time transmission of digital video using variable-length coding

Huffman coding is a variable-length lossless compression technique where data with a high probability of occurrence is represented with short codewords, while 'not-so-likely' data is assigned longer codewords. Compression is achieved when the high-probability levels occur so frequently that their benefit outweighs any penalty paid when a less likely input occurs. One instance where Huffman coding is extremely effective occurs when data is highly predictable and differential coding can be applied (as with a digital video signal). For that reason, it is desirable to apply this compression technique to digital video transmission; however, special care must be taken in order to implement a communication protocol utilizing Huffman coding. This paper addresses several of the issues relating to the real-time transmission of Huffman-coded digital video over a constant-rate serial channel. Topics discussed include data rate conversion (from variable to a fixed rate), efficient data buffering, channel coding, recovery from communication errors, decoder synchronization, and decoder architectures. A description of the hardware developed to execute Huffman coding and serial transmission is also included. Although this paper focuses on matters relating to Huffman-coded digital video, the techniques discussed can easily be generalized for a variety of applications which require transmission of variable-length data

Robust Transmission of Images Based on JPEG2000 Using Edge Information

In multimedia communication and data storage, compression of data is essential to speed up the transmission rate, minimize the use of channel bandwidth, and minimize storage space. JPEG2000 is the new standard for image compression for transmission and storage. The drawback of Compression is that compressed data are more vulnerable to channel noise during transmission. Previous techniques for error concealment are classified into three groups depending on the Approach employed by the encoder and decoder: Forward Error Concealment, Error Concealment by Post Processing and Interactive Error Concealment. The objective of this thesis is to develop a Concealment methodology that has the capability of both error detection and concealment, be Compatible with the JPEG2000 standard, and guarantees minimum use of channel bandwidth. A new methodology is developed to detect corrupted regions/coefficients in the received Images the edge information. The methodology requires transmission of edge information of wavelet coefficients of the original image along with JPEG2000 compressed image. At the receiver, the edge information of received wavelet coefficients is computed and compared with the received edge information of the original image to determine the corrupted coefficients. Three methods of concealment, each including a filter, are investigated to handle the corrupted regions/coefficients. MATLAB™ functions are developed that simulate channel noise, image transmission Using JPEG2000 standard and the proposed methodology. The objective quality measure such as Peak-signal-to-noise ratio (PSNR), root-mean-square error (rms) and subjective quality Measure are used to evaluate processed images. The simulation results are presented to demonstrate The performance of the proposed methodology. The results are also compared with recent approaches Found in the literature. Based on performance of the proposed approach, it is claimed that the Proposed approach can be successfully used in wireless and Internet communications

Concealment algorithms for networked video transmission systems

This thesis addresses the problem of cell loss when transmitting video data over an ATM network. Cell loss causes sections of an image to be lost or discarded in the interconnecting nodes between the transmitting and receiving locations. The method used to combat this problem is to use a technique called Error Concealment, where the lost sections of an image are replaced with approximations derived from the information in the surrounding areas to the error. This technique does not require any additional encoding, as used by Error Correction. Conventional techniques conceal from within the pixel domain, but require a large amount of processing (2N2 up to 20N2) where N is the dimension of an N×N square block. Also, previous work at Loughborough used Linear Interpolation in the transform domain, which required much less processing, to conceal the error. [Continues.

High Quality of Service on Video Streaming in P2P Networks using FST-MDC

Video streaming applications have newly attracted a large number of participants in a distribution network. Traditional client-server based video streaming solutions sustain precious bandwidth provision rate on the server. Recently, several P2P streaming systems have been organized to provide on-demand and live video streaming services on the wireless network at reduced server cost. Peer-to-Peer (P2P) computing is a new pattern to construct disseminated network applications. Typical error control techniques are not very well matched and on the other hand error prone channels has increased greatly for video transmission e.g., over wireless networks and IP. These two facts united together provided the essential motivation for the development of a new set of techniques (error concealment) capable of dealing with transmission errors in video systems. In this paper, we propose an flexible multiple description coding method named as Flexible Spatial-Temporal (FST) which improves error resilience in the sense of frame loss possibilities over independent paths. It introduces combination of both spatial and temporal concealment technique at the receiver and to conceal the lost frames more effectively. Experimental results show that, proposed approach attains reasonable quality of video performance over P2P wireless network.Comment: 11 pages, 8 figures, journa

Iterative joint design of source codes and multiresolution channel codes

We propose an iterative design algorithm for jointly optimizing source and channel codes. The joint design combines channel-optimized vector quantization (COVQ) for the source code with rate-compatible punctured convolutional (RCPC) coding for the channel code. Our objective is to minimize the average end-to-end distortion. For a given channel SNR and transmission rate, our joint source and channel code design achieves an optimal allocation of bits between the source and channel coders. This optimal allocation can reduce distortion by up to 6 dB over suboptimal allocations for the source data set considered. We also compare the distortion of our joint iterative design with that of two suboptimal design techniques: COVQ optimized for a given channel bit-error-probability, and RCPC channel coding optimized for a given vector quantizer. We conclude by relaxing the fixed transmission rate constraint and jointly optimizing the transmission rate, source code, and channel code

Video transmission over a relay channel with a compress-forward code design

There is an increasing demand to support high data rate multimedia applications over the current day wireless networks which are highly prone to errors. Relay channels, by virtue of their spatial diversity, play a vital role in meeting this demand without much change to the current day systems. A compress-forward relaying scheme is one of the exciting prospects in this regard owing to its ability to always outperform direct transmission. With regards to video transmission, there is a serious need to ensure higher protection for the source bits that are more important and sensitive. The objective of this thesis is to develop a practical scheme for transmitting video data over a relay channel using a compress-forward relaying scheme and compare it to direct and multi-hop transmissions. We also develop a novel scheme whereby the relay channel can be used as a means to provide the required unequal error protection among the MPEG-2 bit stream. The area of compress-forward (CF) relaying has not been developed much to date, with most of the research directed towards the decode-forward scheme. The fact that compress-forward relaying always ensures better results than direct transmission is an added advantage. This has motivated us to employ CF relaying in our implementation. Video transmission and streaming applications are being increasingly sought after in the current generation wireless systems. The fact that video applications are bandwidth demanding and error prone, and the wireless systems are band-limited and unreliable, makes this a challenging task. CF relaying, by virtue of their path diversity, can be considered to be a new means for video transmission. To exploit the above advantages, we propose an implementation for video transmission over relay channels using a CF relaying scheme. Practical gains in peak signal-to-noise ratio (PSNR) have been observed for our implementation compared to the simple binary-input additive white Gaussian noise (BIAWGN) and two-hop transmission scenarios