TY - JOUR
T1 - Optimal erasure protection strategy for scalably compressed data with tree-structured dependencies
AU - Thie, Johnson
AU - Taubman, David
N1 - Copyright 2005 IEEE. Reprinted from IEEE transactions on image processing, Volume 14, Issue 12, 2002-2011. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
PY - 2005/12
Y1 - 2005/12
N2 - 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 code-word 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.
AB - 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 code-word 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.
UR - http://www.scopus.com/inward/record.url?scp=28844454270&partnerID=8YFLogxK
U2 - 10.1109/TIP.2005.859368
DO - 10.1109/TIP.2005.859368
M3 - Article
C2 - 16370454
AN - SCOPUS:28844454270
SN - 1057-7149
VL - 14
SP - 2002
EP - 2011
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 12
ER -