### Abstract

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.

Language | English |
---|---|

Pages | 1417-1421 |

Number of pages | 4 |

Journal | IEEE Transactions on Image Processing |

Volume | 14 |

Issue number | 10 |

DOIs | |

Publication status | Published - Oct 2005 |

### Fingerprint

### Keywords

- joint source-channel coding
- image transmission
- local search
- unequal error protection

### Cite this

*IEEE Transactions on Image Processing*,

*14*(10), 1417-1421. https://doi.org/10.1109/TIP.2005.854497

}

*IEEE Transactions on Image Processing*, vol. 14, no. 10, pp. 1417-1421. https://doi.org/10.1109/TIP.2005.854497

**Fast algorithm for distortion-based error protection of embedded image codes.** / Hamzaoui, R.; Stankovic, Vladimir M.; Xiong, Z.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Fast algorithm for distortion-based error protection of embedded image codes

AU - Hamzaoui, R.

AU - Stankovic, Vladimir M.

AU - Xiong, Z.

PY - 2005/10

Y1 - 2005/10

N2 - 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 theexpected 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.

AB - 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 theexpected 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.

KW - joint source-channel coding

KW - image transmission

KW - local search

KW - unequal error protection

U2 - 10.1109/TIP.2005.854497

DO - 10.1109/TIP.2005.854497

M3 - Article

VL - 14

SP - 1417

EP - 1421

JO - IEEE Transactions on Image Processing

T2 - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 10

ER -