CVAug 14, 2019

Detecting 11K Classes: Large Scale Object Detection without Fine-Grained Bounding Boxes

arXiv:1908.05217v130 citations
AI Analysis

This addresses the high annotation cost for large-scale object detection, enabling broader applications with reduced labeling effort, though it is incremental in leveraging semi-supervised techniques.

The paper tackles the problem of scaling object detection to 11K classes without costly fine-grained bounding box annotations, achieving close accuracy to fully-supervised state-of-the-art methods on ImageNet and OpenImages datasets.

Recent advances in deep learning greatly boost the performance of object detection. State-of-the-art methods such as Faster-RCNN, FPN and R-FCN have achieved high accuracy in challenging benchmark datasets. However, these methods require fully annotated object bounding boxes for training, which are incredibly hard to scale up due to the high annotation cost. Weakly-supervised methods, on the other hand, only require image-level labels for training, but the performance is far below their fully-supervised counterparts. In this paper, we propose a semi-supervised large scale fine-grained detection method, which only needs bounding box annotations of a smaller number of coarse-grained classes and image-level labels of large scale fine-grained classes, and can detect all classes at nearly fully-supervised accuracy. We achieve this by utilizing the correlations between coarse-grained and fine-grained classes with shared backbone, soft-attention based proposal re-ranking, and a dual-level memory module. Experiment results show that our methods can achieve close accuracy on object detection to state-of-the-art fully-supervised methods on two large scale datasets, ImageNet and OpenImages, with only a small fraction of fully annotated classes.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes