English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  How Not to Be Seen -- Inpainting Dynamic Objects in Crowded Scenes

Granados, M., Tompkin, J., Kim, K., Grau, O., Kautz, J., & Theobalt, C.(2011). How Not to Be Seen -- Inpainting Dynamic Objects in Crowded Scenes (MPI-I-2011-4-001). Saarbrücken: MPI für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-13C5-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0029-C38D-3
Genre: Report

Files

show Files
hide Files
:
MPI-I-2011-4-001.pdf (Any fulltext), 14MB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0015-7E07-6
Name:
MPI-I-2011-4-001.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Granados, Miguel1, Author           
Tompkin, James2, Author           
Kim, Kwang1, Author           
Grau, O.2, Author
Kautz, Jan2, Author           
Theobalt, Christian1, Author           
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 Abstract: 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.

Details

show
hide
Language(s): eng - English
 Dates: 2012-03-072011
 Publication Status: Published online
 Pages: 35 p.
 Publishing info: Saarbrücken : MPI für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 618872
BibTex Citekey: Granados2011TR
Report Nr.: MPI-I-2011-4-001
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -