Trajectories and Events

Haynes, Susan M.; Jain, Ramesh C.

doi:10.1109/CVPR.1991.139789

Trajectories and Events

Susan M. Haynes, Ramesh C. Jain

CVPR 1991 pp. 702-703

doi:10.1109/CVPR.1991.139789 /cvpr/1991/haynes1991cvpr-trajectories/

Abstract

A solution to the correspondence problem using constraint satisfaction is described. It uses a real-time line-fitting algorithm to detect changes in a point's motion parameters as they happen. A trajectory is hypothesized for a single point's motion. Since the event detected may be wrong, multiple trajectories are hypothesized for each point. A correspondence is drawn from the set of hypothesized trajectories. The algorithm is robust, working on noisy and non-rigid motion data, and does not use false precision.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

CVPR Semantic Scholar

Cite

Text

Haynes and Jain. "Trajectories and Events." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139789

Markdown

[Haynes and Jain. "Trajectories and Events." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/haynes1991cvpr-trajectories/) doi:10.1109/CVPR.1991.139789

BibTeX

@inproceedings{haynes1991cvpr-trajectories,
  title     = {{Trajectories and Events}},
  author    = {Haynes, Susan M. and Jain, Ramesh C.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {702-703},
  doi       = {10.1109/CVPR.1991.139789},
  url       = {https://mlanthology.org/cvpr/1991/haynes1991cvpr-trajectories/}
}