A non-iterative greedy algorithm for multi-frame point correspondence
- 1 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 110-115 vol.1
- https://doi.org/10.1109/iccv.2003.1238321
Abstract
We present a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multiframe point correspondence is NP hard for three or more frames. A polynomial time algorithm for a restriction of this problem is presented, and is used as the basis of proposed greedy algorithm for the general problem. The greedy nature of the proposed algorithm allows it to be used in real time systems for tracking and surveillance etc. In addition, the proposed algorithm deals with the problems of occlusion, missed detections, and false positives, by using a single noniterative greedy optimization scheme, and hence, reduces the complexity of the overall algorithm as compared to most existing approaches, where multiple heuristics are used for the same purpose. While most greedy algorithms for point tracking do not allow for entry and exit of points from the scene, this is not a limitation for the proposed algorithm. Experiments with real and synthetic data show that the proposed algorithm outperforms the existing techniques and is applicable in more general settings.Keywords
This publication has 11 references indexed in Scilit:
- Resolving motion correspondence for densely moving pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Feature Point Tracking for Incomplete TrajectoriesComputing, 1999
- A generalized S-D assignment algorithm for multisensor-multitarget state estimationIEEE Transactions on Aerospace and Electronic Systems, 1997
- An efficient implementation of Reid's multiple hypothesis tracking algorithm and its evaluation for the purpose of visual trackingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- A review of statistical data association techniques for motion correspondenceInternational Journal of Computer Vision, 1993
- Establishing motion correspondenceCVGIP: Image Understanding, 1991
- Feature point correspondence in the presence of occlusionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Finding Trajectories of Feature Points in a Monocular Image SequencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- An algorithm for tracking multiple targetsIEEE Transactions on Automatic Control, 1979
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code OptimizationJournal of the ACM, 1977