Abstract
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1]. It first finds the optimal assignment under convex hull and fractional bit allocation assumptions. It then relaxes those constraints to find an assignment that approximates the global optimum. The algorithm has a running time of O(hNlogN) where h is the number of points on the convex hull of the source's utility-cost curve and N is the number of packets transmitted.
Original language | English |
---|---|
Pages | 367-370 |
Number of pages | 4 |
State | Published - 2000 |
Event | International Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada Duration: 10 Sep 2000 → 13 Sep 2000 |
Conference
Conference | International Conference on Image Processing (ICIP 2000) |
---|---|
Country/Territory | Canada |
City | Vancouver, BC |
Period | 10/09/00 → 13/09/00 |