Motion Trajectories

Abstract

A simple algorithm for selecting and linking interesting flow vectors across a sequence of frames for computing motion trajectories is presented. Tokens that have both interesting pixel gray values in the spatial domain and in the optical flow field in the temporal domain are tracked. This AND operation effectively removes some redundant trajectories. Due to errors introduced during the computation of optical flow, and the linking of such flow vectors across a sequence of frames, the resultant trajectories are not always smooth. A Kalman-filtering-based approach for smoothing the trajectories is discussed.<<ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite

Text

Shah et al. "Motion Trajectories." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223244

Markdown

[Shah et al. "Motion Trajectories." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/shah1992cvpr-motion/) doi:10.1109/CVPR.1992.223244

BibTeX

@inproceedings{shah1992cvpr-motion,
  title     = {{Motion Trajectories}},
  author    = {Shah, Mubarak and Rangarajan, Krishnan and Tsai, Ping-Sing},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1992},
  pages     = {839-841},
  doi       = {10.1109/CVPR.1992.223244},
  url       = {https://mlanthology.org/cvpr/1992/shah1992cvpr-motion/}
}