Cinematic-L1 Video Stabilization with a Log-Homography Model

11/16/2020
by   Arwen Bradley, et al.
0

We present a method for stabilizing handheld video that simulates the camera motions cinematographers achieve with equipment like tripods, dollies, and Steadicams. We formulate a constrained convex optimization problem minimizing the ℓ_1-norm of the first three derivatives of the stabilized motion. Our approach extends the work of Grundmann et al. [9] by solving with full homographies (rather than affinities) in order to correct perspective, preserving linearity by working in log-homography space. We also construct crop constraints that preserve field-of-view; model the problem as a quadratic (rather than linear) program to allow for an ℓ_2 term encouraging fidelity to the original trajectory; and add constraints and objectives to reduce distortion. Furthermore, we propose new methods for handling salient objects via both inclusion constraints and centering objectives. Finally, we describe a windowing strategy to approximate the solution in linear time and bounded memory. Our method is computationally efficient, running at 300fps on an iPhone XS, and yields high-quality results, as we demonstrate with a collection of stabilized videos, quantitative and qualitative comparisons to [9] and other methods, and an ablation study.

READ FULL TEXT
research
02/13/2021

Almost-linear-time Weighted ℓ_p-norm Solvers in Slightly Dense Graphs via Sparsification

We give almost-linear-time algorithms for constructing sparsifiers with ...
research
07/21/2023

An Efficient Interior-Point Method for Online Convex Optimization

A new algorithm for regret minimization in online convex optimization is...
research
10/17/2019

Solving Linear Programs with Sqrt(rank) Linear System Solves

We present an algorithm that given a linear program with n variables, m ...
research
10/04/2018

Seamless Parametrization with Arbitrarily Prescribed Cones

Seamless global parametrization of surfaces is a key operation in geomet...
research
07/13/2020

Conformal mapping in linear time

Given any ϵ >0 and any planar region Ω bounded by a simple n-gon P we co...
research
09/18/2023

Generalizing Trajectory Retiming to Quadratic Objective Functions

Trajectory retiming is the task of computing a feasible time parameteriz...

Please sign up or login with your details

Forgot password? Click here to reset