The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2005 vol.27)
pp: 51-65
ABSTRACT
This paper presents 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 the 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 the points from the scene, this is not a limitation for the proposed algorithm. Experiments with real and synthetic data over a wide range of scenarios and system parameters are presented to validate the claims about the performance of the proposed algorithm.
INDEX TERMS
Point correspondence, target tracking, motion, occlusion, point trajectory, data association, bipartite graph matching, path cover of directed graph.
CITATION
Khurram Shafique, Mubarak Shah, "A Noniterative Greedy Algorithm for Multiframe Point Correspondence", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.27, no. 1, pp. 51-65, January 2005, doi:10.1109/TPAMI.2005.1
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool