Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Towards Longer Long-Range Motion Trajectories

Towards Longer Long-Range Motion Trajectories

Thumbnail Image
Download
Name

Freeman_Towards Longer.pdf

Size

5.87 MB

Format

Adobe PDF

Checksum (MD5)

f6efd080959d59bc5d251f11f3a77681

Author(s)
Rubinstein, Michael
•
Liu, Ce
•
Freeman, William T.
Date Issued
September 2012
Journal
Proceedings of the British Machine Vision Conference 2012
Publisher
British Machine Vision Association
Citation
Rubinstein, Michael, Ce Liu, and William T. Freeman. “Towards Longer Long-Range Motion Trajectories.” British Machine Vision Conference 2012 (2012).
Version
Final published version
Abstract
Although dense, long-range, motion trajectories are a prominent representation of motion in videos, there is still no good solution for constructing dense motion tracks in a truly long-range fashion. Ideally, we would want every scene feature that appears in multiple, not necessarily contiguous, parts of the sequence to be associated with the same motion track. Despite this reasonable and clearly stated objective, there has been surprisingly little work on general-purpose algorithms that can accomplish this task. State-of-the-art dense motion trackers process the sequence incrementally in a frame-by-frame manner, and associate, by design, features that disappear and reappear in the video, with different tracks, thereby losing important information of the long-term motion signal. In this paper, we strive towards an algorithm for producing generic long-range motion trajectories that are robust to occlusion, deformation and camera motion. We leverage accurate local (short-range) trajectories produced by current motion tracking methods and use them as an initial estimate for a global (long-range) solution. Our algorithm re-correlates the short trajectories and links them to form a long-range motion representation by formulating a combinatorial assignment problem that is defined and optimized globally over the entire sequence. This allows to correlate features in arbitrarily distinct parts of the sequence, as well as handle tracking ambiguities by spatiotemporal regularization. We report the results of the algorithm on both synthetic and natural videos, and evaluate the long-range motion representation for action recognition.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
http://hdl.handle.net/1721.1/100283
DOI of Published Version
https://doi.org/10.5244/C.26.53
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.