Abstract
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with low memory requirements for the computation of an unequal loss protection solution is essential in real-time systems. Because the determination of an optimal solution is time-consuming, fast suboptimal solutions have been used. In this paper, we present a fast iterative improvement algorithm with negligible memory requirements. Experimental results for the JPEG2000, 2D, and 3D set partitioning in hierarchical trees (SPIHT) coders showed that our algorithm provided close to optimal peak signal-to-noise ratio (PSNR) performance, while its time complexity was significantly lower than that of all previously proposed algorithms.
| Original language | English |
|---|---|
| Pages | 22-25 |
| Number of pages | 4 |
| DOIs | |
| Publication status | Published - Sept 2002 |
| Event | IEEE International Conference on Image Processing - Rochester, United States Duration: 22 Sept 2002 → 25 Sept 2002 |
Conference
| Conference | IEEE International Conference on Image Processing |
|---|---|
| Country/Territory | United States |
| City | Rochester |
| Period | 22/09/02 → 25/09/02 |
Keywords
- image transmission
- channels
- packet loss protection
- embedded data
- fast local search