Optimal erasure protection strategy for scalably compressed data with tree-structured dependencies

Authors:
J. Thie;D. Taubman
Affiliations:
Sch. of Electr. Eng. & Telecommun., Univ. of New South Wales, Sydney, NSW, Australia;-
Venue:
IEEE Transactions on Image Processing
Year:
2005

Citing 0
Cited 4

Joint source-channel coding for wavelet-based scalable video transmission using an adaptive turbo code

Journal on Image and Video Processing
An efficient optimisation scheme for scalable surveillance centric video communications

Image Communication
Opportunistic decoding of unequal erasure protected partially-decodable scalable source

Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Unequal erasure protection technique for scalable multistreams

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper is concerned with the transmission of scalably compressed data sources over lossy channels. Specifically, this paper is concerned with packet networks or, more generally, erasure channels. Previous work has generally assumed that the source elements form linear dependencies. The contribution of this paper is an unequal erasure protection algorithm which is able to take advantage of scalable data with more general dependency structures. In particular, the proposed scheme is adapted to data with tree-structured dependencies. The source elements are allocated to clusters of packets according to their dependency structure, subject to constraints on packet size and channel codeword length. Given a packet cluster arrangement, source elements are assigned optimal channel codes subject to a constraint on the total transmission length. Experimental results confirm the benefit associated with exploiting the actual dependency structure of the data.