A Fast Algorithm for Occlusion Detection and Removal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2018 IEEE International Conference on Image Processing, ICIP 2018 - Proceedings
PublisherIEEE Computer Society
Pages2905-2909
Number of pages5
ISBN (Electronic)9781479970612
DOIs
Publication statusPublished - 29 Aug 2018
Externally publishedYes
Event25th IEEE International Conference on Image Processing, ICIP 2018 - Athens, Greece
Duration: 7 Oct 201810 Oct 2018

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference25th IEEE International Conference on Image Processing, ICIP 2018
Country/TerritoryGreece
CityAthens
Period7/10/1810/10/18

Keywords

  • Background estimation
  • Image reconstruction
  • Mask removal
  • Multi-image processing
  • Non-linear filtering
  • Occlusion detection

Fingerprint

Dive into the research topics of 'A Fast Algorithm for Occlusion Detection and Removal'. Together they form a unique fingerprint.

Cite this