Optimal channel rate allocation for multimedia communication over fading wireless channels
WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
Interleaved turbo codes protection for progressive image transmission with efficient rate allocation
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
A linear encoding approach to index assignment in lossy source-channel coding
IEEE Transactions on Information Theory
A framework for error protection of region of interest coded images and videos
Image Communication
Scalable and channel-adaptive unequal error protection of images with LDPC codes
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Hi-index | 0.07 |
We consider a joint source-channel coding system that protects an embedded bitstream using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly decoded source bits. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only on a rate-based optimal solution. Then, we propose a local search (LS) algorithm that starts from a rate-based optimal solution and converges in linear time to a local minimum of the expected distortion. Experimental results for a binary symmetric channel show that our LS algorithm is near optimal, whereas its complexity is much lower than that of the previous best solution.