Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 5, 2019 | Submitted
Report Open

Fine-Grained Retrieval of Sports Plays using Tree-Based Alignment of Trajectories

Abstract

We propose a novel method for effective retrieval of multi-agent spatiotemporal tracking data. Retrieval of spatiotemporal tracking data offers several unique challenges compared to conventional text-based retrieval settings. Most notably, the data is fine-grained meaning that the specific location of agents is important in describing behavior. Additionally, the data often contains tracks of multiple agents (e.g., multiple players in a sports game), which generally leads to a permutational alignment problem when performing relevance estimation. Due to the frequent position swap of agents, it is difficult to maintain the correspondence of agents, and such issues make the pairwise comparison problematic for multi-agent spatiotemporal data. To address this issue, we propose a tree-based method to estimate the relevance between multi-agent spatiotemporal tracks. It uses a hierarchical structure to perform multi-agent data alignment and partitioning in a coarse-to-fine fashion. We validate our approach via user studies with domain experts. Our results show that our method boosts performance in retrieving similar sports plays -- especially in interactive situations where the user selects a subset of trajectories compared to current state-of-the-art methods.

Additional Information

© 2018 held by the owner/author(s).

Attached Files

Submitted - 1710.02255.pdf

Files

1710.02255.pdf
Files (6.0 MB)
Name Size Download all
md5:22ddf0132550fbceac3c9a46254de22e
6.0 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023