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.

Real time delivery of video over best-effort networks requires compression systems that dynamically adapt the rate to the available channel capacity and exhibit robustness to data loss as retransmission is often impractical. Error-resilience, however, significantly lowers the coding performance when rigid design is performed based on a worst-case scenario. This paper presents an original scalable video coding scheme that couples the compression efficiency of the open-loop architecture with the robustness of multiple description source coding. The use of embedded multiple description quantization and a novel channel-aware rate-allocation allow for shaping on-the-fly the output bit-rate and the degree of resilience. As a result, robustness to data losses is traded for better visual quality when transmission occurs over reliable channels, while error-resilience is introduced when noisy links are involved. The advantage of our proposal is demonstrated in the context of packet-lossy networks.

A new family of embedded multiple description scalar quantizers (EMDSQ) that support the progressive transmission of images over variable-bandwidth error-prone channels is proposed in this paper. A control mechanism that allows for tuning the redundancy between the two descriptions for each quantization level is also designed. The employed mechanism enables control of the tradeoff between the coding efficiency and error-resilience, and provides an increased robustness by improving the error resilience in the most important layers of the embedded bit-streams. Instantiations of the proposed family are incorporated in a wavelet-based embedded coding system, and the redundancy-control mechanism is practically demonstrated. Experimental results show that the proposed EMDSQ outperform the state-of-the-art multiple description uniform scalar quantizers (MDUSQ) previously proposed in the literature for error-resilient progressive image transmission.

MESHGRID is a novel, compact, multiscalable and animation-friendly surface representation method, which has been introduced in MPEG-4 . The MESHGRID representation attaches a description of the "global connectivity" between the vertices on the object's surface (i.e., the 3-D connectivity wireframe) to a regular 3-D grid of points (i.e., the reference grid). MESHGRID efficiently encodes the 3-D connectivity wireframe by using a new type of 3-D extension of Freeman chain-code. MESHGRID does not explicitly store the polygons of the surface, since the 3-D connectivity wireframe has particular connectivity properties allowing for the unambiguous derivation of the triangulation. The reference grid is a smooth vector field defined on a regular discrete 3-D space. This grid is efficiently compressed by using an embedded 3-D wavelet-based multiresolution intra-band coding algorithm. MESHGRID can be efficiently exploited for QoS since it allows for three types of scalability in both view-dependent and view-independent scenarios, including: 1) resolution scalability, i.e., the adaptation of the number of transmitted vertices; 2) shape precision, i.e., the adaptive reconstruction of the reference grid positions; and 3) vertex position scalability, i.e., the change of the precision of known vertex positions with respect to the reference grid. Furthermore, in addition to the classical vertex-based animation, MESHGRID also supports specific animation capabilities, such as: 1) rippling effects by changing the position of the vertices relative to corresponding reference grid points and 2) reshaping on a hierarchical basis of the regular reference grid and its attached vertices.

Robust progressive image transmission over unreliable channels with variable bandwidth requires multiple description coding (MDC) systems that produce highly error-resilient embedded bitstreams. The proposed embedded multiple description scalar quantizers (EMDSQ) meet the desired features consisting of a high redundancy level, fine grain rate adaptation and progressive transmission of each description. Experimental results show that EMDSQ yield better rate-distortion performance in comparison to the multiple description uniform scalar quantizers; (MDUSQ) previously proposed in the literature. Moreover, the generalized form of EMDSQ targeting an arbitrary number of channels is proposed, which offers the possibility of designing realistic coders for practical multi-channel communication systems.

Robust progressive image transmission over unreliable channels with variable bandwidth requires multiple description coding (MDC) systems that produce highly error-resilient embedded bit-streams. The proposed embedded multiple description scalar quantizers (EMDSQ) meet the desired features consisting of a high redundancy level, fine grain rate adaptation and progressive transmission of each description. Experimental results show that EMDSQ yield better rate-distortion performance in comparison to the multiple description uniform scalar quantizers (MDUSQ) previously proposed in the literature. Moreover, the generalized form of EMDSQ targeting an arbitrary number of channels is proposed, which offers the possibility of designing realistic coders for practical multi-channel communication systems.

MESHGRID is a novel, compact, multi-scalable and animation-friendly surface representation method, which has been introduced in MPEG-4. The MESHGRID representation attaches a description of the "global connectivity" between the vertices on the object's surface (i.e. the 3D connectivity wireframe) to a regular 3D grid of points (i.e. the reference-grid). The 3D connectivity wireframe is efficiently encoded by using a new type of 3D extension of Freeman chain-code. MESHGRID does not explicitly store the polygons of the surface, since the 3D connectivity wireframe has particular connectivity properties allowing for the unambiguous derivation of the triangulation. The reference-grid is a smooth vector field defined on a regular discrete 3D space. This grid is efficiently compressed by using an embedded 3D wavelet-based multi-resolution intra-band coding algorithm. MESHGRID allows for three types of scalability in both view-dependent and view-independent scenarios: resolution scalability, shape precision, and vertex position scalability. Furthermore, in addition to the classical vertex-based animation, MESHGRID supports specific animation capabilities, such as rippling effects and reshaping on a hierarchical basis of the regular reference-grid and its attached vertices.