# How Low Can We Go? Pixel Annotation for Semantic Segmentation

Source: [How Low Can We Go? Pixel Annotation for Semantic Segmentation](<https://www.sota2.com/research/paper/68fa6bc11e209131cea3015e>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T23:56:05.140Z

Authors: Daniel Kigli, Ariel Shamir, Shai Avidan

Published: 2022-01-25T16:50:24.000Z

## Abstract

How many labeled pixels are needed to segment an image, without any prior knowledge? We conduct an experiment to answer this question.   In our experiment, an Oracle is using Active Learning to train a network from scratch. The Oracle has access to the entire label map of the image, but the goal is to reveal as little pixel labels to the network as possible. We find that, on average, the Oracle needs to reveal (i.e., annotate) less than 0.1% of the pixels in order to train a network. The network can then label all pixels in the image at an accuracy of more than 98%.   Based on this single-image-annotation experiment, we design an experiment to quickly annotate an entire data set. In the data set level experiment the Oracle trains a new network for each image from scratch. The network can then be used to create pseudo-labels, which are the network predicted labels of the unlabeled pixels, for the entire image. Only then, a data set level network is trained from scratch on all the pseudo-labeled images at once.   We repeat both image level and data set level experiments on two, very different, real-world data sets, and find that it is possible to reach the performance of a fully annotated data set using a fraction of the annotation cost.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2201.10448>)

[PDF](<https://arxiv.org/pdf/2201.10448.pdf>)
