Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence 2017
DOI: 10.24963/ijcai.2017/285
|View full text |Cite
|
Sign up to set email alerts
|

Saliency Guided End-to-End Learning for Weakly Supervised Object Detection

Abstract: Weakly supervised object detection (WSOD), which is the problem of learning detectors using only image-level labels, has been attracting more and more interest. However, this problem is quite challenging due to the lack of location supervision. To address this issue, this paper integrates saliency into a deep architecture, in which the location information is explored both explicitly and implicitly. Specifically, we select highly confident object proposals under the guidance of class-specific saliency maps. Th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(17 citation statements)
references
References 0 publications
0
17
0
Order By: Relevance
“…We compare our approach with both two-step [1][2][3][4] and end-to-end [5][6][7][8][9][10] approaches. Top-3 results are indicated by green, red and blue colors.…”
Section: Comparison With Other State-of-the-artsmentioning
confidence: 99%
“…We compare our approach with both two-step [1][2][3][4] and end-to-end [5][6][7][8][9][10] approaches. Top-3 results are indicated by green, red and blue colors.…”
Section: Comparison With Other State-of-the-artsmentioning
confidence: 99%
“…However, WSDDN only uses an image-level classification loss which makes it tend to recognize the most discriminative parts. To address the problem, [Diba et al, 2017] and [Lai and Gong, 2017] introduce salient segmentation attention maps to regularize the training. The introduced segmentation regularization is helpful but not enough to address the huge gap between those discriminative parts and the complete bounding boxes.…”
Section: Weakly Supervised Object Detectionmentioning
confidence: 99%
“…The task specific loss function is decomposed over the bounding box as shown in equation (5) of the main paper. Therefore, we re-write the above equation as (20) DIV ∆ (Pr c , Pr c )…”
Section: Diversity Between Prediction Net and Conditional Netmentioning
confidence: 99%