Embedded multiple-description coding of video

Fabio Verdicchio, Adrian Munteanu, Augustin Gavrilescu, Jan Cornelis, Peter Schelkens

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)3114-3130
JournalIEEE Transactions on Image Processing
Volume15
Issue number10
DOIs
Publication statusPublished - Oct 2006

Fingerprint

Channel coding
Packet networks
Channel capacity
Image coding
Redundancy
Scalability

Keywords

  • multiple description coding
  • packet erasure resilience
  • scalable video coding
  • description scalar quantizers
  • bit allocation
  • motion
  • efficient design

Cite this

Verdicchio, F., Munteanu, A., Gavrilescu, A., Cornelis, J., & Schelkens, P. (2006). Embedded multiple-description coding of video. IEEE Transactions on Image Processing, 15(10), 3114-3130. https://doi.org/10.1109/TIP.2006.877495

Embedded multiple-description coding of video. / Verdicchio, Fabio; Munteanu, Adrian; Gavrilescu, Augustin; Cornelis, Jan; Schelkens, Peter.

In: IEEE Transactions on Image Processing, Vol. 15, No. 10, 10.2006, p. 3114-3130.

Research output: Contribution to journalArticle

Verdicchio, F, Munteanu, A, Gavrilescu, A, Cornelis, J & Schelkens, P 2006, 'Embedded multiple-description coding of video', IEEE Transactions on Image Processing, vol. 15, no. 10, pp. 3114-3130. https://doi.org/10.1109/TIP.2006.877495
Verdicchio, Fabio ; Munteanu, Adrian ; Gavrilescu, Augustin ; Cornelis, Jan ; Schelkens, Peter. / Embedded multiple-description coding of video. In: IEEE Transactions on Image Processing. 2006 ; Vol. 15, No. 10. pp. 3114-3130.
@article{292a0e7a65cf46aa9f901beb9018987d,
title = "Embedded multiple-description coding of video",
abstract = "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.",
keywords = "multiple description coding, packet erasure resilience, scalable video coding , description scalar quantizers, bit allocation, motion, efficient design",
author = "Fabio Verdicchio and Adrian Munteanu and Augustin Gavrilescu and Jan Cornelis and Peter Schelkens",
year = "2006",
month = "10",
doi = "10.1109/TIP.2006.877495",
language = "English",
volume = "15",
pages = "3114--3130",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

TY - JOUR

T1 - Embedded multiple-description coding of video

AU - Verdicchio, Fabio

AU - Munteanu, Adrian

AU - Gavrilescu, Augustin

AU - Cornelis, Jan

AU - Schelkens, Peter

PY - 2006/10

Y1 - 2006/10

N2 - 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.

AB - 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.

KW - multiple description coding

KW - packet erasure resilience

KW - scalable video coding

KW - description scalar quantizers

KW - bit allocation

KW - motion

KW - efficient design

U2 - 10.1109/TIP.2006.877495

DO - 10.1109/TIP.2006.877495

M3 - Article

VL - 15

SP - 3114

EP - 3130

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 10

ER -