NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Spatial Interpolation Algorithm for Error Concealment
Published
Author(s)
Hamid Gharavi, Shaoshuai Gao
Abstract
In this paper, we propose a new spatial interpolation algorithm for Intra-Frame error concealment. The method aims at interpolating areas in the image, which have been affected by packet loss. We have proposed an edge detection technique to aid the bilinear interpolation. The edge-detection scheme is based on designing a robust Hough transform-based technique that is capable of systematically connecting edges irrespective of the number of edge points surrounding missing areas. The connected edges are used to divide the missing areas into different regions for interpolation along the directions of each detected line. Simulation results demonstrate that the proposed algorithm can recover the missing areas with a greater accuracy, when compared with the bilinear interpolation technique.
Conference Dates
March 31-April 4, 2008
Conference Location
Las Vegas, NV
Conference Title
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2008)
Gharavi, H.
and Gao, S.
(2008),
Spatial Interpolation Algorithm for Error Concealment, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2008), Las Vegas, NV, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=152087
(Accessed October 10, 2025)