Graph-based deinterlacing - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Graph-based deinterlacing

Résumé

This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fails to reconstruct edges that are diagonal or close to horizontal, leading to highly visible artifacts. Our solution aims at preserving the linear structure continuity. It connects pieces of horizontal edges coming from neighboring lines to build graphs which are then simplified in branches that represent the linear structure of the scene. These branches give the exact direction in which the interpolation has to be done. For the rest of the image, a traditional directional spatial interpolation gives satisfactory results already. Although the number of pixels interpolated with this method is relatively small, the overall image quality is subjectively well improved.
Fichier principal
Vignette du fichier
roussel_icip_2008.pdf (2.33 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00279961 , version 1 (15-05-2008)

Identifiants

  • HAL Id : hal-00279961 , version 1

Citer

Jérôme Roussel, Pascal Bertolino. Graph-based deinterlacing. ICIP 2008 - 15th IEEE International Conference on Image Processing, Oct 2008, San Diego, Californie, United States. pp.CD. ⟨hal-00279961⟩
144 Consultations
197 Téléchargements

Partager

Gmail Facebook X LinkedIn More