Tracking feature points: Dynamic programming algorithm

This paper studies the point correspondence problem for which a diversity of qualitative and statistical solutions exist. Most of them use local optimizations between neighboring frames to determine trajectories for moving points. We present improved extensive algorithm using dynamic programming method which provides global optimum for functional based both on nearest neighbor and smooth motion models. We considered dynamic scenes with multiple, independently moving objects in which feature points may enter and leave the view field. Experiments with real and synthetic data are presented to validate the claims about the performance of the proposed algorithm.