<< Back

We present a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame 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 non-iterative 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.

Associated publication:

Khurram Hassan-Shafique and Mubarak Shah, "A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 27, Isssue 1 (Jan 2005), pp.51-65.

Khurram Hassan-Shafique and Mubarak Shah, "A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence", The Ninth IEEE International Conference on Computer Vision (ICCV), Nice, France, October 2003.

For Power Point presentation click here