Title

A Non-Iterative Greedy Algorithm For Multi-Frame Point Correspondence

Abstract

This paper presents a framework for finding point correspondences in monocular image segue/ices over multiple frames. The general problem of multi-frame point correspondence is NP Hard for three or more frames. A polynomial lime 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.

Publication Date

1-1-2003

Publication Title

Proceedings of the IEEE International Conference on Computer Vision

Volume

1

Number of Pages

110-115

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/iccv.2003.1238321

Socpus ID

0344551947 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0344551947

This document is currently not available here.

Share

COinS