File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

김광인

Kim, Kwang In
Machine Learning and Vision Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.endPage 228 -
dc.citation.number 2 -
dc.citation.startPage 219 -
dc.citation.title COMPUTER GRAPHICS FORUM -
dc.citation.volume 31 -
dc.contributor.author Granados, M. -
dc.contributor.author Tompkin, J. -
dc.contributor.author Kim, Kwang In -
dc.contributor.author Grau, O. -
dc.contributor.author Kautz, J. -
dc.contributor.author Theobalt, C. -
dc.date.accessioned 2023-12-22T05:09:06Z -
dc.date.available 2023-12-22T05:09:06Z -
dc.date.created 2019-02-25 -
dc.date.issued 2012-05 -
dc.description.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. -
dc.identifier.bibliographicCitation COMPUTER GRAPHICS FORUM, v.31, no.2, pp.219 - 228 -
dc.identifier.doi 10.1111/j.1467-8659.2012.03000.x -
dc.identifier.issn 0167-7055 -
dc.identifier.scopusid 2-s2.0-84867892769 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/26257 -
dc.identifier.url https://onlinelibrary.wiley.com/doi/full/10.1111/j.1467-8659.2012.03000.x -
dc.identifier.wosid 000304901400001 -
dc.language 영어 -
dc.publisher WILEY-BLACKWELL -
dc.title How Not to Be Seen - Object Removal from Videos of Crowded Scenes -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Computer Science, Software Engineering -
dc.relation.journalResearchArea Computer Science -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor video restoration -
dc.subject.keywordAuthor video completion -
dc.subject.keywordAuthor video inpainting -
dc.subject.keywordPlus GRAPH CUTS -
dc.subject.keywordPlus ENERGY MINIMIZATION -
dc.subject.keywordPlus IMAGE -
dc.subject.keywordPlus COMPLETION -
dc.subject.keywordPlus MOTION -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.