English

Better Feature Tracking Through Subspace Constraints

Computer Vision and Pattern Recognition 2019-04-09 v1

Abstract

Feature tracking in video is a crucial task in computer vision. Usually, the tracking problem is handled one feature at a time, using a single-feature tracker like the Kanade-Lucas-Tomasi algorithm, or one of its derivatives. While this approach works quite well when dealing with high-quality video and "strong" features, it often falters when faced with dark and noisy video containing low-quality features. We present a framework for jointly tracking a set of features, which enables sharing information between the different features in the scene. We show that our method can be employed to track features for both rigid and nonrigid motions (possibly of few moving bodies) even when some features are occluded. Furthermore, it can be used to significantly improve tracking results in poorly-lit scenes (where there is a mix of good and bad features). Our approach does not require direct modeling of the structure or the motion of the scene, and runs in real time on a single CPU core.

Keywords

Cite

@article{arxiv.1405.2316,
  title  = {Better Feature Tracking Through Subspace Constraints},
  author = {Bryan Poling and Gilad Lerman and Arthur Szlam},
  journal= {arXiv preprint arXiv:1405.2316},
  year   = {2019}
}

Comments

8 pages, 2 figures. CVPR 2014

R2 v1 2026-06-22T04:10:20.562Z