Online crowdsourcing: Rating annotators and obtaining cost-effective labels
Citations Over TimeTop 1% of 2010 papers
Abstract
Labeling large datasets has become faster, cheaper, and easier with the advent of crowdsourcing services like Amazon Mechanical Turk. How can one trust the labels obtained from such services? We propose a model of the labeling process which includes label uncertainty, as well a multi-dimensional measure of the annotators' ability. From the model we derive an online algorithm that estimates the most likely value of the labels and the annotator abilities. It finds and prioritizes experts when requesting labels, and actively excludes unreliable annotators. Based on labels already obtained, it dynamically chooses which images will be labeled next, and how many labels to request in order to achieve a desired level of confidence. Our algorithm is general and can handle binary, multi-valued, and continuous annotations (e.g. bounding boxes). Experiments on a dataset containing more than 50,000 labels show that our algorithm reduces the number of labels required, and thus the total cost of labeling, by a large factor while keeping error rates low on a variety of datasets.
Related Papers
- → Syncretic-NMS: A Merging Non-Maximum Suppression Algorithm for Instance Segmentation(2020)30 cited
- → Medical Image Segmentation with Imperfect 3D Bounding Boxes(2021)1 cited
- → Bounding-box Centralization for Improving SiamFC++(2021)1 cited
- A Method to Generate the Minimum Bounding Boxes for Shape-Arbitrary Objects(2010)