Much Ado About Time: Exhaustive Annotation of Temporal Data
Gunnar A. Sigurdsson, Olga Russakovsky, Ali Farhadi, Ivan Laptev,, Abhinav Gupta

TL;DR
This paper explores an efficient crowdsourcing strategy for annotating temporal data like videos, showing that asking multiple questions per viewing improves recall and reduces annotation time.
Contribution
It introduces an optimal approach of asking many questions per video in crowdsourcing, significantly enhancing annotation efficiency for temporal datasets.
Findings
Asking up to 52 questions per video improves recall by 10%.
The proposed method halves annotation time compared to baseline.
Multiple imperfect annotations combined yield high-quality labels.
Abstract
Large-scale annotated datasets allow AI systems to learn from and build upon the knowledge of the crowd. Many crowdsourcing techniques have been developed for collecting image annotations. These techniques often implicitly rely on the fact that a new input image takes a negligible amount of time to perceive. In contrast, we investigate and determine the most cost-effective way of obtaining high-quality multi-label annotations for temporal data such as videos. Watching even a short 30-second video clip requires a significant time investment from a crowd worker; thus, requesting multiple annotations following a single viewing is an important cost-saving strategy. But how many questions should we ask per video? We conclude that the optimal strategy is to ask as many questions as possible in a HIT (up to 52 binary questions after watching a 30-second video clip in our experiments). We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Crowdsensing and Crowdsourcing · Multimodal Machine Learning Applications · Domain Adaptation and Few-Shot Learning
