Fast computation of seamless video loops
Author(s) -
Jing Liao,
Mark Finch,
Hugues Hoppe
Publication year - 2015
Publication title -
acm transactions on graphics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.153
H-Index - 218
eISSN - 1557-7368
pISSN - 0730-0301
DOI - 10.1145/2816795.2818061
Subject(s) - computer science , computation , masking (illustration) , consistency (knowledge bases) , pruning , grid , metric (unit) , graph , key (lock) , computer vision , artificial intelligence , algorithm , theoretical computer science , art , operations management , geometry , mathematics , computer security , agronomy , economics , visual arts , biology
Short looping videos concisely capture the dynamism of natural scenes. Creating seamless loops usually involves maximizing spatiotemporal consistency and applying Poisson blending. We take an end-to-end view of the problem and present new techniques that jointly improve loop quality while also significantly reducing processing time. A key idea is to relax the consistency constraints to anticipate the subsequent blending, thereby enabling looping of low-frequency content like moving clouds and changing illumination. We also analyze the input video to remove an undesired bias toward short loops. The quality gains are demonstrated visually and confirmed quantitatively using a new gradient-domain consistency metric. We improve system performance by classifying potentially loopable pixels, masking the 2D graph cut, pruning graph-cut labels based on dominant periods, and optimizing on a coarse grid while retaining finer detail. Together these techniques reduce computation times from tens of minutes to nearly real-time.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom