This paper is concerned with the efficient transmission of scal-able compressed images with complex dependency structures over lossy communication channels. Our recent work proposed a strategy for allocating source elements into clusters of packets and finding their optimal code-rates. However, the previous work assumes that source elements form a simple chain of dependencies. The present paper proposes a modification to the earlier strategy to exploit the properties of scalable sources which have tree-structured dependency. 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, the proposed strategy assigns optimal code-rates to the source elements, subject to a constraint on transmission length. Our experimental results suggest that the proposed strategy can outperform the earlier strategy by exploiting the dependency structure.
|Title of host publication||IEEE International Conference on Image Processing|
|Number of pages||4|
|Publication status||Published - 2003|
|Event||Proceedings: 2003 International Conference on Image Processing, ICIP-2003 - Barcelona, Spain|
Duration: 14 Sep 2003 → 17 Sep 2003
|Other||Proceedings: 2003 International Conference on Image Processing, ICIP-2003|
|Period||14/09/03 → 17/09/03|