Abstract
Binarized normed gradients (BING) can be utilized as a preprocessing step for generic object proposal generation, and has attracted great attention because of its fast running and appropriate generalization performance. Recently, although some modified schemes were presented to improve the proposal localization quality, the mechanism of enhancing the performance is still an open problem. In this paper, Adaptive weighted binary normed gradients plus (AWBING Plus) algorithm is proposed, based on the BING method, which replaces the support vector machine (SVM) with adaptive weighted extreme learning machine (Adaptive WELM) to reduce the number of proposals, as well as comparable performance, by using the multi-thresholding straddling expansion (MTSE) as the post-processing stage to enhance the localization quality. We explain the methodology of WELM applied to BING, and analyzed the effect of the improved WELM algorithm, which is named Adaptive WELM. The experimental results from PASCAL VOC2007, Microsoft COCO2014 and ILSVRC2013 show that the proposed approach achieved superior performance compared with other advanced methods on generic object proposal generation, and it runs faster as well.
Get full access to this article
View all access options for this article.
