# A Scalable Multiple Description Scheme for 3D Video Coding Based on the Interlayer Prediction Structure

Authors: Lorenzo Favalli; Marco Folli
Journal: International Journal of Digital Multimedia Broadcasting
 (2010)

---

## Abstract

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. Furthermore, following recent commercial availability of autostereoscopic 3D displays that allow 3D visual data to be viewed without the use of special headgear or glasses, it is anticipated that the applications of 3D video will increase rapidly in the near future. Moving from the concept of spatial MDC, in this paper we introduce some efficient algorithms to obtain 3D substreams that also exploit some form of scalability. These algorithms are then applied to both coded stereo sequences and to depth image-based rendering (DIBR). In these algorithms, we first generate four 3D subsequences by subsampling, and then two of these subsequences are jointly used to 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 algorithms can be implemented as pre- and postprocessing of the standard H.264/SVC coder that remains fully compatible with any standard coder. The experimental results presented show that these algorithms provide excellent results.


---

## Body

## 1. Introduction

The research on stereoscopic video has received high interest over the past decade in order to provide viewers with more realistic vision than traditional 2D video. Stereoscopic video coding has been traditionally performed using two different views which are then merged tocreate a full set of different possible views. Other than using this left and right views, a more recent technique, known as depth image-based rendering (DIBR) [1], represents 3D video based on a monoscopic video and associated per-pixel depth information, simply called color image (or video) and depth map, respectively. While the color consists of three components, Y, U, and V as in the traditional video applications, the depth map video uses only one component to store the depth information of objects within the scene related to the camera position. The advantage of such a scheme is that it can capture the stereoscopic sequences more easily compared to the traditional left and right views techniques.Even though 3D video can provide a more impressive experience than conventional 2D video, in the past, many factors such as huge bandwidth requirements and the discomfort due to special devices needed to observe 3D effect prevented widespread diffusion of 3D video in commercial services. Following the path of “traditional” video, it is easily foreseeable that, thanks to the improvements in coding techniques [2], also 3D applications will soon be available over both the Internet and wireless networks.Reliable video transmission over unreliable or inefficient networks such as the Internet or wireless networks poses many challenges related to bandwidth variations and packet losses due to congestion on one side and to fading, interference, and mobility on the other one [3]. Traditionally, to cope with network and device heterogeneity, scalability techniques have been proposed.A scalable video sequence is composed of a so-calledbase-layer and of one (or more) enhancement-layer(s): compared to a single-layer sequence, the base-layer is self-contained and fully decodable to a signal of lower quality and/or lower resolution in terms of pixel or time. Enhancement layers, on the contrary, cannot be decoded if the base layer is lost or damaged and can only be used to improve the overall quality. Scalable coders not only allow a stream to be sent over channels with different bandwidth constraints or to devices having different capabilities, but also allow for different error protection schemes or even adaptive transmission techniques to be applied. Scalability is successfully introduced in the coding algorithms since the MPEG2 standard [4] up to the fine grain scalable option (FGS) in MPEG4 [5, 6] and H.264 [7].A different approach in search for a solution to the problem of heterogeneous and unreliable networks is represented by multiple description coding (MDC). An MDC algorithm creates several substreams, all individually decodable, each at a lower quality than the original: receiving all the descriptions, ideally allows the full recovery of the single stream coded video [8, 9]. This approach is very attractive since it is possible to exploit the inherent protection provided by path diversity among the different descriptions [10].Since scalability and multiple descriptions target the solution of different problems (bandwidth variations for scalability and robustness for multiple description coding), it is useful to exploit a combination of the two complementary methods in order to obtain a more efficient video coding algorithm. Previous works have already addressed the topic, mixing scalability and MDC thus creating scalable multiple descriptions (MDSC) algorithms. Approaches include exploitation of temporal segregation [11], a hybrid of spatial and temporal prediction [12], and wavelet coding [13, 14].The starting point in this paper is to develop efficient mixes of scalability and multiple description and be compatible with a standard H.264/SVC coder. To this aim, we developed a method using simple pre and post processing schemes to generate substreams that can be used within the H.264/SVC coder. In the preprocessing part we down sample the original color and depth maps by rows and columns generating four subsequences that can be independently coded. To reduce redundancy, we propose to predict two of them by using some of the tools that guarantee scalability in the H.264/SVC coder. This method, called Interlayer Prediction Spatial Multiple Description Scalable Coding (ILPS-MDSC), takes advantage of the interlayer prediction method [7] introduced in H.264/SVC.The first sections of the paper are devoted to a description of previous related work in 3D and multiple descriptions coding (Sections2 and 3, resp.) and to the introduction of the scalable coding tools implemented in H.264/SVC (Section 4). The algorithm is described in Section 5, while the description of its implementation on top of the H.264/SVC coder and simulation results are provided in Section 6.


## 2. 3D Coding Algorithms

In this section we briefly recall the two basic techniques used to generate multiple views that can be used to generate 3D videos.


### 2.1. Stereoscopic (Left/Right) Video Coding

Coding of stereoscopic images has been the subject of research through several years. It basically mimics the human binocular view and consists of coding scenes captured by two slightly distant cameras. In stereoscopic viewing, two sets of images are used, one offered to the left eye and the other to the right eye of the viewer. Each of the views forms a normal two-dimensional sequence. Furthermore, the two views are taken under specific constraints, such that the human brain can fuse these two slightly different views resulting in the sensation of depth in the scene being viewed. Since this means doubling the information to be transmitted, the main focus in the research has been to exploit correlation between the two views. Since both cameras capture the same scene, the basic idea is to exploit the interview redundancy for compression. These redundancies can be of two types: interview similarity is across adjacent camera views, and temporal similarity between temporally successive images of each video. A coder that can efficiently explicit this kind of similarity is usually calledmultiview coder [15]. Unfortunately, although the two images are very similar, a disparity problem emerges as the system geometry may not be perfect. This disparity must be compensated and is generally described as an horizontal displacement between points collected by the two different sensors.


### 2.2. The DIBR Algorithm

The main advantage of DIBR technique compared to traditional representation of 3D video with left-right views is that it provides high-quality 3D video with smaller bandwidth. This is because the depth map can be coded more efficiently than the two streams of monoscopic views if correlations and properties of the depth map are properly identified. Conceptually, DIBR utilizes a depth frame to generate two virtual views from the same reference (original) view, one for the left eye and the other one for the right eye [16]. This process can be described by the following 2-steps procedure. Firstly, the original image points are re-projected into the 3D domain, utilizing the respective depth values. Thereafter, given the position of the left and right camera in the 3D domain, the views are obtained by the projection of the 3D intermediate points to the image plane of each camera. This procedure is usually referred to as “3D image warping” in the computer graphics literature. In this process the original image points at locations (x, y) are transferred to new locations (xL,y) and (xR,y) for left and right view, respectively according with the following formulas(1)xL=x+αx·tc2(1Z-1ZC),xR=x-αx·tc2(1Z-1ZC),
where αx is the focal length of the reference camera expressed in multiples of the pixel width and tC is the distance between the left and right virtual cameras. ZC is the convergence distance located at the zero parallax setting (ZPS) plane and Z denotes the depth value of each pixel in the reference view. Notes that the y component is constant since the virtual cameras used to capture the virtual views (left-right) are assumed to be located at the same horizontal plane. The quality of virtual views depends on the quality of received color and depth map.


## 2.1. Stereoscopic (Left/Right) Video Coding

Coding of stereoscopic images has been the subject of research through several years. It basically mimics the human binocular view and consists of coding scenes captured by two slightly distant cameras. In stereoscopic viewing, two sets of images are used, one offered to the left eye and the other to the right eye of the viewer. Each of the views forms a normal two-dimensional sequence. Furthermore, the two views are taken under specific constraints, such that the human brain can fuse these two slightly different views resulting in the sensation of depth in the scene being viewed. Since this means doubling the information to be transmitted, the main focus in the research has been to exploit correlation between the two views. Since both cameras capture the same scene, the basic idea is to exploit the interview redundancy for compression. These redundancies can be of two types: interview similarity is across adjacent camera views, and temporal similarity between temporally successive images of each video. A coder that can efficiently explicit this kind of similarity is usually calledmultiview coder [15]. Unfortunately, although the two images are very similar, a disparity problem emerges as the system geometry may not be perfect. This disparity must be compensated and is generally described as an horizontal displacement between points collected by the two different sensors.


## 2.2. The DIBR Algorithm

The main advantage of DIBR technique compared to traditional representation of 3D video with left-right views is that it provides high-quality 3D video with smaller bandwidth. This is because the depth map can be coded more efficiently than the two streams of monoscopic views if correlations and properties of the depth map are properly identified. Conceptually, DIBR utilizes a depth frame to generate two virtual views from the same reference (original) view, one for the left eye and the other one for the right eye [16]. This process can be described by the following 2-steps procedure. Firstly, the original image points are re-projected into the 3D domain, utilizing the respective depth values. Thereafter, given the position of the left and right camera in the 3D domain, the views are obtained by the projection of the 3D intermediate points to the image plane of each camera. This procedure is usually referred to as “3D image warping” in the computer graphics literature. In this process the original image points at locations (x, y) are transferred to new locations (xL,y) and (xR,y) for left and right view, respectively according with the following formulas(1)xL=x+αx·tc2(1Z-1ZC),xR=x-αx·tc2(1Z-1ZC),
where αx is the focal length of the reference camera expressed in multiples of the pixel width and tC is the distance between the left and right virtual cameras. ZC is the convergence distance located at the zero parallax setting (ZPS) plane and Z denotes the depth value of each pixel in the reference view. Notes that the y component is constant since the virtual cameras used to capture the virtual views (left-right) are assumed to be located at the same horizontal plane. The quality of virtual views depends on the quality of received color and depth map.


## 3. Multiple Descriptions Algorithms

Generally speaking, multiple description coding dates back to the mid 1970s when the first theoretical works appeared [17] soon followed by applications to voice coding [18]. Application to video was later introduced as described in [8]. The concept is simple and is based on splitting in some way the information to be transmitted which is then sent over independent channels. Being able to actually generate two (or more) distinct and independent information flows would optimally exploit transmission diversity. In the following we introduce some algorithms for MDC developed in the 2D video coding framework and some applications to 3D video.


### 3.1. Multiple Descriptions for 2D Video Transmission

A simple and efficient MDC scheme can be based on the temporal splitting of the odd and even frames of a video sequence into separate, individually decodable descriptions that can be decoded using standard receivers. Such a scheme, called Multiple Description Motion Compensation (MDMC), is described in [19] by designing temporal predictors that exploit not only the temporal correlation within a description, but also across the descriptions. Another simple method for MDC derives the descriptions as spatially subsampled copies of the original video sequence. In [20] a polyphase sub sampler along rows and columns is used to generate an arbitrary number of downsampled descriptions that are then independently coded. This scheme is then called Polyphase Spatial Subsampling multiple description coding (PSS-MDC).The main problem of these techniques, as long as they are solely multiple description methods, is that they aim at increasing the robustness by exploiting link diversity and do not address other important transmission challenges, such as bandwidth variations or device heterogeneity, which require a scalable approach. On the other side, a traditional scalable approach does not guarantee the same robustness provided by MDC.The complementarity of the two approaches has been exploited to implement an efficient solution that was called Multiple Description Scalable Coding (MDSC). A simple example of MDSC is the scalable extension of MDMC, proposed by [11]. A combination of motion compensation and spatial subsampling is described in [12].A new type of MDSC in which the multiple description is not obtained only via spatial or temporal algorithms but also introducing quality metrics affecting signal-to-noise ratio (SNR) has been proposed by several authors using wavelet-based coding, in order to reduce temporal and spatial redundancy [13]. Another approach using the DWT is proposed in [14]. It is possible to combine MCTF and DWT in the so-called 3D (or 2D+t) discrete wavelet transform which may be used to generate a PSS-MD with an arbitrary number or descriptions by first subsampling the original sequence by rows and columns and then coding each of them [21].Based on the scalable extension of the H.264 coder (H.264/SVC [22]), in [23] the authors proposed a further improvement of the MD-MCTF scheme, which separates each highpass frame generated by MCTF in two frames, the motion frame and the texture frame. Each of these frames is then handled separately, and the motion information is divided between the descriptions using a quincunx lattice, while the texture information is divided by sending the odd frames in one of the descriptions and the even frames in another with the exception of the intra coded macroblocks which are inserted in both descriptions.


### 3.2. Multiple Descriptions for 3D Video Coding

Depending on the stereoscopic coding approach used, different algorithms have been proposed to extend MDC to 3D video sequences.There are primarily three approaches that can be used for coding of stereoscopic video. The first one, calledSimulcast stereoscopic coding, involves independent coding of left and right views: either of the two views may be decoded and displayed as a compatible signal on 2D video receivers. In the second, called Compatible stereoscopic coding, one view, say the left view, is coded independently while the other one, in this case the right view, is then coded with respect to the independently coded view. Thus, only the independently coded view may be decoded and displayed as the compatible signal. Finally, the last method, called Joint stereoscopic coding, consists in coding both the left and right views together. Most of the common approaches tend to mix different views into one description. In these cases, one view is fully coded, while the others are usually time and/or spatially subsampled version of the originals [24]. This way of doing ensures that some information from which we reconstruct a three-dimensional vision is always available.Considering the case of DIBR coding, descriptions may be formed using any of the MDC algorithms described for the case of 2D video while depth data are superimposed to any description and eventually represent theenhancement layer in an MDSC-like approach [25]. An example of this scheme is the one proposed in [25], where the temporal MDC of the base layer is produced by using the multistate video coding approach, which separates the even and odd frames of a sequence into two MDC streams. Hence, in the scalable MDC simulation, the even and odd frames are separated before the encoding process for both texture and depth and are used to generate the two descriptions: one contains the even frames of both color view and depth map, while the other description contains the odd frames. In both descriptions, frames from the color view are coded in the base layer and those from the depth map are coded in the enhancement layer.


## 3.1. Multiple Descriptions for 2D Video Transmission

A simple and efficient MDC scheme can be based on the temporal splitting of the odd and even frames of a video sequence into separate, individually decodable descriptions that can be decoded using standard receivers. Such a scheme, called Multiple Description Motion Compensation (MDMC), is described in [19] by designing temporal predictors that exploit not only the temporal correlation within a description, but also across the descriptions. Another simple method for MDC derives the descriptions as spatially subsampled copies of the original video sequence. In [20] a polyphase sub sampler along rows and columns is used to generate an arbitrary number of downsampled descriptions that are then independently coded. This scheme is then called Polyphase Spatial Subsampling multiple description coding (PSS-MDC).The main problem of these techniques, as long as they are solely multiple description methods, is that they aim at increasing the robustness by exploiting link diversity and do not address other important transmission challenges, such as bandwidth variations or device heterogeneity, which require a scalable approach. On the other side, a traditional scalable approach does not guarantee the same robustness provided by MDC.The complementarity of the two approaches has been exploited to implement an efficient solution that was called Multiple Description Scalable Coding (MDSC). A simple example of MDSC is the scalable extension of MDMC, proposed by [11]. A combination of motion compensation and spatial subsampling is described in [12].A new type of MDSC in which the multiple description is not obtained only via spatial or temporal algorithms but also introducing quality metrics affecting signal-to-noise ratio (SNR) has been proposed by several authors using wavelet-based coding, in order to reduce temporal and spatial redundancy [13]. Another approach using the DWT is proposed in [14]. It is possible to combine MCTF and DWT in the so-called 3D (or 2D+t) discrete wavelet transform which may be used to generate a PSS-MD with an arbitrary number or descriptions by first subsampling the original sequence by rows and columns and then coding each of them [21].Based on the scalable extension of the H.264 coder (H.264/SVC [22]), in [23] the authors proposed a further improvement of the MD-MCTF scheme, which separates each highpass frame generated by MCTF in two frames, the motion frame and the texture frame. Each of these frames is then handled separately, and the motion information is divided between the descriptions using a quincunx lattice, while the texture information is divided by sending the odd frames in one of the descriptions and the even frames in another with the exception of the intra coded macroblocks which are inserted in both descriptions.


## 3.2. Multiple Descriptions for 3D Video Coding

Depending on the stereoscopic coding approach used, different algorithms have been proposed to extend MDC to 3D video sequences.There are primarily three approaches that can be used for coding of stereoscopic video. The first one, calledSimulcast stereoscopic coding, involves independent coding of left and right views: either of the two views may be decoded and displayed as a compatible signal on 2D video receivers. In the second, called Compatible stereoscopic coding, one view, say the left view, is coded independently while the other one, in this case the right view, is then coded with respect to the independently coded view. Thus, only the independently coded view may be decoded and displayed as the compatible signal. Finally, the last method, called Joint stereoscopic coding, consists in coding both the left and right views together. Most of the common approaches tend to mix different views into one description. In these cases, one view is fully coded, while the others are usually time and/or spatially subsampled version of the originals [24]. This way of doing ensures that some information from which we reconstruct a three-dimensional vision is always available.Considering the case of DIBR coding, descriptions may be formed using any of the MDC algorithms described for the case of 2D video while depth data are superimposed to any description and eventually represent theenhancement layer in an MDSC-like approach [25]. An example of this scheme is the one proposed in [25], where the temporal MDC of the base layer is produced by using the multistate video coding approach, which separates the even and odd frames of a sequence into two MDC streams. Hence, in the scalable MDC simulation, the even and odd frames are separated before the encoding process for both texture and depth and are used to generate the two descriptions: one contains the even frames of both color view and depth map, while the other description contains the odd frames. In both descriptions, frames from the color view are coded in the base layer and those from the depth map are coded in the enhancement layer.


## 4. Description of Scalable Coding Tools

H.264/AVC [22] is one of the latest international video coding standards. It uses state-of-the-art coding techniques and provides enhanced coding efficiency for a wide range of applications, including video telephony, video conferencing and video streaming. The scalable extension of H.264/AVC, named H.264/SVC, uses a layered approach to provide spatial, temporal, and SNR scalability such that only some specific combinations of spatial, temporal, and SNR data can be extracted and decoded from a global scalable video stream. The basic idea in designing the scalable extension of H.264/AVC is to extend the hybrid coding approach of this coder toward motion compensated temporal filtering. However, the algorithms that perform the prediction and update steps are similar to motion compensation techniques in the generalized B frame used in H.264/AVC, so that backward compatibility of the base layer of the scalable extension is guaranteed. Further detail of H.264/SVC can be found in [26].In addition to the basic coding tools of H.264/AVC, SVC provides some so-called interlayer prediction methods, which allow the exploitation of the statistical dependencies between different layers to improve the coding efficiency of the enhancement layers. In the previous coder, the only supported interlayer prediction methods employ the reconstructed samples of the lower layer signal. The prediction signal is formed by motion-compensated prediction inside the enhancement layer, by upsampling the reconstructed lower layer signal, or by averaging such an upsampled signal with a temporal prediction signal. Although the reconstructed lower layer samples represent the complete lower layer information, they are not necessarily the most suitable data that can be used for interlayer prediction.Usually, the interlayer predictor has to compete with the temporal predictor, and especially for sequences with slow motion and high spatial detail, the temporal prediction signal typically represents a better approximation of the original signal than the upsampled lower layer reconstruction. In order to improve the coding efficiency for spatial scalable coding, two additional interlayer prediction concepts have been added in SVC: prediction of macroblock modes and associated motion parameters and prediction of the residual signal. All interlayer prediction tools can be chosen on a macroblock or submacroblock basis allowing an encoder to select the coding mode that gives the highest coding efficiency and they are described below.InterLayer Intra Prediction. for SVC enhancement layers, an additional macroblock coding mode is provided, in which the macroblock prediction signal is completely inferred from colocated blocks in the reference layer without transmitting any additional side information. When the colocated reference layer blocks are intra-coded, the prediction signal is built by the upsampled reconstructed intra signal of the reference layer: a prediction method also referred to as interlayer intra-predictionInterLayer Macroblock Mode and Motion Prediction. when at least one of the colocated reference layer blocks is not intra-coded, the enhancement layer macroblock is interpicture predicted as in single-layer H.264/AVC coding, but the macroblock partitioning—specifying the decomposition into smaller blocks with different motion parameters, and the associated motion parameters—is completely derived from the colocated blocks in the reference layer. This concept is also referred to as interlayer motion prediction. For the conventional intercoded macroblock types of H.264/AVC, the scaled motion vector of the reference layer blocks can also be used as replacement for usual spatial motion vector predictor.InterLayer Residual Prediction. a further interlayer prediction tool referred to as interlayer residual prediction, targets a reduction of the bit rate required to transmit the residual signal of intercoded macroblocks. With the usage of residual prediction, the upsampled residual of the colocated reference layer blocks is subtracted from the enhancement layer residual (difference between the original and the interpicture prediction signal) and only the resulting difference, which often has a smaller energy then the original residual signal, is encoded using transform coding as specified in H.264/AVC.Other scalability techniques can be exploited by the H.264/SVC coder. In each layer, an independent hierarchical motion-compensated prediction structure with layer-specific motion parameters is employed. This hierarchical structure provides a temporal scalable representation of a sequence of input pictures that is also suitable for efficiently incorporating spatial and quality scalability. The reconstruction quality of a layer can be improved by additional coding of the so-called progressive refinement slices. These slices represent refinements of the texture data (intra- and residual data). Since the coding symbols of progressive refinement slices are ordered similarly to a coarse-to-fine description, these slices can be arbitrarily truncated in order to support fine granular scalability (FGS) or flexible bit-rate adaptation. Finally, Medium Grain Scalability (MGS) is introduced. This scalability allows to choose a partitioning of a block of 4× 4 DCT coefficients as specified by the so called MGSVectors. A quality identifier (Qid) which represents a priority inside the bitstream is then assigned to each packet of a slice. This type of scalability may lead to a number of layers that varies from coarse grain scalability to fine grain scalability. All these types of scalability are not specifically addressed in the present work.


## 5. Proposed Scheme

We have developed a scheme to generate multiple descriptions, based on the prediction algorithms of the scalable extension of H.264/AVC. In order to preserve the standard coder, a pre and post processing scheme is implemented. In the preprocessing part, we downsample the original sequence by rows and columns thus generating four different subframes, similarly to what is done in PSS-MD. These subframes could in principle be used to generate four independent descriptions. Since they are in general highly correlated, we can exploit this by reducing the number of descriptions to two so that each description will be formed by two of the subframes arranged so that one subframe will be predicted form the other. By doing this, we still obtain two independent descriptions and, for each description, we remove a large part of the redundancy due to spatial correlation.Scalability within each description is easily obtained exploiting the options provided by the scalable extension of the H.264 standard introduced in Section4. Specifically, a coarse grain scalable (CGS) stream (i.e., a stream formed by a base layer and a single enhancement layer) is obtained by forcing the coder to accept one subframe as the base layer and the other as the enhancement layer. This process is depicted in Figure 3 and repeated for both the descriptions to be generated. Prediction is performed by the coder itself using its internal interlayer predictionalgorithms. No prediction is performed across the descriptions.In case of bandwidth variations or devices requiring a lower-grade signal, scalability will be simply obtained by discarding the enhancement layer(s). Note that a more radical form of scalability can be devised by allowing the receiver to decode only the base layer of one description, which means in practice that only1/4th of the information will be delivered. In other words the following scenarios can be seen.(1)
Both descriptions are completely received. In this case all the information is recovered,(2)
One of the enhancement layers is dropped (regardless which one). In this case the receiver only looses 1/4th of the information as a description will be fully received together with the base layer of the other one,(3)
Both enhancement layers are lost. Now we have only half of the information available corresponding to the base layers of both descriptions,(4)
One description is completely lost as well as the enhancement layer of the other. Still something can be displayed to the user although corresponding to only one of the original image pixels.In the postprocessing part, the original sequence is obtained by merging the descriptions. In case of lost description or discarded enhancement layers, the missing pixels are reconstructed by interpolation from the received ones.Two different schemes are applied to group the subsequences obtained after the polyphase spatial subsampling. In the first one, calledby rows, we group the subsequences in which the pixels form even or odd rows of the original sequence. In the other one, called quincunx, we group the subsequence so that the pixels form a quincunx lattice of the original sequence.In other words, referring to Figures1 and 2, if we number the four subsequences as in the raster scan from the top left corner, in the by rows scheme, we form the first description with subsequences one and two, and the other one with subsequences three and four. Instead, in the quincunx scheme, we group the subsequences one and three to form the first description, and the subsequences two and four for the other one.Figure 1
Subsampling patterns and descriptions composition for the case of by rows sampling.Figure 2
Subsampling patterns and descriptions composition for the case of quincunx sampling.Figure 3
ILPS-MDSC with the interlayer prediction highlighted.In case of lost information (either a whole description or the subframe corresponding to an enhancement layer), we use two different interpolation methods according to the different transmission scheme applied. In case we receive only oneby rows description; then we recover the missing information taking the mean of the two nearest pixels. Otherwise, if we receive only one quincunx description, we recover the missing information simply taking the mean of the four nearest pixels.Given this basic description of the algorithm, there are two different way to apply it to 3D video sequences. The first scheme, that takes into account theSimulcast stereoscopic coding, consists in coding independently the two different views (both Left/Right or Color/Depth), by applying the interlayer prediction algorithm to two subsequences of the same view, similar to what was done for the 2D sequences in previous works [27]. We call this method Interlayer Prediction Structure (ILPS). In the second one, we try to create a Compatible stereoscopic coding, by subsampling the views in four subsequences, as done in PSS, and using the interlayer prediction to predict all the subsequences of one view (resp., right or depth), from the same subsequence of the other view (left or color). We call this scheme 3D-ILPS.3D-ILPS is somehow similar to what is done in [24] where the authors mix a spatially scaled copy of one view with the full version of the other to form a description. By doing this, the authors do not introduce scalability in the strict sense in each description but exploit prediction to remove redundancy between the two views in each description. The redundancy introduced by this algorithm is then driven by the subsampling factor and the QP parameter applied to the predicted sequence.The two proposed algorithms differ significantly and their characteristics can be exploited in different networking environments. In ILPS, each description carries a subsampled version of one of the two views, either left-right or color-depth, in a way that introduces a SNR scalability. In this method, the redundancy introduced is driven only by the header needed to correctly transmit all the descriptions. For those characteristics, we can say that the ILPS method can be very useful in case of transmission over unreliable channels in which all the receivers can decode a three-dimensional sequence, but have heterogeneous devices that require some sort of scalability. In the 3D-ILPS algorithm, instead, we propose a slightly different way to form the description, while keeping the same subsampling method as ILPS. By forming the description with, respectively, a subsampled version of the left/color and right/depth sequence, we introduce a new dimensional scalability. With this algorithm, it is possible to easily extract a 2D view from the stereoscopic sequence by discarding the enhancement layer. Considering this, we can apply the 3D-ILPS algorithm to network in which coexist users that can decode and view the 3D-videos and user that can only view monoscopic sequences.


## 6. Results

The software used in our experiments is H.264/SVC rel. 8.1, but the algorithm can be easily extended to virtually every version of the coder. Results are reported using the YUV 4 : 2 : 0 sequencesBreakdance and Ballet (100 frames each), in order to determine the performance of the method under several different conditions. All sequences are at CIF resolution, 30 fps, single reference frame, GOP size 8. An 1 frame is only inserted at the beginning, prediction is performed at 1/4 pixel accuracy over 16×16, 16×8, 8×16, 8x8 blocks with SAD metric. Finally, CABAC is applied. Both sequences are natively at a resolution of 1024 × 768 and have been converted to CIF format by means of a non-normative downsampling, described in JVT-R006.The results are shown over a rate span from 100 kbit/s to 1900 kbit/s in steps of 200 kbit/s, with or without random losses, to evaluate the pure performances of the coder with respect to other coding methods. In particular we plot the quality-rate curves for the color and left views, and we show some tables of the performances of the depth view, from a rate span of 100 kbit/s to 900 kbit/s, since after that rate the differences of PSNR are very minimal. Regarding the right view, no results are reported, since it can be easily extended from the ones showed for the left view.Comparisons are mainly carried out using peak signal-to-noise ratio (PSNR) evaluation. Although it is known that it is unable to capture some 3D specific artifacts, PSNR is anyway widely used in literature to asses the quality of a 3D sequence from the quality of its components [25, 28, 29] and it has been shown that, though far from being perfect, it shows a good relationship with visual evaluation [30]. We also present some limited subjective quality measurement with the aid of the Mean Opinion Score (MOS), by playing the two rendered views (for the left and right eye) independently to the viewers.In order to evaluate the robustness of the proposed algorithm with respect to the simple PSS-MD algorithm and a Single Description Coding (SDC), we have considered a random packet losses of about 10% of the overall transmitted packet. In case we receive only one description, we considered a packet loss of 5%, since in this cases we lost about the 55% of the information. In order to compare the performance of the single description coding with the case when only one description is received, we have simulated in such sequences a packet loss of about 50%, equal to the loss of information obtained when only one description is received.A set of simulations has also been run considering a multiview video coder (MVC), specifically the H.264/MVC video coder version 5.0, where we predict the right sequence from the left one. Unfortunately, this kind of coder does not support efficiently packet losses, so it was not possible to evaluate the performances of this algorithm in an error prone environment.One final notation remark is that in all the tables, FD means that both base layer and enhancement layer are received for the specific description, BL refers to the case when only the base layer is received, and SVC and MVC are used to indicate single view and multiview video coding, respectively.


### 6.1. Algorithm Performance

We first present results for the cases when a subsequence is either completely received or it is completely lost. In case of loss of a subsequence, in order for the matching description to be decodable, we assume it corresponds to the subsequence used as the enhancement layer of the scalable description. Figures4 and 5 show the performance when only one subsequence, corresponding to the base layer of one description, is received. As expected, all the proposed algorithms achieve the same performances since it is not possible, in this situation, to get benefits from our algorithms. In Figures 6 and 7 we consider the case when two subsequences, corresponding to the two base layers, are received. In this case, the performances of the quincunx and the rows schemes are very dependent from the specific sequence, so that it is not possible to select the best overall scheme. Instead, we can see that the ILPS algorithm seems to give better performances than the 3D-ILPS only in the rows scheme. Figures 8 and 9 show the performances when three subsequences are received. In these cases, all the considered algorithms seem to give similar performances, with only the 3D-ILPS algorithm that gives slightly worse performances. Finally, Figures 10 and 11 show the performances when all the subsequences are received. It is easy to see that, for the Breakdance sequence, the performances of the proposed method are comparable with the SDC and MDC, while, for the Ballet sequence, they are slightly worse.Performance of color view, one subsequence received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, one subsequence received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, two subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, two subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, three subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, three subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, all subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, four subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Regarding the depth view, Tables1 and 3 report the PSNR value for the proposed algorithm, without packet losses. It is easy to see that the proposed algorithm gives better results than the PSS that and are not so far from the SDC. It is worth noting that all simulations are run with the coder generating the same total amount of bits for all the techniques. This means that the the MDC algorithms suffer from the fact that some redundancy is intrinsically introduced for two main reasons. First of all, since no prediction is performed across the descriptions, some correlation is anyway present and this reduces coding efficiency. Second, for each description to be independently (de)coded, we need headers to be duplicated. As a consequence, in the simulation conditions proposed, SDC will always perform better than MDC when all the information is received. The fact that ILPS and 3D-ILPS provide improvements with respect to PSS can be seen as a better coding efficiency.Table 1
Performance of depth view, Ballet, without packet loss.
One subsequence receivedTwo subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10039,4633,2233,2233,5039,4634,2835,7737,1730044,5834,4734,4734,4544,5836,4938,8839,5750047,1934,7434,7434,7347,1937,0239,8540,3270048,9534,8634,8634,8548,9537,2840,3240,6790050,3834,9234,9234,9250,3837,4140,6140,89Three subsequence receivedFour subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10039,4635,1635,5835,8139,4635,7836,6136,7030044,5838,7538,9638,8544,5841,5542,1541,8650047,1939,8139,9539,8747,1944,2044,8444,4870048,9540,3740,4740,3748,9546,1546,8246,3190050,3840,6940,7740,7050,3847,6948,3547,90


### 6.2. Performance with Random Losses

We now consider the case when random losses are superimposed to the previous cases. Random packet losses are generated as outcomes of a uniform distribution with loss probabilityP=10%. More detailed loss mechanisms should be considered in specific environments also taking into account the application scenario (real time versus streaming) and specific error control/retransmission strategies at medium access control layer. Furthermore, no specific error concealment strategies have been implemented so that it can be reasonably assumed that more realistic loss distributions would affect all different proposed methods in similar ways. Random losses on the contrary are less aggressive with single description streams.Several simulations have been run for each of the possible cases using frame replacement as only error concealment technique. Despite of this, in some cases the decoder could not proceed: the reported results are given averaging over 10 different complete realizations. As expected, to obtain this number, SDC usually required a number of runs between two and three times larger than that of the MDC algorithms. This ratio may also be seen as a robustness gain provided by the path diversity approach. Note that no bandwidth constraints were given so that packet losses were only due to the random process.Again, results are presented for increasing number of subsequences received and for color and left coding. Figures12 and 13 show the performance when only one subsequence is received, with random packet losses. In this case, the 3D-ILPS algorithm seems to give the better robustness to the packet losses. In Figures 14 and 15 it is possible to see the performance when two subsequences are received with random packet losses. As said before, the performances of the quincunx and the rows schemes are very dependent from the specific sequence, but we can easily view that the 3D-ILPS scheme again gives the best robustness to packet losses. Figures 16 and 17 show the performances when three subsequences are received. In these cases, all the considered algorithms seems to give similar performances, with only the 3D-ILPS algorithm that gives slightly lesser performances. Figures 18 and 19(b) sequences are received. In these cases, we can note a similar performance as the previous cases. Considering the depth view, Tables 2 and 4 report the robustness of the algorithms to a random packet loss of about 10%. These results indicate that both algorithms perform better than the PSS and the SDC coding. In particular, the 3D-ILPS algorithm seems to give the best performances among the considered schemes.Table 2
Performance of depth view, Ballet, 10% packet loss.
One subsequence receivedTwo subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10034,6432,6232,3833,2434,6433,4834,9036,5030036,9733,9233,7633,9236,9735,5937,5438,4150039,1334,3033,9934,1139,1335,9037,9339,0270039,5334,1934,3634,4339,5336,2238,5239,6790040,7534,2134,1834,5440,7536,0938,8539,55Three subsequence receivedFour subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10034,6437,0734,4235,4037,6934,0735,4935,8930036,9735,6537,1838,1440,6137,6239,3641,2250039,1338,1638,2939,2443,7838,4242,5442,2470039,5338,8839,1439,1844,7038,5243,8344,6390040,7538,8438,9639,6444,3939,1545,1846,14Table 3
Performance of depth view, Breakdance, without packet loss.
One subsequence receivedTwo subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10038,5833,4133,4133,6638,5833,7236,2438,2930044,4135,0035,0034,9944,4135,5240,1942,2850047,2635,4035,4035,4047,2636,0341,6843,9770049,2035,5635,5635,5549,2036,2642,4644,9490050,7035,6335,6335,6350,7036,3642,9145,51Three subsequence receivedFour subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10038,5835,9236,4436,4238,5835,8636,6536,4230044,4140,7341,1741,5844,4141,2642,0641,5850047,2642,8843,2644,3547,2644,1544,9844,3570049,2044,1944,4846,4049,2046,2647,0546,4090050,7045,0145,2547,9750,7047,8548,6647,97Table 4
Performance of depth view, Breakdance, 10% packet loss.
One subsequence receivedTwo subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10030,9233,0132,9633,2636,8633,2135,4537,19030032,9334,4034,1834,5240,7635,0338,4640,4550033,3434,6334,6334,5643,7135,2139,9141,8270035,0934,5834,7934,7544,6335,3641,1942,4390034,4234,7234,9034,9645,7435,7340,9342,77Three subsequence receivedFour subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10034,2535,1735,3435,8036,8634,8935,0235,5830037,7838,8439,3639,7940,7639,1439,6140,1750039,3241,8440,9241,6143,7140,8041,4742,3870039,2841,6841,8843,0244,6342,5743,6843,4390040,6343,4943,6143,3745,7442,3345,9645,73Performance of color view, one subsequence received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, one subsequence received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, two subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, two subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, three subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, three subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, all subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, four subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)These results confirm the superior performances of the ILPS algorithm with respect to PSS, both in terms of coding efficiency and error robustness. This is not surprise since the 3D coding depicted scenario is an extension of the 2D coding scheme evaluated in the previous work [27].The new algorithm proposed, the 3D-ILPS, further improves the performance of the ILPS scheme since it has been specifically studied for the 3D environment. Predicting the depth view from the same color view with the aid of the DIBR algorithm, this new algorithm has a better coding efficiency. Furthermore it also exhibits a strong robustness to transmission errors, since we can obtain four independent descriptions from the original sequence that can be sent over different channels or with different error protection schemes.


### 6.3. Subjective Tests

The “objective” results provided by PSNR are complemented by a set of subjective results. We first report, in Figure20, images from the Breakdance sequence coded at an overall rate of 900 Kbit/sec for the proposed methods. It is supposed that no losses have occurred and it can be seen that the quality of all the algorithms cannot be discriminated (and this is true also at regular size). Figure 21 reports, on the contrary, the same cases when only the base layer of the two descriptions is received.Figure 20
Image from Breakdance sequence. Left to right: color view, depth map, right view, left view.  to bottom: SVC, PSS, ILPS, 3D-ILPS. All information received.Figure 21
Image from Breakdance sequence. Left to right: color view, depth map, right view, left view. Top to bottom: SVC, PSS, ILPS, 3D-ILPS. All information received.Visual experiments have been repeated to obtain subjective measures based on the mean opinion score (MOS) that can be very useful in order to produce some sort of metric for the Quality of Experience (QoE) [31]. Although the MOS evaluation could not be performed over a large number of viewers, we have been able to select a relatively small number of people, from our and neighboring laboratories, divided in two groups of about 10 persons each: with and without experience in video coding. We report only the results for the Color view, as the results for the other views are very similar to the ones reported. Results are in Tables 5 and 6. It is possible to see that the proposed method seems to achieve the same or even slightly better performances than PSS-MD, and at least the same performance than the SDC and MVC, in particular with packet losses. It is important to highlight that the 3D-ILPS method seems to give the best overall subjective quality among the proposed methods.Table 5
Mean opinion Score without packet loss, Breakdance/Ballet, color view.
One description receivedPSS-MD rowsPSS-MD quinc.ILPS rowsILPS quinc.3D-ILPSViewer A3/3.53.5/33.5/44/3.54/4.5Viewer B3.5/33.5/3.54/4.53.5/34.5/4.5Two descriptions receivedSDCMVCPSS-MDILPS rowsILPS quinc.3D-ILPSViewer A4.5/55/54/4.54.5/54.5/55/5Viewer B5/55/54.5/4.54.5/54/4.55/5Table 6
Mean Opinion Score with 10% packet loss, Breakdance/Ballet, color view.
One description receivedPSS-MD rowsPSS-MD quinc.ILPS rowsILPS quinc.3D-ILPSViewer A2.5/22/23/2.52.5/23.5/3.5Viewer B3/2.52/2.52.5/33/3.53/4Two descriptions receivedSDCPSS-MDILPS rowsILPS quinc.3D-ILPSViewer A4/3.53/3.54/3.53.5/44/4.5Viewer B3.5/43.5/3.53.5/3.53.5/3.54.5/5


## 6.1. Algorithm Performance

We first present results for the cases when a subsequence is either completely received or it is completely lost. In case of loss of a subsequence, in order for the matching description to be decodable, we assume it corresponds to the subsequence used as the enhancement layer of the scalable description. Figures4 and 5 show the performance when only one subsequence, corresponding to the base layer of one description, is received. As expected, all the proposed algorithms achieve the same performances since it is not possible, in this situation, to get benefits from our algorithms. In Figures 6 and 7 we consider the case when two subsequences, corresponding to the two base layers, are received. In this case, the performances of the quincunx and the rows schemes are very dependent from the specific sequence, so that it is not possible to select the best overall scheme. Instead, we can see that the ILPS algorithm seems to give better performances than the 3D-ILPS only in the rows scheme. Figures 8 and 9 show the performances when three subsequences are received. In these cases, all the considered algorithms seem to give similar performances, with only the 3D-ILPS algorithm that gives slightly worse performances. Finally, Figures 10 and 11 show the performances when all the subsequences are received. It is easy to see that, for the Breakdance sequence, the performances of the proposed method are comparable with the SDC and MDC, while, for the Ballet sequence, they are slightly worse.Performance of color view, one subsequence received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, one subsequence received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, two subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, two subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, three subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, three subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, all subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, four subsequences received. (a) Breakdance. (b) Ballet.
(a)(b)Regarding the depth view, Tables1 and 3 report the PSNR value for the proposed algorithm, without packet losses. It is easy to see that the proposed algorithm gives better results than the PSS that and are not so far from the SDC. It is worth noting that all simulations are run with the coder generating the same total amount of bits for all the techniques. This means that the the MDC algorithms suffer from the fact that some redundancy is intrinsically introduced for two main reasons. First of all, since no prediction is performed across the descriptions, some correlation is anyway present and this reduces coding efficiency. Second, for each description to be independently (de)coded, we need headers to be duplicated. As a consequence, in the simulation conditions proposed, SDC will always perform better than MDC when all the information is received. The fact that ILPS and 3D-ILPS provide improvements with respect to PSS can be seen as a better coding efficiency.Table 1
Performance of depth view, Ballet, without packet loss.
One subsequence receivedTwo subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10039,4633,2233,2233,5039,4634,2835,7737,1730044,5834,4734,4734,4544,5836,4938,8839,5750047,1934,7434,7434,7347,1937,0239,8540,3270048,9534,8634,8634,8548,9537,2840,3240,6790050,3834,9234,9234,9250,3837,4140,6140,89Three subsequence receivedFour subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10039,4635,1635,5835,8139,4635,7836,6136,7030044,5838,7538,9638,8544,5841,5542,1541,8650047,1939,8139,9539,8747,1944,2044,8444,4870048,9540,3740,4740,3748,9546,1546,8246,3190050,3840,6940,7740,7050,3847,6948,3547,90


## 6.2. Performance with Random Losses

We now consider the case when random losses are superimposed to the previous cases. Random packet losses are generated as outcomes of a uniform distribution with loss probabilityP=10%. More detailed loss mechanisms should be considered in specific environments also taking into account the application scenario (real time versus streaming) and specific error control/retransmission strategies at medium access control layer. Furthermore, no specific error concealment strategies have been implemented so that it can be reasonably assumed that more realistic loss distributions would affect all different proposed methods in similar ways. Random losses on the contrary are less aggressive with single description streams.Several simulations have been run for each of the possible cases using frame replacement as only error concealment technique. Despite of this, in some cases the decoder could not proceed: the reported results are given averaging over 10 different complete realizations. As expected, to obtain this number, SDC usually required a number of runs between two and three times larger than that of the MDC algorithms. This ratio may also be seen as a robustness gain provided by the path diversity approach. Note that no bandwidth constraints were given so that packet losses were only due to the random process.Again, results are presented for increasing number of subsequences received and for color and left coding. Figures12 and 13 show the performance when only one subsequence is received, with random packet losses. In this case, the 3D-ILPS algorithm seems to give the better robustness to the packet losses. In Figures 14 and 15 it is possible to see the performance when two subsequences are received with random packet losses. As said before, the performances of the quincunx and the rows schemes are very dependent from the specific sequence, but we can easily view that the 3D-ILPS scheme again gives the best robustness to packet losses. Figures 16 and 17 show the performances when three subsequences are received. In these cases, all the considered algorithms seems to give similar performances, with only the 3D-ILPS algorithm that gives slightly lesser performances. Figures 18 and 19(b) sequences are received. In these cases, we can note a similar performance as the previous cases. Considering the depth view, Tables 2 and 4 report the robustness of the algorithms to a random packet loss of about 10%. These results indicate that both algorithms perform better than the PSS and the SDC coding. In particular, the 3D-ILPS algorithm seems to give the best performances among the considered schemes.Table 2
Performance of depth view, Ballet, 10% packet loss.
One subsequence receivedTwo subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10034,6432,6232,3833,2434,6433,4834,9036,5030036,9733,9233,7633,9236,9735,5937,5438,4150039,1334,3033,9934,1139,1335,9037,9339,0270039,5334,1934,3634,4339,5336,2238,5239,6790040,7534,2134,1834,5440,7536,0938,8539,55Three subsequence receivedFour subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10034,6437,0734,4235,4037,6934,0735,4935,8930036,9735,6537,1838,1440,6137,6239,3641,2250039,1338,1638,2939,2443,7838,4242,5442,2470039,5338,8839,1439,1844,7038,5243,8344,6390040,7538,8438,9639,6444,3939,1545,1846,14Table 3
Performance of depth view, Breakdance, without packet loss.
One subsequence receivedTwo subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10038,5833,4133,4133,6638,5833,7236,2438,2930044,4135,0035,0034,9944,4135,5240,1942,2850047,2635,4035,4035,4047,2636,0341,6843,9770049,2035,5635,5635,5549,2036,2642,4644,9490050,7035,6335,6335,6350,7036,3642,9145,51Three subsequence receivedFour subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10038,5835,9236,4436,4238,5835,8636,6536,4230044,4140,7341,1741,5844,4141,2642,0641,5850047,2642,8843,2644,3547,2644,1544,9844,3570049,2044,1944,4846,4049,2046,2647,0546,4090050,7045,0145,2547,9750,7047,8548,6647,97Table 4
Performance of depth view, Breakdance, 10% packet loss.
One subsequence receivedTwo subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10030,9233,0132,9633,2636,8633,2135,4537,19030032,9334,4034,1834,5240,7635,0338,4640,4550033,3434,6334,6334,5643,7135,2139,9141,8270035,0934,5834,7934,7544,6335,3641,1942,4390034,4234,7234,9034,9645,7435,7340,9342,77Three subsequence receivedFour subsequence receivedRateSDCPSSILPS3D-ILPSSDCPSSILPS3D-ILPS10034,2535,1735,3435,8036,8634,8935,0235,5830037,7838,8439,3639,7940,7639,1439,6140,1750039,3241,8440,9241,6143,7140,8041,4742,3870039,2841,6841,8843,0244,6342,5743,6843,4390040,6343,4943,6143,3745,7442,3345,9645,73Performance of color view, one subsequence received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, one subsequence received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, two subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, two subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, three subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, three subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of color view, all subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)Performance of left view, four subsequences received, 10% packet loss. (a) Breakdance. (b) Ballet.
(a)(b)These results confirm the superior performances of the ILPS algorithm with respect to PSS, both in terms of coding efficiency and error robustness. This is not surprise since the 3D coding depicted scenario is an extension of the 2D coding scheme evaluated in the previous work [27].The new algorithm proposed, the 3D-ILPS, further improves the performance of the ILPS scheme since it has been specifically studied for the 3D environment. Predicting the depth view from the same color view with the aid of the DIBR algorithm, this new algorithm has a better coding efficiency. Furthermore it also exhibits a strong robustness to transmission errors, since we can obtain four independent descriptions from the original sequence that can be sent over different channels or with different error protection schemes.


## 6.3. Subjective Tests

The “objective” results provided by PSNR are complemented by a set of subjective results. We first report, in Figure20, images from the Breakdance sequence coded at an overall rate of 900 Kbit/sec for the proposed methods. It is supposed that no losses have occurred and it can be seen that the quality of all the algorithms cannot be discriminated (and this is true also at regular size). Figure 21 reports, on the contrary, the same cases when only the base layer of the two descriptions is received.Figure 20
Image from Breakdance sequence. Left to right: color view, depth map, right view, left view.  to bottom: SVC, PSS, ILPS, 3D-ILPS. All information received.Figure 21
Image from Breakdance sequence. Left to right: color view, depth map, right view, left view. Top to bottom: SVC, PSS, ILPS, 3D-ILPS. All information received.Visual experiments have been repeated to obtain subjective measures based on the mean opinion score (MOS) that can be very useful in order to produce some sort of metric for the Quality of Experience (QoE) [31]. Although the MOS evaluation could not be performed over a large number of viewers, we have been able to select a relatively small number of people, from our and neighboring laboratories, divided in two groups of about 10 persons each: with and without experience in video coding. We report only the results for the Color view, as the results for the other views are very similar to the ones reported. Results are in Tables 5 and 6. It is possible to see that the proposed method seems to achieve the same or even slightly better performances than PSS-MD, and at least the same performance than the SDC and MVC, in particular with packet losses. It is important to highlight that the 3D-ILPS method seems to give the best overall subjective quality among the proposed methods.Table 5
Mean opinion Score without packet loss, Breakdance/Ballet, color view.
One description receivedPSS-MD rowsPSS-MD quinc.ILPS rowsILPS quinc.3D-ILPSViewer A3/3.53.5/33.5/44/3.54/4.5Viewer B3.5/33.5/3.54/4.53.5/34.5/4.5Two descriptions receivedSDCMVCPSS-MDILPS rowsILPS quinc.3D-ILPSViewer A4.5/55/54/4.54.5/54.5/55/5Viewer B5/55/54.5/4.54.5/54/4.55/5Table 6
Mean Opinion Score with 10% packet loss, Breakdance/Ballet, color view.
One description receivedPSS-MD rowsPSS-MD quinc.ILPS rowsILPS quinc.3D-ILPSViewer A2.5/22/23/2.52.5/23.5/3.5Viewer B3/2.52/2.52.5/33/3.53/4Two descriptions receivedSDCPSS-MDILPS rowsILPS quinc.3D-ILPSViewer A4/3.53/3.54/3.53.5/44/4.5Viewer B3.5/43.5/3.53.5/3.53.5/3.54.5/5


## 7. Conclusions

In this paper we have introduced an novel algorithm to generate 3D multiple descriptions in a H.264/SVC coder, with the use ofdepth and color views, as well left and right views, and we have shown its performance. Provided results show its effectiveness in terms of both coding efficiency, robustness, and flexibility. Work is in progress to improve these algorithms and to introduce them in more realistic network scenarios. In addition, future works will be related to introduce Medium Grain Scalability in each layer in order to be more flexible in transmission environments with varying effective bandwidth. Work is also planned to study more specific quality measures and models to determine rate distortion functions suitable to further adapt the proposed schemes and to be used in a more extensive QoE framework.



---

*Source: 425641-2010-03-30.xml*