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

R. Hamzaoui, Vladimir M. Stankovic, Z. Xiong

Research output: Contribution to journalArticle

39 Citations (Scopus)

Abstract

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.
LanguageEnglish
Pages1417-1421
Number of pages4
JournalIEEE Transactions on Image Processing
Volume14
Issue number10
DOIs
Publication statusPublished - Oct 2005

Fingerprint

Channel coding
Error detection
Error correction

Keywords

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

Cite this

@article{2e6ab966adda43f18f15cc50eccab127,
title = "Fast algorithm for distortion-based error protection of embedded image codes",
abstract = "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.",
keywords = "joint source-channel coding, image transmission, local search, unequal error protection",
author = "R. Hamzaoui and Stankovic, {Vladimir M.} and Z. Xiong",
year = "2005",
month = "10",
doi = "10.1109/TIP.2005.854497",
language = "English",
volume = "14",
pages = "1417--1421",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
number = "10",

}

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

In: IEEE Transactions on Image Processing, Vol. 14, No. 10, 10.2005, p. 1417-1421.

Research output: Contribution to journalArticle

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 -