Iterative regularized error concealment algorithm

Min-Cheol Hong; Aggelos K. Katsaggelos

doi:10.1117/12.251262

16 September 1996 Iterative regularized error concealment algorithm

Proceedings Volume 2952, Digital Compression Technologies and Systems for Video Communications; (1996) https://doi.org/10.1117/12.251262
Event: Advanced Imaging and Network Technologies, 1996, Berlin, Germany

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.

Citation Download Citation

Min-Cheol Hong and Aggelos K. Katsaggelos "Iterative regularized error concealment algorithm", Proc. SPIE 2952, Digital Compression Technologies and Systems for Video Communications, (16 September 1996); https://doi.org/10.1117/12.251262

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available