Efficient Articulated Trajectory Reconstruction Using Dynamic Programming and Filters

  • Jack Valmadre
  • Yingying Zhu
  • Sridha Sridharan
  • Simon Lucey
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7572)

Abstract

This paper considers the problem of reconstructing the motion 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 guarantee 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 linearly in the number of frames, leveraging the intrinsically local nature of filter interactions. Extension to affine projection enables reconstruction without estimating cameras.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jack Valmadre
    • 1
    • 3
  • Yingying Zhu
    • 2
    • 3
  • Sridha Sridharan
    • 1
  • Simon Lucey
    • 1
    • 3
  1. 1.Queensland University of TechnologyAustralia
  2. 2.University of QueenslandAustralia
  3. 3.Commonwealth Scientific and Industrial Research OrganisationAustralia

Personalised recommendations