Opportunistic decoding of unequal erasure protected partially-decodable scalable source
Authors: 
Jie Xu, Guofang Tu, Yuming JiangAuthors Info & Claims
Pages 61 - 69
Abstract
To provide unequal erasure protection to scalable codes, a general framework has been proposed in [1] and it has become the foundation of following research in this literature. In this paper, we make opportunistic utilization of received packets under the same framework. Specifically, we extract those non-decodable original symbols in received packets by taking advantage of the joint coding structure. By regulating the scalable codes to partially-decodable scalable codes, these original symbols can be used to improve the quality of reconstructed source. Further more, we formulate the opportunistic unequal erasure protection and analyze the relationship between optimal unequal erasure protection (OP) and opportunistic optimal unequal erasure protection (OOP). Based on the analysis result, a simple algorithm is proposed to find the optimal protection which maximizes the expected quality of reconstructed source. Finally, experiment results are presented which verify the improvement of opportunistic utilization over traditional unequal erasure protection.
References
[1]
Alexander E. Mohr, Eve A. Riskin, and Richard E. Ladner. Unequal Loss Protection: Graceful Degradation over Packet Erasure Channels through Forward Error Correction. IEEE Journal on Selected Areas in Communication, vol. 18, no. 7, pages 819--828, June 2000.
[2]
D. Taubman, High performance scalable image compression with EBCOT, IEEE Trans. Image Process., vol. 9, no. 7, pp. 1158--1170, Jul. 2000.
[3]
J. M. Shapiro, Embedded image coding using zerotrees of wavelet coefficients, IEEE Trans. Signal Processing, Vol. 41, pp. 3445--3462, Dec. 1993
[4]
A. Said and W. A. Pearlman, "A new fast and efficient image codec based on set partitioning in hierarchical trees," IEEE Trans. Circuits and Systems for Video Technology, vol. 6, pp. 243--250, June 1996.
[5]
Information Technology - JPEG 2000 Image Coding System: Core Coding System. International Standard, ISO/IEC 15444--1:2004. 2nd ed. Geneva: ISO, 2004.
[6]
B.-J. Kim, Z. Xiong, and W. A. Pearlman, Low bit-rate scalable video coding with 3D set partitioning in herarchical trees (3D SPIHT), IEEE Trans. Circuits and Systems for Video Technology, vol. 10, pp 1365--1374, Dec. 2000.
[7]
Image Data Compression. Informational Report, CCSDS 120.1-G-1. Green Book, June 2007.
[8]
M. Yajnik, S. B. Moon, J. Kurose, D. Towsley, Measurement and modeling of the temporal dependence in packet loss, IEEE Infocom'99, New York, NY, March 1999.
[9]
A. E. Mohr, R. E. Ladner, and E. A. Riskin, Approximately optimal assignment for unequal loss protection, in Proc. ICIP 2000 Int. Conf. Image Processing, Sep. 2000, vol. 1, pp. 367--370.
[10]
Andres Albanese, Johannes Blagomer, Jeff Edmonds, Michael Luby, and Madhu Sudan, Priority encoding transmission, IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737--1744, Nov. 1996.
[11]
R. Puri and K. Ramchandran, Multiple description source coding through forward error correction codes, in Proc. 33rd Asilomar Conf. Signals, Systems, and Computers, Oct. 1999, vol. 1, pp. 342--346.
[12]
T. Stockhammer and C. Buchner, Progressive texture video streaming for lossy packet networks, in Proc. 11th Int. Packet Video Workshop, Kyongju, Korea, May 2001.
[13]
V. Stankovic, R. Hamzaoui, and Z. Xiong, Real-time error protection of embedded codes for packet erasure and fading channels, IEEE Transactions on Circuits and Systems for Video Technology, vol. 14, pp. 1064--1072, Aug. 2004
[14]
S. Dumitrescu, X. Wu, and Z. Wang, Globally optimal uneven errorprotected packetization of scalable code streams, IEEE Trans. Multimedia, vol. 6, no. 2, pp. 230--239, Apr. 2004.
[15]
V. Stankovic, R. Hamzaoui, and Z. Xiong, Efficient channel code rate selection algorithms for forward error correction of packetized multimedia bitstreams in varying channels, IEEE Trans. Multimedia, vol. 6, no. 2, pp. 240--248, Apr. 2004.
[16]
Sorina Dumitrescu, Xiaolin Wu, Zhe Wang, Efficient algorithms for optimal uneven protection of single and multiple scalable code streams against packet erasures, IEEE Transactions on multimedia, vol. 9, no. 7, Nov. 2007
[17]
T. Gan and K.-K. Ma, Weighted unequal error protection for transmitting scalable object-oriented images over packet-erasure networks, IEEE Trans. Image Process., vol. 14, no. 2, pp. 189--199, Feb. 2005.
[18]
Thie. J, Taubman. D, Optimal erasure protection strategy for scalably compressed data with tree-structured dependencies, IEEE Transactions on Image Processing. Vol. 14, no. 12, pp. 2002--2011. Dec. 2005.
[19]
W Li, Overview of fine granularity scalability in MPEG-4 video standard, IEEE Transactions on Circuits and Systems for Video Technology. Vol. 11, no. 3, pp. 301--317. Mar. 2001.
[20]
M. Hasegawa, S. Kato, and Y. Yamada, A partially decodable code for scalable compression of super high definition images, in ICASSP '99: IEEE International Conference on Acoustics, Speech, and Signal Processing, Proceedings Vols I--Vi, 1999, pp. 3149--3152.
[21]
E. Salemi, C. Desset, J. Cornelis, and P. Schelkens, Additive Distortion Modeling for Unequal Error Protection of Scalable Multimedia Content, in ICASSP'05: IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.
Index Terms
- Opportunistic decoding of unequal erasure protected partially-decodable scalable source
Recommendations
Unequal erasure protection technique for scalable multistreams
This paper presents a novel unequal erasure protection (UEP) strategy for the transmission of scalable data, formed by interleaving independently decodable and scalable streams, over packet erasure networks. The technique, termed multistream UEP (M-UEP),...
Source-optimized irregular repeat accumulate codes with inherent unequal error protection capabilities and their application to scalable image transmission
The common practice for achieving unequal error protection (UEP) in scalable multimedia communication systems is to design rate-compatible punctured channel codes before computing the UEP rate assignments. This paper proposes a new approach to designing ...
Design of Finite-Length Precoded EWF Codes for Scalable Video Streaming
Expanding window fountain (EWF) codes, which can provide unequal erasure protection property, are used as an efficient application-layer forward error correction solution for scalable multimedia data transmission over packet networks. Similar to Raptor ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 2009
232 pages
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 October 2009
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
MSWiM '09
Sponsor:
MSWiM '09: The 12th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems
October 26, 2009
Tenerife, Canary Islands, Spain
Acceptance Rates
PM2HW2N '09 Paper Acceptance Rate 15 of 41 submissions, 37%;
Overall Acceptance Rate 74 of 226 submissions, 33%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 55Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in