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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A non-iterative greedy algorithm for multi-frame point correspondence


    Contributors:
    Shafique, (author) / Shah, (author)


    Publication date :

    2003-01-01


    Size :

    3742146 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



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

    Shafique, K. / Shah, M. / IEEE | British Library Conference Proceedings | 2003


    Optimal Multi-frame Correspondence with Assignment Tensors

    Oliveira, R. / Ferreira, R. / Costeira, J. P. | British Library Conference Proceedings | 2006


    Multi-Frame Correspondence Estimation Using Subspace Constraints

    Irani, M. | British Library Online Contents | 2002


    Multi-pedestrian Assignment and Detection Based on DE-Greedy Algorithm

    Liu, Mengge / Liu, Zhenghua / Cao, Ziqi et al. | Springer Verlag | 2021


    Multi-pedestrian Assignment and Detection Based on DE-Greedy Algorithm

    Liu, Mengge / Liu, Zhenghua / Cao, Ziqi et al. | British Library Conference Proceedings | 2022