We propose a new maximum a posteriori (MAP) detector, without the need for explicit channel coding, to lessen the impact of communication channel errors on compressed image sources. The MAP detector exploits the spatial correlation in the compressed bitstream as well as the temporal memory in the channel to correct channel errors. We first present a technique for computing the residual redundancy inherent in a compressed grayscale image (compressed using VQ). The performance of the proposed MAP detector is compared to that of a memoryless MAP detector. We also investigate the dependence of the performance on memory characteristics of the Gilbert-Elliott channel as well as average channel error rate. Finally, we study the robustness of the proposed MAP detector's performance to estimation errors.

We study image transmission on a lossy packet network in which the loss mechanism is modeled as buffer overflows. A simple error concealment strategy involving table lookups and a buffer allocation scheme with an optimally chosen virtual boundary for a 2 priority class system are described. Significant improvements are achieved by combining these two strategies.