Packet loss protection of embedded data with fast local search

V. Stankovic, R. Hamzaoui, Z.X. Xiong

Research output: Contribution to conferencePaper

46 Citations (Scopus)

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 languageEnglish
Pages22-25
Number of pages4
DOIs
Publication statusPublished - Sep 2002
Event IEEE International Conference on Image Processing - Rochester, United States
Duration: 22 Sep 200225 Sep 2002

Conference

Conference IEEE International Conference on Image Processing
CountryUnited States
CityRochester
Period22/09/0225/09/02

Keywords

  • image transmission
  • channels
  • packet loss protection
  • embedded data
  • fast local search

Fingerprint Dive into the research topics of 'Packet loss protection of embedded data with fast local search'. Together they form a unique fingerprint.

  • Cite this

    Stankovic, V., Hamzaoui, R., & Xiong, Z. X. (2002). Packet loss protection of embedded data with fast local search. 22-25. Paper presented at IEEE International Conference on Image Processing , Rochester, United States. https://doi.org/10.1109/ICIP.2002.1039913