A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence

  • Authors:
  • Khurram Shafique;Mubarak Shah

  • Affiliations:
  • -;-

  • Venue:
  • ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a framework for finding point correspondencesin monocular image sequences over multiple frames.The generalproblem of multi-frame point correspondence is NP Hard for three ormore frames. A polynomial time algorithm for a restriction of thisproblem is presented, and is used as the basis of proposed greedyalgorithm for the general problem. The greedy nature of theproposed algorithm allows it to be used in real time systems fortracking and surveillance etc. In addition, the proposed algorithmdeals with the problems of occlusion, missed detections, and falsepositives, by using a single non-iterative greedy optimizationscheme, and hence, reduces the complexity of the overall algorithmas compared to most existing approaches, where multiple heuristicsare used for the same purpose.While most greedy algorithms forpoint tracking do not allow for entry and exit of points from thescene, this is not a limitation for the proposed algorithm.Experiments with real and synthetic data show that the proposedalgorithm outperforms the existing techniques and is applicable inmore general settings.