Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  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

Dateien

einblenden: Dateien
ausblenden: Dateien
:
MPI-I-2011-4-001.pdf (beliebiger Volltext), 14MB
Name:
MPI-I-2011-4-001.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Granados, Miguel1, Autor           
Tompkin, James2, Autor           
Kim, Kwang1, Autor           
Grau, O.2, Autor
Kautz, Jan2, Autor           
Theobalt, Christian1, Autor                 
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2External Organizations, ou_persistent22              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2012-03-072011
 Publikationsstatus: Online veröffentlicht
 Seiten: 35 p.
 Ort, Verlag, Ausgabe: Saarbrücken : MPI für Informatik
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 618872
BibTex Citekey: Granados2011TR
Reportnr.: MPI-I-2011-4-001
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Research Report
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: - Identifikator: -