Premium
How Not to Be Seen — Object Removal from Videos of Crowded Scenes
Author(s) -
Granados M.,
Tompkin J.,
Kim K.,
Grau O.,
Kautz J.,
Theobalt C.
Publication year - 2012
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2012.03000.x
Subject(s) - computer science , computer vision , artificial intelligence , object (grammar) , frame (networking) , cut , process (computing) , computation , graph , pixel , convergence (economics) , optimization problem , frame rate , video tracking , computer graphics (images) , image (mathematics) , theoretical computer science , algorithm , image segmentation , telecommunications , economics , economic growth , operating system
Removing dynamic objects from videos is an extremely challenging problem that even visual effects professionals often solve with time‐consuming manual frame‐by‐frame editing. We propose a new approach to video completion that can deal with complex scenes containing dynamic background and non‐periodical moving objects. We build upon the idea that the spatio‐temporal hole left by a removed object can be filled with data available on other regions of the video where the occluded objects were visible. Video completion is performed by solving a large combinatorial problem that searches for an optimal pattern of pixel offsets from occluded to unoccluded regions. Our contribution includes an energy functional that generalizes well over different scenes with stable parameters, and that has the desirable convergence properties for a graph‐cut‐based optimization. We provide an interface to guide the completion process that both reduces computation time and allows for efficient correction of small errors in the result. We demonstrate that our approach can effectively complete complex, high‐resolution occlusions that are greater in difficulty than what existing methods have shown.