Low-complexity unbalanced multiple description coding based on balanced clusters for adaptive peer-to-peer video streaming

被引:4
作者
Ardestani, Majid R. [1 ]
Shirazi, Ali Asghar Beheshti [1 ]
Hashemi, Mahmoud Reza [2 ]
机构
[1] Iran Univ Sci & Technol, Image Proc Lab, Sch Elect Engn, Tehran, Iran
[2] Univ Tehran, Multimedia Proc Lab, Sch Elect & Comp Engn, Tehran, Iran
关键词
Scalable video coding; Multiple description coding; Motion compensated temporal filtering; Channel-aware redundancy-rate allocation; Clustering; COMPRESSION;
D O I
10.1016/j.image.2011.01.003
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multiple description scalable coding based on T+2D wavelet decomposition structure is highly flexible for peer-to-peer (P2P) video streaming. Finding the optimal truncation point of each wavelet-decomposed code block (CB) within each description is an NP-hard problem (Akyol et al., 2007 [1]). For P2P video streaming, it is necessary to implement an efficient multiple description encoder with three attributes: "adaptive" (due to the time-varying capacity of the P2P network links and nodes), "low-complexity" (because of the low processing power of the receiving peer) with arbitrarily "unbalanced descriptions" (because of the unequal capacities of the different sending peers). To design a multiple description encoder with the above mentioned features, we propose a simple clustering algorithm for partitioning the CBs into a limited number of clusters. This simple and efficient clustering algorithm significantly reduces the size of redundancy-rate assignment matrix, such that one can find the optimal channel-aware cluster-level redundancy-rate assignment matrix using a low-complexity full search approach. This approach improves the decoding quality compared to the co-echelon adaptive frameworks (Akyol et al., 2007 [1]; Tillo et al.. 2007 [8]) in which a non-optimal heuristic rate assignment pattern is used. Especially for the unbalanced P2P scenario (which is the usual case), the performance gain of the proposed approach over the one presented in Tillo et al. (2007) 181 (generating only balanced descriptions) is significant (0.95-3.0 dB). In addition, the proposed clustering approach may be analytically represented by closed-form relations for low-complexity computation of the optimal encoding parameters. Our complexity analysis shows that the proposed approach requires 52-96% less computations compared to the framework in Akyol et al. (2007) [1]. Therefore, an efficient real-time post-encoding adaptation mechanism may be realized. The simulation results demonstrate that the adaptive proposed framework outperforms the approach presented in Akyol et al. (2007) [1] by (0.26-0.95 dB) and the non-adaptive multiple description coding by (1.1-2.3 dB). (C) 2011 Elsevier B.V. All rights reserved,
引用
收藏
页码:143 / 161
页数:19
相关论文
共 24 条
  • [1] ABANOZ TB, 2009, SIGNAL PROCESS IMAGE
  • [2] State-of-the-art and trends in scalable video compression with wavelet-based approaches
    Adami, Nicola
    Signoroni, Alberto
    Leonardi, Riccardo
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2007, 17 (09) : 1238 - 1255
  • [3] AKYOL E, 2006, P IEEE INT C IM PROC
  • [4] A Flexible Multiple Description Coding Framework for Adaptive Peer-to-Peer Video Streaming
    Akyol, Emrah
    Tekalp, A. Murat
    Civanlar, M. Reha
    [J]. IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2007, 1 (02) : 231 - 245
  • [5] [Anonymous], 2007, JVTX202 ISOIEC MPEG
  • [6] [Anonymous], 2006, JVTS202 ISOIEC MPEG
  • [7] Distortion Estimators for Bitplane Image Coding
    Auli-Llinas, Francesc
    Marcellin, Michael W.
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2009, 18 (08) : 1772 - 1781
  • [8] A flexible R-D-based multiple description scheme for JPEG 2000
    Baccaglini, Enrico
    Tillo, Tammam
    Olmo, Gabriella
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2007, 14 (03) : 197 - 200
  • [9] Boyd S., 2004, Vandenberghe, Convex Optimization
  • [10] CAGNAZZO M, 2007, IEEE T CIRCUITS SYST, V17