Optimal protection assignment for scalable compressed images

Johnson Thie*, David Taubman

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

    12 Citations (Scopus)

    Abstract

    This paper is concerned with the efficient transmission of scalable compressed images over lossy communication channels. Recent works have proposed several strategies for assigning optimal code-rates to elements in a scalable data stream, under the assumption that all elements are encoded onto a common group of network packets. When the size of the data to be encoded becomes large in comparison with the size of the network packets, such schemes require very long channel codes with high computational complexity. In networks with high loss, small packets are generally more desirable than long packets. This paper proposes a strategy for assigning optimal code-rates to elements of the scalable compressed data source, subject to constraints on the packet size, transmission length and code complexity. Our experimental results suggest that the proposed scheme can outperform previously proposed code-rate assignment policies, subject to the above-mentioned constraints, particularly with high loss.

    Original languageEnglish
    Title of host publicationIEEE International Conference on Image Processing
    Volume3
    Publication statusPublished - 2002
    EventInternational Conference on Image Processing (ICIP'02) - Rochester, NY, United States
    Duration: 22 Sep 200225 Sep 2002

    Other

    OtherInternational Conference on Image Processing (ICIP'02)
    CountryUnited States
    CityRochester, NY
    Period22/09/0225/09/02

    Fingerprint Dive into the research topics of 'Optimal protection assignment for scalable compressed images'. Together they form a unique fingerprint.

    Cite this