Translator Disclaimer
Paper
27 February 1996 Deinterlacing algorithm based on sparse wide-vector correlations
Author Affiliations +
Proceedings Volume 2727, Visual Communications and Image Processing '96; (1996) https://doi.org/10.1117/12.233311
Event: Visual Communications and Image Processing '96, 1996, Orlando, FL, United States
Abstract
In this paper, we propose a new deinterlacing algorithm based on sparse wide vector correlations, which is an extension of the deinterlacing algorithm previously proposed by the author, aimed to reduce the H/W complexity in applications. The proposed algorithm is developed mainly for the format conversion problem encountered in current HDTV systems, but can also be applicable to the double rate conversion problem in the NTSC system. By exploiting the edge oriented spatial interpolation based on the wide vector correlations, visually annoying artifacts caused by interlacing such as a serrate line, line crawling, a line flicker, and a large area flicker can be remarkably reduced since the use of the wide vector correlation increases the range of the orientations that can be detected, and by introducing sparse vectors the H/W complexity for realizing the algorithm in applications can be significantly reduced. Simulations are also provided indicating that the proposed algorithm results in a high performance comparable to the performance of the deinterlacing algorithm based on wide vector correlations.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yeong-Taeg Kim "Deinterlacing algorithm based on sparse wide-vector correlations", Proc. SPIE 2727, Visual Communications and Image Processing '96, (27 February 1996); https://doi.org/10.1117/12.233311
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
Back to Top