Share Email Print
cover

Proceedings Paper

Iterative regularized error concealment algorithm
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we propose an iterative regularized error concealment algorithm. The coded image can be degraded due to channel errors, network congestion, and switching system problems. We may have therefore seriously degraded images due to information loss. When the structure of the image and video codec is hierarchical, the degradation may be worse because of the inter-dependence of the coded information. In order to solve the error concealment problem of compressed images, we use an iterative regularized algorithm. We analyze the necessity of an oriented high pass operator we introduce and the requirement of changing the initial condition when all the quantized DCT coefficients in a block are lost. Several experimental results are presented.

Paper Details

Date Published: 16 September 1996
PDF: 10 pages
Proc. SPIE 2952, Digital Compression Technologies and Systems for Video Communications, (16 September 1996); doi: 10.1117/12.251262
Show Author Affiliations
Min-Cheol Hong, Northwestern Univ. (United States)
Aggelos K. Katsaggelos, Northwestern Univ. (United States)


Published in SPIE Proceedings Vol. 2952:
Digital Compression Technologies and Systems for Video Communications
Naohisa Ohta, Editor(s)

© SPIE. Terms of Use
Back to Top