loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 IEEE International Conference on Multimedia and Expo
Efficient Algorithm for Globally Optimal Uneven Erasure-Protected Packetization of Scalable Code Streams
Toronto, ON, Canada
July 09-July 12
ISBN: 1-4244-0366-7
Sorina Dumitrescu, Dept. of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada L8S 4K1. sorina@mail.ece.mcmaster.ca
Xiaolin Wu, Dept. of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada L8S 4K1. xwu@mail.ece.mcmaster.ca
Zhe Wang, Dept. of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada L8S 4K1. zwang@mail.ece.mcmaster.ca
A new algorithm is presented for rate-fidelity optimal packetization of scalable source bit streams with uneven erasure protection. It provides the globally optimal solution for input sources of convex rate-fidelity function and for a wide class of erasure channels, including channels for which the probability of losing n packets is monotonically decreasing in n, and independent erasure channels with packet erasure rate smaller than 0.5. The time and space complexities of the new algorithm are both O(NL), where N is the number of packets and L is the packet payload size, comparing to the O(NL2) time and space complexities of the existing globally optimal solution. When applied to SPIHT compressed images, the results of the proposed algorithm are virtually the same as the globally optima.
Citation:
Sorina Dumitrescu, Xiaolin Wu, Zhe Wang, "Efficient Algorithm for Globally Optimal Uneven Erasure-Protected Packetization of Scalable Code Streams," icme, pp.605-608, 2006 IEEE International Conference on Multimedia and Expo, 2006
Usage of this product signifies your acceptance of the Terms of Use.