Optimizing Average Precision using Weakly Supervised Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Optimizing Average Precision using Weakly Supervised Data

Abstract

The performance of binary classification tasks, such as action classification and object detection, is often measured in terms of the average precision (AP). Yet it is common practice in computer vision to employ the support vector machine (SVM) classifier, which optimizes a surrogate 0-1 loss. The popularity of SVM can be attributed to its empirical performance. Specifically, in fully supervised settings, SVM tends to provide similar accuracy to the AP-SVM classifier, which directly optimizes an AP-based loss. However, we hypothesize that in the significantly more challenging and practically useful setting of weakly supervised learning, it becomes crucial to optimize the right accuracy measure. In order to test this hypothesis, we propose a novel latent AP-SVM that minimizes a carefully designed upper bound on the AP-based loss function over weakly supervised samples. Using publicly available datasets, we demonstrate the advantage of our approach over standard loss-based binary classifiers on two challenging problems: action classification and character recognition.

Domains

Automatic
Fichier principal
Vignette du fichier
BJK-CVPR2014.pdf (421.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00984699 , version 1 (28-04-2014)

Identifiers

  • HAL Id : hal-00984699 , version 1

Cite

Aseem Behl, C.V. Jawahar, M. Pawan Kumar. Optimizing Average Precision using Weakly Supervised Data. CVPR - IEEE Conference on Computer Vision and Pattern Recognition, 2014, Columbus, Ohio, United States. ⟨hal-00984699⟩
349 View
333 Download

Share

Gmail Facebook X LinkedIn More