DocumentCode
795022
Title
A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels
Author
Pan, Xiang ; Banihashemi, Amir H. ; Cuhadar, Aysegul
Author_Institution
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
Volume
54
Issue
1
fYear
2006
Firstpage
1
Lastpage
6
Abstract
We propose a fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels. The algorithm, which is an improved version of a similar algorithm by Banister et al., is based on the application of the Viterbi algorithm to a search trellis. This trellis is a substantially trimmed version of the one used by Banister et al.. The proposed algorithm is applied to images encoded by the set partitioning in hierarchical trees and the Joint Photographers Expert Group 2000 for transmission over binary symmetric channels. For different total bit budgets and channel parameters, speed-up factors of up to about three orders of magnitude are achieved.
Keywords
image coding; telecommunication channels; trellis codes; visual communication; Joint Photographers Expert Group 2000; Viterbi algorithm; binary symmetric channels; noisy channels; progressively coded images; set partitioning in hierarchical trees; speed-up factors; total bit budgets; trellis-based rate-allocation algorithm; Channel coding; Cost function; Dynamic programming; Error correction codes; Image coding; PSNR; Partitioning algorithms; Performance loss; Robustness; Viterbi algorithm; Combined source/channel coding; Joint Photographers Expert Group (JPEG) 2000; Viterbi algorithm (VA); joint source/channel coding; progressive image coding; rate-allocation algorithm; set partitioning in hierarchical trees (SPIHT); trellis; unequal error protection (UEP);
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2005.861683
Filename
1576939
Link To Document