Abstract

This paper considers the problem of reconstructing the mo- tion of a 3D articulated tree from 2D point correspondences sub ject to some temporal prior. Hitherto, smooth motion has been encouraged using a tra jectory 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 tra jectories 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 pro jection enables reconstruction without estimating cameras.