L1 Graph Based Sparse Model for Label De-noising

The abundant images and user-provided tags available on social media websites provide an intriguing opportunity to scale vision problems beyond the limits imposed by manual dataset collection and annotation. However, exploiting
user-tagged data in practice is challenging since it contains many noisy (incorrect and missing) labels. In this work, we propose a novel robust graph-based approach for label de-noising. Specifically, the proposed model is built upon (i) label smoothing via a visual similarity graph in a form of L1 graph regulariser, which is more robust against visual outliers than the conventional L2 regulariser, and (ii) explicitly modelling the label noise pattern, which helps to further improve de-noising performance. An efficient algorithm is formulated to optimise the proposed model, which contains multiple robust L1 terms in its objective function and is thus non-trivial to optimise. We demonstrate our model’s superior denoising performance across the spectrum of problems from multi-class with label noise to real social media data with more complex multi-label structured label noise patterns.