Efficient Articulated Trajectory Reconstruction Using Dynamic Programming and Filters

October 2012

Efficient Articulated Trajectory Reconstruction Using Dynamic Programming and Filters

Authors:

Jack L. Valmadre, Yingying Zhu, Sridha Sridharan, and Simon Lucey
Conference Paper
Proceedings of (ECCV) European Conference on Computer Vision

Abstract:

This paper considers the problem of reconstructing the mo- tion of a 3D articulated tree from 2D point correspondences subject to some temporal prior. Hitherto, smooth motion has been encouraged using a trajectory basis, yielding a hard combinatorial problem with time complexity growing exponentially in the number of frames. Branch and bound strategies have previously attempted to curb this complexity whilst maintaining global optimality. However, they provide no guaran- tee of being more efficient than exhaustive search. Inspired by recent work which reconstructs general trajectories using compact high-pass filters, we develop a dynamic programming approach which scales lin- early in the number of frames, leveraging the intrinsically local nature of filter interactions. Extension to affine projection enables reconstruction without estimating cameras.
@conference{Valmadre-2012-17100,
author = {Jack L. Valmadre And Yingying Zhu And Sridha Sridharan And Simon Lucey},
title = {Efficient Articulated Trajectory Reconstruction Using Dynamic Programming and Filters},
booktitle = {Proceedings of (ECCV) European Conference on Computer Vision},
year = {2012},
month = {October},
pages = {72 - 85},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.