Adobe Boxes: Locating Object Proposals Using Object Adobes

被引:21
作者
Fang, Zhiwen [1 ,2 ]
Cao, Zhiguo [1 ]
Xiao, Yang [1 ]
Zhu, Lei [3 ]
Yuan, Junsong [4 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Automat, Natl Key Lab Sci & Technol Multispectral Informat, Wuhan 430074, Peoples R China
[2] Hunan Univ Humanities Sci & Technol, Sch Energy & Mech Elect Engn, Loudi 417000, Peoples R China
[3] Wuhan Univ Sci & Technol, Sch Informat Sci & Engn, Wuhan 430081, Peoples R China
[4] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
基金
中国国家自然科学基金;
关键词
Object proposal; Adobe Boxes; object adobes; adobe compactness; objectness; GRADIENTS;
D O I
10.1109/TIP.2016.2579311
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Despite the previous efforts of object proposals, the detection rates of the existing approaches are still not satisfactory enough. To address this, we propose Adobe Boxes to efficiently locate the potential objects with fewer proposals, in terms of searching the object adobes that are the salient object parts easy to be perceived. Because of the visual difference between the object and its surroundings, an object adobe obtained from the local region has a high probability to be a part of an object, which is capable of depicting the locative information of the proto-object. Our approach comprises of three main procedures. First, the coarse object proposals are acquired by employing randomly sampled windows. Then, based on local-contrast analysis, the object adobes are identified within the enlarged bounding boxes that correspond to the coarse proposals. The final object proposals are obtained by converging the bounding boxes to tightly surround the object adobes. Meanwhile, our object adobes can also refine the detection rate of most state-of-the-art methods as a refinement approach. The extensive experiments on four challenging datasets (PASCAL VOC2007, VOC2010, VOC2012, and ILSVRC2014) demonstrate that the detection rate of our approach generally outperforms the state-of-the-art methods, especially with relatively small number of proposals. The average time consumed on one image is about 48 ms, which nearly meets the real-time requirement.
引用
收藏
页码:4116 / 4128
页数:13
相关论文
共 35 条
[1]   Measuring the Objectness of Image Windows [J].
Alexe, Bogdan ;
Deselaers, Thomas ;
Ferrari, Vittorio .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) :2189-2202
[2]  
Alexe B, 2010, PROC CVPR IEEE, P73, DOI 10.1109/CVPR.2010.5540226
[3]  
[Anonymous], 2007, 2007 IEEE C COMPUTER, DOI [10.1109/CVPR.2007.383086, DOI 10.1109/CVPR.2007.383086]
[4]  
[Anonymous], P BRIT MACH VIS C
[5]  
[Anonymous], The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results
[6]   Multiscale Combinatorial Grouping [J].
Arbelaez, Pablo ;
Pont-Tuset, Jordi ;
Barron, Jonathan T. ;
Marques, Ferran ;
Malik, Jitendra .
2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, :328-335
[7]  
Cantoni V, 2011, ELSEV INSIGHT, P1
[8]  
Chen XZ, 2015, PROC CVPR IEEE, P2587, DOI 10.1109/CVPR.2015.7298874
[9]   BING: Binarized Normed Gradients for Objectness Estimation at 300fps [J].
Cheng, Ming-Ming ;
Zhang, Ziming ;
Lin, Wen-Yan ;
Torr, Philip .
2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, :3286-3293
[10]  
Cho M, 2015, PROC CVPR IEEE, P1201, DOI 10.1109/CVPR.2015.7298724