A fast algorithm for occlusion detection and removal - Télécom Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

A fast algorithm for occlusion detection and removal

Résumé

This paper describes a simple and fast algorithm for removing occlusions that may occur in multiple views of a scene. In contrast to many methods of the literature, no assumption is made on occlusion shapes, colors or motions. Instead, this new method assumes that the background can be re-warped using an homography and that the reflectivity is quasi-Lambertian. After geometric and photometric alignments, three methods are evaluated. A median based method, a novel algorithm based on maximal clique detection and a robust PCA method are compared on real and simulated image sequences. This comparison shows that the new clique-based method provides the best performance in terms of quality and reliability.
Fichier non déposé

Dates et versions

hal-02287984 , version 1 (13-09-2019)

Identifiants

  • HAL Id : hal-02287984 , version 1

Citer

Xiaoyi Yang, Yann Gousseau, Henri Maître, Yohann Tendero. A fast algorithm for occlusion detection and removal. IEEE 25th Int. Conf on Image Processing, ICIP 2018, Oct 2018, Athens, Greece. pp.2505-2509. ⟨hal-02287984⟩
55 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More