Online Active Proposal Set Generation for Weakly Supervised Object Detection

• URL: http://arxiv.org/abs/2101.07929v1
• Date: Wed, 20 Jan 2021 02:20:48 GMT
• Title: Online Active Proposal Set Generation for Weakly Supervised Object Detection
• Authors: Ruibing Jin, Guosheng Lin, and Changyun Wen
• Abstract summary: weakly supervised object detection methods only require image-level annotations. Online proposal sampling is an intuitive solution to these issues. Our proposed OPG algorithm shows consistent and significant improvement on both datasets PASCAL VOC 2007 and 2012.
• Score: 41.385545249520696
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To reduce the manpower consumption on box-level annotations, many weakly supervised object detection methods which only require image-level annotations, have been proposed recently. The training process in these methods is formulated into two steps. They firstly train a neural network under weak supervision to generate pseudo ground truths (PGTs). Then, these PGTs are used to train another network under full supervision. Compared with fully supervised methods, the training process in weakly supervised methods becomes more complex and time-consuming. Furthermore, overwhelming negative proposals are involved at the first step. This is neglected by most methods, which makes the training network biased towards to negative proposals and thus degrades the quality of the PGTs, limiting the training network performance at the second step. Online proposal sampling is an intuitive solution to these issues. However, lacking of adequate labeling, a simple online proposal sampling may make the training network stuck into local minima. To solve this problem, we propose an Online Active Proposal Set Generation (OPG) algorithm. Our OPG algorithm consists of two parts: Dynamic Proposal Constraint (DPC) and Proposal Partition (PP). DPC is proposed to dynamically determine different proposal sampling strategy according to the current training state. PP is used to score each proposal, part proposals into different sets and generate an active proposal set for the network optimization. Through experiments, our proposed OPG shows consistent and significant improvement on both datasets PASCAL VOC 2007 and 2012, yielding comparable performance to the state-of-the-art results.

Related papers

• HUWSOD: Holistic Self-training for Unified Weakly Supervised Object Detection [66.42229859018775]
  We introduce a unified, high-capacity weakly supervised object detection (WSOD) network called HUWSOD. HUWSOD incorporates a self-supervised proposal generator and an autoencoder proposal generator with a multi-rate re-supervised pyramid to replace traditional object proposals. Our findings indicate that randomly boxes, although significantly different from well-designed offline object proposals, are effective for WSOD training.
  arXiv  Detail & Related papers  (2024-06-27T17:59:49Z)
• Proposal-Based Multiple Instance Learning for Weakly-Supervised Temporal Action Localization [98.66318678030491]
  Weakly-supervised temporal action localization aims to localize and recognize actions in untrimmed videos with only video-level category labels during training. We propose a novel Proposal-based Multiple Instance Learning (P-MIL) framework that directly classifies the candidate proposals in both the training and testing stages.
  arXiv  Detail & Related papers  (2023-05-29T02:48:04Z)
• Transformer-based assignment decision network for multiple object tracking [0.0]
  We introduce Transformer-based Assignment Decision Network (TADN) that tackles data association without the need of explicit optimization during inference. Our proposed approach outperforms the state-of-the-art in most evaluation metrics despite its simple nature as a tracker.
  arXiv  Detail & Related papers  (2022-08-06T19:47:32Z)
• W2N:Switching From Weak Supervision to Noisy Supervision for Object Detection [64.10643170523414]
  We propose a novel WSOD framework with a new paradigm that switches from weak supervision to noisy supervision (W2N) In the localization adaptation module, we propose a regularization loss to reduce the proportion of discriminative parts in original pseudo ground-truths. Our W2N outperforms all existing pure WSOD methods and transfer learning methods.
  arXiv  Detail & Related papers  (2022-07-25T12:13:48Z)
• Contrastive Proposal Extension with LSTM Network for Weakly Supervised Object Detection [52.86681130880647]
  Weakly supervised object detection (WSOD) has attracted more and more attention since it only uses image-level labels and can save huge annotation costs. We propose a new method by comparing the initial proposals and the extension ones to optimize those initial proposals. Experiments on PASCAL VOC 2007, VOC 2012 and MS-COCO datasets show that our method has achieved the state-of-the-art results.
  arXiv  Detail & Related papers  (2021-10-14T16:31:57Z)
• Natural Language Video Localization with Learnable Moment Proposals [40.91060659795612]
  We propose a novel model termed LPNet (Learnable Proposal Network for NLVL) with a fixed set of learnable moment proposals. In this paper, we demonstrate the effectiveness of LPNet over existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-09-22T12:18:58Z)
• PGTRNet: Two-phase Weakly Supervised Object Detection with Pseudo Ground Truth Refining [10.262660606897974]
  Weakly Supervised Object Detection (WSOD) aiming to train detectors with only image-level annotations has arisen increasing attention. Current state-of-the-art approaches mainly follow a two-stage training strategy whichintegrates a fully supervised detector (FSD) with a pure WSOD model. There are two main problems hindering the performance of the two-phase WSOD approaches, i.e., insufficient learning problem and strict reliance between the FSD and the pseudo ground truth generated by theWSOD model. This paper proposes pseudo ground truth refinement network (PGTRNet), a simple yet effective method
  arXiv  Detail & Related papers  (2021-08-25T19:20:49Z)
• Learning a Proposal Classifier for Multiple Object Tracking [36.67900094433032]
  We propose a novel proposal-based learnable framework, which models MOT as a proposal generation, proposal scoring and trajectory inference paradigm on an affinity graph. We experimentally demonstrate that the proposed method achieves a clear performance improvement in both MOTA and IDF1 with respect to previous state-of-the-art on two public benchmarks.
  arXiv  Detail & Related papers  (2021-03-14T10:46:54Z)
• Subset Sampling For Progressive Neural Network Learning [106.12874293597754]
  Progressive Neural Network Learning is a class of algorithms that incrementally construct the network's topology and optimize its parameters based on the training data. We propose to speed up this process by exploiting subsets of training data at each incremental training step. Experimental results in object, scene and face recognition problems demonstrate that the proposed approach speeds up the optimization procedure considerably.
  arXiv  Detail & Related papers  (2020-02-17T18:57:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.