Creating and chaining camera moves for quadrotor videography

K Xie, H Yang, S Huang, D Lischinski… - ACM Transactions on …, 2018 - dl.acm.org
ACM Transactions on Graphics (TOG), 2018dl.acm.org
Capturing aerial videos with a quadrotor-mounted camera is a challenging creative task, as
it requires the simultaneous control of the quadrotor's motion and the mounted camera's
orientation. Letting the drone follow a pre-planned trajectory is a much more appealing
option, and recent research has proposed a number of tools designed to automate the
generation of feasible camera motion plans; however, these tools typically require the user
to specify and edit the camera path, for example by providing a complete and ordered …
Capturing aerial videos with a quadrotor-mounted camera is a challenging creative task, as it requires the simultaneous control of the quadrotor's motion and the mounted camera's orientation. Letting the drone follow a pre-planned trajectory is a much more appealing option, and recent research has proposed a number of tools designed to automate the generation of feasible camera motion plans; however, these tools typically require the user to specify and edit the camera path, for example by providing a complete and ordered sequence of key viewpoints.
In this paper, we propose a higher level tool designed to enable even novice users to easily capture compelling aerial videos of large-scale outdoor scenes. Using a coarse 2.5D model of a scene, the user is only expected to specify starting and ending viewpoints and designate a set of landmarks, with or without a particular order. Our system automatically generates a diverse set of candidate local camera moves for observing each landmark, which are collision-free, smooth, and adapted to the shape of the landmark. These moves are guided by a landmark-centric view quality field, which combines visual interest and frame composition. An optimal global camera trajectory is then constructed that chains together a sequence of local camera moves, by choosing one move for each landmark and connecting them with suitable transition trajectories. This task is formulated and solved as an instance of the Set Traveling Salesman Problem.
ACM Digital Library