Sequential Optimization for Efficient High-Quality Object Proposal Generation

11/14/2015 ∙ by Ziming Zhang, et al. ∙ Nankai University University of Oxford Huazhong University of Science u0026 Technology MERL 0

We are motivated by the need for a generic object proposal generation algorithm which achieves good balance between object detection recall, proposal localization quality and computational efficiency. We propose a novel object proposal algorithm, BING++, which inherits the virtue of good computational efficiency of BING but significantly improves its proposal localization quality. At high level we formulate the problem of object proposal generation from a novel probabilistic perspective, based on which our BING++ manages to improve the localization quality by employing edges and segments to estimate object boundaries and update the proposals sequentially. We propose learning the parameters efficiently by searching for approximate solutions in a quantized parameter space for complexity reduction. We demonstrate the generalization of BING++ with the same fixed parameters across different object classes and datasets. Empirically our BING++ can run at half speed of BING on CPU, but significantly improve the localization quality by 18.5 both VOC2007 and Microhsoft COCO datasets, respectively. Compared with other state-of-the-art approaches, BING++ can achieve comparable performance, but run significantly faster.



There are no comments yet.


page 9

page 11

page 14

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Generic object proposal generation arises as a critical standalone preprocessing step in many applications such as object recognition [2] and detection [3], and consequently has attracted significant attention. Object proposal generation can be broadly measured using three metrics: (a) Detection Recall (DR) [1, 4, 5], which is the ratio between the number of correctly detected objects and the total number of objects in the dataset; (b) Proposal Localization Quality in terms of average best overlap (ABO) for each object instance in each class, and corresponding mean average best overlap (MABO) across all the classes [6]; (c) Computational Efficiency (CE). In this paper, we are interested in developing new algorithms to provide a small set of windows (i.e. bounding boxes) in images with high DR, high localization quality (especially for MABO), and high CE.

(a) DR vs. computational time (b) MABO vs. computational time
Fig. 1: Comparison of generic object proposal methods on VOC2007 test dataset [7] with at most 1,000 proposals per image and intersection-over-union (IoU) threshold equal to 0.5. All the competing results are produced by public code (see Table III and IV in Section 4 for more details).

In recent years while many object proposal generation algorithms have been proposed, existing methods do not appear to achieve good balance between DR, MABO and CE. Fig. 1 depicts inherent tradeoffs in DR, MABO and CE among different proposal algorithms. We can see clearly that, for instance, BING [1] is computationally efficient but has poor localization quality, while selective search [6] generates good proposals but is computationally inefficient. Our perspective here is that computational efficiency has to be an important consideration in developing algorithms since object proposal generation is typically a preprocessing step. Based on this reasoning, we propose a novel object proposal algorithm, BING++, which is an extension of our previous work [1, 4, 5].

Fig. 2: Best overlap (BO) statistical comparison using at most 1,000 proposals per image and IoU threshold 0.5 on VOC2007 test dataset.

BING [1] has been demonstrated as a very efficient object proposal algorithm. Its basic idea is to first train linear filters for each so-called quantized scale/aspect-ratio (or quantized window size) [4, 5] using simple binary gradient features, and then learn another global linear filter to rank bounding boxes from each quantized scale/aspect-ratio and output proposals from the top list. The quantization scheme guarantees to map every possible object scale/aspect-ratio to at least one of the predefined and fixed quantized scales/aspect-ratios. As stated in [5], this quantization scheme reduces the proposal searching space logarithmically, leading to very high computational efficiency. However, this step also leads to significant degradation in proposal quality in practice.

Fig. 3: Statistical comparison based on percentage of objects vs. best proposal deviation from the ground-truth bounding box per object with at most 1,000 proposals per image and IoU threshold 0.5 on VOC2007 test dataset.

To see this, here we will show some statistics about the proposal quality on VOC2007 test set. The behavior on either training or test set is similar. We first point to the best overlap (BO) statistics in Fig. 2, where we notice that the localization quality of BING proposals (over the dataset) is mediocre, because there is a clear leftward drift in BING’s distribution relative to other methods. This is indicative of poor proposal localization quality of BING. In order to see how proposals drift from the ground-truth, we point to comparison between the boundary deviation statistics based on percentage of objects and the best proposal deviation from the ground-truth bounding box per object in Fig. 3. Ideally a Dirac delta distribution in this context is preferable, and the closer the distribution to Dirac delta, the better the proposal algorithm in terms of localization quality. Compared to other competitors, BING performs worse because its distributions appear to have heavier tails on both sides. This indicates that BING is agnostic between choosing larger or smaller proposals for the ground-truth.

On the other hand since BING has high DR, we conclude that the quantization scheme in BING leads to poor proposal localization quality. We infer this based on the view that BING does not allow the proposals to be adaptive to the object boundaries. In contrast, the methods that fully utilize either edge information (e.g. [8]) or segments/superpixels (e.g. [6]) perform better than BING, but run much slower.

Contributions: In this paper we propose a fast yet accurate object proposal algorithm, BING++111The code is available at, which inherits the virtues of BING, i.e. computational efficiency and objectness scores, but significantly improves its proposal localization quality. For instance, on VOC2007 BING++ achieves 77.5% in terms of MABO with significant improvement of 18.5% over BING within only about 3ms on our server with two INTEL XEON E5 2696v2 CPU@2.50GHz. To our best knowledge BING++ is the fastest object proposal algorithm among those that produce state-of-the-art quality.

We first propose a novel probabilistic perspective for understanding the problem of object proposal generation, where we reveal the nature of recursive updating mechanism of proposals by alternating optimization of estimating object boundaries and updating proposals accordingly. This probabilistic view can be served as the theoretical justification of our BING++ (as well as some other proposal algorithms such as [9]). We learn the corresponding parameters efficiently by searching for approximate solutions in a quantized parameter space for complexity reduction. We demonstrate the robustness of such learned parameters across different datasets. In reality we utilize edges and segments sequentially to estimate object boundaries as guide to update proposals further. In such way BING++ manages to improve the localization quality recursively in a coarse-to-fine manner. We test BING++ on VOC2007 and Microsoft COCO [10] datasets, and consistently achieve better trade-off between DR, MABO, and CE, compared with many other object proposal generation algorithms.

1.1 BING for Objectness Measure

Objects are typically considered as stand-alone things with well-defined closed boundaries and centers [11]. When resizing windows corresponding to real world objects to a small fixed size (e.g. ), the norm (i.e. magnitude) of the corresponding image gradients becomes a good discriminative feature, due to the little variation that closed boundaries could present in such abstracted views. Also inspired by the ability of human vision system which efficiently perceives objects before identifying them [12], we introduce a simple 64-dim normed gradient (NG) feature as well as its approximation, i.e. binarized normed gradient (BING) feature, for efficiently capturing the objectness of an image window.

To find generic objects in an image, we scan over predefined quantized window sizes (scales and aspect ratios) [4, 5]. Each window is scored with a linear model :


where , , , and are filter score, NG feature, location, size and position of a window respectively, and

denotes the inner product operator of two vectors. Using non-maximal suppression (NMS), we select a small set of proposals from each size

. Some sizes (e.g. ) are less likely than others to contain an object instance (e.g. ). Thus we define the objectness score (i.e. calibrated filter score), , as


where are separately learned coefficient and a bias terms for each quantized size . Note that calibration based on Eq. 2, although very fast, is only required when re-ranking the small set of final proposals.

To make use of recent advantages in model binarization approximation [13, 14]

, we propose an accelerated version of NG features, i.e. BING, to speed up the feature extraction and testing process. Our learned linear model

can be approximated with a set of basis vectors using [13], where denotes the number of basis vectors, denotes a basis vector, and denotes the corresponding coefficient. By further representing each using a binary vector and its complement: , where , a binarized feature could be tested using fast bitwise and and bit count operations (see [13]),


We approximate the NG values (each saved as a byte value) using the top binary bits of the byte values. Thus, a 64-dim NG feature can be approximated by (BING) features as


where is a binarized feature. Note that these BING features have different weights based on their bit positions in byte values. Accordingly the filter score in Eq. 1 of a window corresponding to BING feature can be efficiently tested using:


where can be tested using fast bitwise and popcnt sse operators. For more details please refer to our paper [1].

1.2 Related Work

Object proposal generation algorithms for images in the literature can be further categorized into three groups, in general, as follows:

(i) Segmentation/Superpixel based algorithms: In fact most proposal generation algorithms fall into this group. For instance, objectness measure [15] combines saliency, color, edges, and superpixels to score the windows, and then samples bounding boxes with high scores as object proposals. Based on [15], Rahtu et al. [16] proposed another cascaded method, where the proposal candidates are sampled from super-pixels based on a prior object localization distribution and then ranked using structured learning with learned features. Further in [17], Blaschko et al. investigated the effect of the NMS step in [16] to improve the performance. Uijlings et al. [6] proposed selective search by combining the strength of both an exhaustive search and segmentation and being guided by the image structure. Manen et al. [18] proposed a randomized Prim algorithm on the superpixel connectivity graphs. Endres and Hoiem [19] proposed ranking the a set of segments using structured learning based on various cues. Krähenbühl and Koltun [20] proposed identifying critical level sets in geodesic distance transforms as proposals, and in [21]

they proposed learning ensembles of classifiers for generating proposals. There are several methods based on energy minimization, such as constrained parametric min-cut

[22, 23], RIGOR [24], and parametric min-loss [25]. Some other methods utilized segmentation/superpixel grouping using, for instance, segment hierarchy [26, 27, 28, 29] or new distance measure [30]. In general, most of these methods can achieve good localization quality, but suffer from either poor computational efficiency or low DR during testing.

(ii) Edge based algorithms: Compared with segments and superpixels, edges are lightweight visual features in terms of computation. Currently most of the efficient proposal algorithms utilize edge related features. Zhang et al. [4] proposed a cascaded ranking SVM (CSVM) method to sample the proposals based on image gradients in a sliding-window manner, and later generalized the method into two-stage cascade SVMs in [5]. Cheng et al. [1] proposed the BING algorithm with binary features running at 300fps. Zhao et al. [31] showed that the success of BING is rather in combinatorial geometry and proposed a window sampling method accordingly. Zitnick and Dollár [8] proposed the EdgeBoxes algorithm to fast generate proposals based on edges and contours while achieving good localization quality. Lu et al. [32] proposed a contour box algorithm to reject the object proposals without explicit closed contours. In addition, Qi et al. [33] proposed a perceptual grouping framework that organizes image edges into meaningful structures, and tested this method for object proposal generation. Ghodrati et al. [34]

proposed a DeepProposal method based on convolutional neural networks (CNN). Ren et al.

[35] proposed the region proposal network (RPN) to accelerate the fast R-CNN [35] for object detection. In general, edge based algorithms are faster than segmentation based algorithm. Among them, BING is the fastest in the literature, but suffers from poor proposal localization quality seriously.

(iii) Proposal post-processing: Several recent works focus on improving proposal quality with small amount of computational cost. For instance, He and Lau [36] proposed an oriented object proposal algorithm for better locating objects by estimating their orientations. Wang et al. [9] proposed using multi-thresholding straddling expansion (MTSE) to improve quality using superpixels.

A comprehensive comparison between some different object proposal algorithms can be found in [37]. In contrast, our BING++ utilizes both edge and segmentation information sequentially to improve the proposal quality gradually, achieving better trade-off between proposal quality and computational efficiency in the literature.

2 Understanding Object Proposals: A Probabilistic Perspective

Let us consider the training (if any) and testing procedures separately for an object proposal algorithm. We denote as the training data with images, and as the ground-truth bounding box coordinates (i.e. ) for objects in the -th image, one box per object. Given a proposal quality measure and a corresponding threshold , the training goal of a proposal algorithm is to determine a suitable structured prediction function (or mapping rule), , to maximize the likelihood of correct detections (or equivalently) as follows:


where is the proposal generation function (or more generally an algorithm) from a feasible functional space that extracts a collection of potential object regions as proposals from image , and

denotes the conditional probability. Here function

measures the overlap (e.g. using intersection-over-union (IoU)) between a proposal and the ground-truth . If this value is larger than (e.g. ) we consider this proposal as a correct detection for the object. Then the likelihood in Eq. 6 essentially measures the joint probability of overall correct detections among the entire training data, which should be maximized by function . Note that the functional space could be restricted by certain (regularization) requirements such as number of proposals. For simplicity we do not explicitly show these requirements in the objective but assume that they are inherent in the definition of implicitly. Similarly for the other functional spaces in the rest of the paper, we make the same assumption without explicit mention.

Recently researchers in computer vision have started to investigate the learning problems with such complicated quality measure

[38, 39]. For instance, Nowozin in [38] studied the problem of making optimal decisions from probabilistic models with IoU scores and proposed a greedy algorithm to efficiently solve it. In contrast our learning problem in Eq. 6 (and similarly in the related equations latter) can be potentially generalized to an arbitrary overlap measure with specific algorithms developed for generic object proposal generation (see Section 3).

In test time we would like to generate proposals for possible objects in test images using the learned function . As we see in Fig. 2, there are very small portions of objects having best overlap (BO) scores less than , indicating that the training procedure with works well. However, with the increase of threshold , say to 0.7, as a new decision rule for correct detection, it is clear that for BING there will be a large portion of proposals which are considered as wrong detections.

In order to solve this performance degradation problem, one possible solution is to retrain the models in Eq. 6 directly with higher thresholds. This strategy, however, becomes more and more difficult with the increase of the threshold (see the experimental evaluation in [4, 5]), because in real data the parameter space for ground-truth bounding boxes of objects is so huge that localizing such windows accurately is extremely difficult with consideration of computational efficiency.

Alternating optimization: Another possible solution is to presume that the feasible functional space has certain structures, so that we can shrink the searching space in , leading to much lower model complexity. Similar ideas have been explored in many different research areas, for instance, recently in developing efficient algorithms for training deep neural networks [40], where circulant structures are used to simplify the fully-connected layers.

Particularly, in this paper we presume as the composition of functional spaces as follows:


where denotes a feasible functional space. Accordingly we can view function as the composition of functions as follows:


where denotes the -th atomic localization function which is applied sequentially to generate proposals. A good example based on such methodology is [9], where a superpixel merging technique was applied on top of existing proposal generators to improve localization quality. Considering the problem in Eq. 6, such solutions from Eq. 8 are always suboptimal (with local optimality at in each functional space ).

Intuitively this function composition in Eq. 8 suggests an alternating optimization routine to learn such atomic functions. That is,


where with the other fixed learned functions such as and . Actually in our work [41] we have explored similar ideas and proposed a specific alternating optimization algorithm for learning these filters in cascade SVMs.

Sequential optimization: The main challenge of developing such alternating optimization algorithms for proposal generation lies in the fact that mathematical formulation of such ad hoc algorithms is extremely difficult to propose. Instead for simplicity in practice the atomic functions in these algorithms are usually learned/designed sequentially, such as [9]. Consequently this leads to the learning rule as


where is a fixed function that can be learned by solving Eq. 10 recursively for times. Obviously the maximum likelihood learned based on Eq. 10 is the lower bound of that based on Eq. 9 and thus Eq. 6.

In fact the training approach in our previous work [4, 5] as well as BING [1] is an exemplar that falls in this lower bound sequential maximization scheme. First we learn a linear filter for each quantized scale/aspect-ratio in image space, and then on top of the filter responses we learn a second linear filter for final ranking purpose across different quantized scales/aspect-ratios. Here we take any feature from a window whose overlap with a ground-truth bounding box is larger than threshold as a positive instance for learning, otherwise as a negative one instead.

3 Bing++

As we state before, due to the fixed and unadaptive quantization scheme, BING can only be considered as a coarse proposal generator. The goal of BING++ is to learn more functions sequentially on top of BING to refine its proposals efficiently and effectively. Note that the proposed method can also be applied on top of other proposal generation algorithms for refinement purpose. In order to achieve the best trade-off between localization quality and computational efficiency, we propose BING++ as our algorithm.

To parameterize Eq. 10

for sequential optimization, in this paper we choose to utilize Gaussian distributions with the 0/1-loss function to model the likelihood

that maximizes DR given . Other parameterizations may also be applied here, e.g. maximizing MABO using Gaussian distributions with the least square loss and , but how to select parameterization is beyond the scope of this paper. In summary, we parameterize in Eq. 10 as follows:


where , denotes the learned sequential functions by BING after training (i.e. represents the output proposals by BING for image ), denotes the binary indicator function measuring the localization quality of proposals generated by function , and it returns 1 if the condition is true, otherwise 0. Then by taking the log operation on the right hand side of Eq. 10, we can write the log-likelihood of Eq. 10 as follows:


Recall that the goal of our BING++ is to generate object proposals accurately as well as efficiently (i.e. fast running speed). To achieve this goal, we propose a specific algorithm, RecursiveBox, with consideration of both edge and segment information for refining the proposals generated by BING. RecursiveBox is developed towards optimizing Eq. 12 directly, which is non-trivial, because Eq. 12 is highly non-convex. Even if we relax the 0/1-loss function to its convex surrogate loss (e.g. hinge-loss), as traditional methods such as SVMs, the resulting optimization problem will be still highly non-convex due to the non-convexity of both operator and overlap measure function .

To solve Eq. 12, we propose a very efficient algorithm to search for the approximate solution in a quantized parameter space. We deliberately design function for different image cues (i.e. edges and segments in this paper particularly), and quantize the corresponding parameter space into a finite number of disjoint subspaces, represented by the centroid parameter of each subspace (similar to cluster centers in KMeans). Then using each representative parameter, we can simply compute the loss in Eq. 12. By collecting all the losses we can select a representative parameter as the approximate solution which leads to a minimum loss.

Intuitively our RecursiveBox works as follows: At time , we estimate a new bounding box for objects based on both image cues and the location/scale of the current bounding box. If both bounding boxes share a large overlap, we consider the new box as a good estimator/proposal, because it is stabilizing. Otherwise, we update the current bounding box with the new one for time . This deterministic rule is repeated over time until some termination criterion (e.g. number of iterations) is satisfied. In each update we equivalently learn a function as in Eq. 12 that can be applied sequentially. Meanwhile we preserve all the objectness scores associated with the initial bounding boxes.

In the following sections, we first explain how to refine proposals using edge information in Section 3.1, which is extremely computationally efficient. Then we introduce segment information as the other cue for refinement in Section 3.2, which results in higher computational burden but generates proposals with better localization quality. Finally we integrate both image cues together and propose our BING++ algorithm in Section 3.3.

3.1 Edge-based Refinement

Object proposal generation is about precisely capturing object boundaries, regardless of the pixels inside objects. We observe that good bounding boxes are those that tightly cover object boundaries. Edges as computationally efficient (compared to superpixels or segments) and indicative features to object boundaries are usually utilized to approximate object boundaries [42, 43, 44]. Indeed most of the efficient proposal algorithms utilize edge related features. If the boundary of a proposal does not intersect with any edge point, we can speculate that either this proposal does not cover any object, or it is too loose. Similarly, if the proposal intersects with too many edge points, we expect that it has not yet reached the object boundary. In all of these cases, we would modify the proposals by pushing them towards the object boundaries. Therefore, we propose utilizing the nearest edge points to proposal boundaries as fast yet weak indicators of object boundaries to refine the proposals.

Given an image, we denote as the predicted bounding box at time , as the set of pixel locations in the area covered by , and as the constant edge map of the image. We then generate a pixel location set, , for by looking for the nearest neighbors in . That is,


where denotes a distance function. For some special distance metric such as Euclidean distance, can be efficiently computed using distance transform [45]222A good tutorial on how to locate the nearest edge point for each pixel using distance transform can be found at

Based on , we define the predicted bounding box, , at time as follows:


where are entry-wise minimum and maximum operators, denotes the vector concatenating operator, and is a trade-off parameter. The basic idea of Eq. 14 is to generate a new box by linearly integrating the two boxes.

By substituting Eq. 14 into Eq. 12, we have the following optimization problem for refining boxes based on edges:


where denotes the -th new bounding box generated from the -th current bounding box in the -th image.

Fig. 4: Statistical behavior comparison when optimizing Eq. 15 on VOC2007 train+val (left) and COCO training (right) datasets using as the threshold for measuring high-quality proposals.

Optimization: Since the parameter in Eq. 15 is a scalar, we simply enumerate all possible quantized values as approximate solutions to accelerate the learning. Specifically, we quantize from 0 to 1, step by 0.01, and perform greedy search over iterations by computing the loss in Eq. 15 based on each quantized value. Fig. 4 illustrates the loss statistics with overlap threshold (for we have similar observations) because we would like to generate high-quality proposals. Note that we learn one in each iteration which results in a sequential function that can be applied in Eq. 12. To plot these curves we set the parameter for the next iteration as the one achieving the minimum loss in the current iteration. In each iteration the inputs for the function are the outputs from the previous iteration (or BING proposals as initialization). We repeat the same procedure to compute the overall loss in Eq. 15 on both VOC2007 train+val and COCO training datasets to verify whether we can learn the parameter with good generalization. Indeed Fig. 4 has demonstrated strong similarities between the statistical behaviors on both datasets, suggesting that we can generalize the learned values across different datasets. With increasing number of iterations the loss curves become flat on both figures, indicating the convergence of our algorithm empirically.

Input : edge-based distance transform map , proposals , overlap threshold
Output : improved proposals
foreach  do
        for  to  do
               if  then break;
        end for
end foreach
Algorithm 1 EdgeRecursiveBox algorithm

Implementation: We list our EdgeRecursiveBox algorithm in Alg. 1 with computational complexity of , roughly speaking, where denotes the number of input proposals in set , and denotes the number of iterations. We utilize canny edge detection to create edge maps to approximate object boundaries. Ideally accurately detecting object boundaries is very desirable yet challenging due to complex imaging factors and semantic ambiguity, and many existing works in the literature such as [42, 43, 44] followed similar ideas. Better boundary detection such as structured edges [46] may improve the proposal quality at the cost of longer computational time. We utilize Euclidean distance for function in Eq. 13 and thus employ distance transform to compute nearest edge maps . By taking into account both generalization and computational complexity and based on the observation from Fig. 4, we specifically set . When for each iteration, the statistical behaviors on both datasets are almost identical to those in Fig. 4. Parameter is predefined to determine whether the procedure of updating a bounding box converges, and empirically we set . In our experiments we utilize these default values for all the datasets.

To accelerate the computation in EdgeRecursiveBox, we resize images into of their original sizes. The reasons for doing are based on the observations: (1) Distance transform is relatively time-consuming, whose complexity is linearly propositional to image size. (2) Proposals hardly localize small objects correctly in the original images. In other words, discarding the detections of small objects has little effect on localization quality measure (i.e. ABO and MABO). Therefore, our image resizing operation leads to marginal performance degradation but significant speed-up (see our comparison in Section 4.1).

(a) (b)
Fig. 5: Illustration of updating current red solid bounding box to next red dashed bounding box . Our estimation for the ground-truth bounding box based on succeeds in (a) where the pixels in spread well, but fails in (b) where the pixels in concentrate on few boundary fragments.

3.2 Segmentation-based Refinement

Though edges are fast to compute for approximating object boundaries, their stability is very limit. Missing boundary fragments often occur with usage of edge detection, as there is no strong contrast at such places. This will cause serious trouble to our EdgeRecursiveBox algorithm because object boundaries cannot be inferred for precise coverage. Also there is no guarantee that our estimator will approach the ground-truth bounding box eventually. Fig. 5 illustrates two simple cases where our estimation succeeds and fails, respectively, given sufficient edge information. In (a) the current bounding box is surrounded by the edge points in , implying that the pixels in are sufficiently well-spread. This improves the estimate for the ground-truth bounding box . In (b), intersects with the edge points. This leads to a situation where is determined by a small fraction of . In practice, there may be scenarios where the correct detections in BING could be updated to wrong bounding boxes.

To deal with these challenges in EdgeRecursiveBox, we further consider segments as a second type of useful cues which are usually more indicative of boundaries (even the coverage of objects) at the cost of more computational time. Meanwhile, bounding boxes always have overlaps with certain segments, making it possible to improve the boxes based on the boundaries of segments. Therefore, we propose utilizing segments as relatively slow yet strong indicators of object boundaries to refine our proposals as well.

Given a bounding box at time , the training goal of our segmentation based refinement is to learn a function (or algorithm in general) by combining segments with to generate a new box so that Eq. 12 is minimized. In test time, we apply the same function to all the bounding boxes at time for updating purpose. Letting denote the set of selected segments for updating , we formally define the new box as follows:


where denotes the set of pixel locations covered by the segments in .

In order to update bounding boxes using Eq. 16, intuitively we need to find a way to select relavent segments for . By considering this as well as minimizing Eq. 12 we have the following general optimization problem for refining boxes based on segments:

s.t. (18)

where denotes the -th new bounding box generated from the -th current bounding box in the -th image, denotes the segment set in the -th image, denotes a segment selection function to generate the selected segment set for , and denotes its feasible functional space.

Optimization: The problem in Eq. 17

, in general, can be considered as a combinatorial optimization problem

[47]. However, solving Eq. 17 with an exponential number (w.r.t. segments) of potential new boxes for each current box is extremely difficult, especially when considering computational efficiency.

Fig. 6: Statistical behavior comparison on DR/MABO vs. using VOC2007 training (top), validation (middle), and test (bottom) datasets, respectively, by minimizing Eq. 17. Here x-axis shows the indexes of all possible combinations in , and y-axis shows the performance improvement w.r.t. that with the combination used in [9].

Instead here we utilize our parameter space quantization mechanism again to reduce the complexity of our combinatorial optimization problem deliberately so that we can search for corresponding new boxes efficiently as approximate solutions. We prefer the complexity no higher than linear per box in terms of number of segments. To do so, we propose grouping segments in each image into several subsets (with overlaps) for each current bounding box and then taking one bounding box per subset which tightly covers the corresponding segments as a new bounding box. In such way, we can approximate the optimal based on the overlap function and a set of thresholds, and further rewrite Eq. 17 as follows:


where denotes a new bounding box at time parametrized by threshold in the threshold set , denotes the -th segment in the -th image, and denotes an overlap scoring function between segment and bounding box , defined as follows:


where denotes the set of pixel locations covered by the segment , denotes the set intersection operator, and denotes the set cardinality.

Now our goal is to learn . To do so, we optimize Eq. 17 with Eq. 19 using nine quantization values for , that is, from 0.1 to 0.9, step by 0.1. Then the total number of possible combinations for constructing is , which are easy to be tested on the data by minimizing Eq. 17. For instance, in order to compare the statistical behavior on localization quality (i.e. DR and MABO) using different combinations for , we show our results on VOC2007 training, validation and test datasets in Fig. 6. We can observe clearly that the statistical behaviors on both datasets are very similar, indicating that the learned threshold set may have good generalization across different datasets.

Implementation: We show our SegmentRecursiveBox algorithm for bounding box refinement in Alg. 2. The computational complexity of Alg. 2 is , roughly speaking, where denote the numbers of bounding boxes, thresholds, and segments in images, respectively.

We notice that our algorithm shares many similarities with [9] in terms of implementation. However, one of the key differences between our method and [9] is the perspective of determining the thresholds in . In [9] the parameters are fixed as by fitting the distribution of superpixel tightness with equal importance. As we see in Fig. 6, based on our objective the parameter combination in [9] is not the best, and many other parameter combinations can achieve very similar performance as [9]. In contrast our method learns these parameters discriminatively by (approximately) minimizing 0/1-loss in Eq. 17. Empirically we set by default for all the experiments.

Input : segment set , proposals , multiple thresholds
Output : improved proposals
foreach  do
        foreach  do
               Compute based on Eq. 20;
               foreach  do
                      if  then
                             Update based on Eq. 18 and Eq. 19;
                      end if
               end foreach
        end foreach
       foreach  do
        end foreach
end foreach
Algorithm 2 SegmentRecursiveBox algorithm

We employ [48] to generate segments as it can achieve good performance as well as computational efficiency. From our experiments we find that the segmentation approaches which generate segments along gradients (usually leading to larger segments) contribute significantly to the success of segmentation based box refinement algorithms such as [9]. For comparison we replace [48] with mean-shift [49] and regenerate proposals on VOC2007 test dataset. We observe slight performance degradation in such way by 1.9% and 3.8% in terms of DR and MABO, respectively. When we utilize mean-shift with a superpixel combination post-process, same as the function in openCV, our performance degrades only by 0.8% and 0.7% for DR and MABO, respectively.

As the computational complexity of [48] scales linearly with the number of input nodes in the graphs, in general, we decide to utilize “dense sampling” to generate superpixels from images as input nodes, rather than utilizing pixels directly as did in [9], to further accelerate the computation. Specifically we resize each image to pixels, and take every pixels as a cell without overlap, leading to cells to form a grid per image. We then take each cell as a superpixel and feed all the cells to [48]. In such way we observe significant speed-up with slight performance degradation (see our comparison in Section 4.1). We notice that different superpixel generation algorithms do have significant impact on the trade-off between proposal quality and computational efficiency. For instance, if utilizing gSLICr [50] to generate superpixels, we can process an image with a NVIDIA GeForce GTX 980 using about 5ms (slower than BING++’s 3ms), but achieve about 95.3% and 79.2% (better than BING++’s 93.7% and 77.5%) in terms of DR and MABO, respectively, on VOC2007 using . In this paper, however, we are not pursuing GPU acceleration in order to compare our BING++ with other algorithms in the literature fairly.

3.3 BING++ Algorithm

Overall, our proposed BING++ algorithm in Alg. 3 is essentially a sequential combination of BING, edge-based refinement as one “+”, and segmentation-based refinement as the other “+”. We set for NMS by default. BING++ retains BING’s DR performance while improving MABO with little degradation in computational time. The computational complexity of BING++ is dominated linearly by both image resolution and number of proposals.

We also test the other possibility of refining BING proposals using segments first and then edges. Compared with BING++ we observe performance degradation by 0.5% and 2.1% on VOC2007 test dataset, and 2.3% and 2.9% on COCO validation dataset, respectively, in terms of DR and MABO with 1,000 proposals and . This is understandable, because edge based refinement is too loose, leading to large deviation from the true object locations for some good proposals generated by segmentation based refinement.

Input : an input image , edge based overlap threshold , multiple thresholds , NMS parameter
Output : generic object proposals
// BING proposals
// edge based refinement (i.e. E-BING)
; ;
// segmentation based refinement (i.e. S-BING)
; ;
Algorithm 3 Test-time BING++ for object proposals

4 Experiments

We conduct comprehensive experiments to demonstrate that BING++ is extremely efficient as well as capable of generating high quality object proposals.

We test our method on the PASCAL VOC2007 [7] and Microsoft COCO [10] datasets. VOC2007 contains 20 object categories, and consists of 9,963 natural images with object labels and their corresponding ground-truth bounding boxes released for training, validation and test sets. There are 5,011 images in the training and validation datasets, in total, and 4,952 images in test dataset. We use the training dataset to train BING333In fact, BING can generalize to generic object proposals without training as shown in [51]. Here we follow the original BING implementation. with its default parameters, and test all the proposal algorithms on the test dataset. Microsoft COCO consists of 80 object categories with 82,081 images for training and 40,137 images for validation, leading to more than 2M annotated instances in total with ground-truth bounding boxes. Besides the amount of images and instances, the contents in images are more complex and challenging than those in VOC2007. On COCO we test all the proposal algorithms on the validation dataset using the same parameters as VOC2007 without any retraining.

We utilize the common intersection-over-union (IoU) overlap scoring function to measure the affinity of two bounding boxes, defined by the intersection area of two bounding boxes divided by their union. We measure our performance mainly in terms of (1) object detection recall (DR), (2) average best overlap (ABO) and mean average best overlap (MABO), and (3) computational time. We follow the PASCAL VOC challenge and use IoU overlap threshold by default for correct detection.

We compare our method with [15]444 We downloaded the proposals using either NMS or multinomial sampling. In our experiments we observed that for top 1,000 proposals NMS works better than multinomial sampling. Therefore we only reported the performance using NMS., [26]555 We run the code for [15, 26, 17, 19, 18, 20, 21, 27, 6, 8]., [17, 19, 18, 20, 21], [16]666, [27, 6, 8], [4]777, [1]888, [9]999, and [52]101010 To evaluate the DR and MABO on VOC2007 test dataset, we download the precomputed proposals for [16], [17], [15] and [9] from the corresponding authors’ websites. We use the default parameter setting for each method since they have been optimized for VOC2007, in general, expect for [20] where we utilize the parameters as highlighted at the author’s website. We utilize the evaluation code in [4, 5] for comparison. Specifically for each method we sort all the proposals based on their predicted scores in a descending order (or preserve their output orders if they do not have predicted scores) and keep at most top 1,000 proposals for computing DR and MABO. For RPN, we utilize GTX TITAN X for computation, and manage to tune the parameter in NMS to output around 1,000 proposals for comparison.

Methods DR, # Prop., DR, # Prop., MABO Time
1 10 100 1000 1 10 100 1000 (1000) (ms)
E-BING 20.2 34.1 65.8 91.3 10.8 19.9 42.8 63.7 72.5 1.7
S-BING 17.0 38.3 74.7 95.1 7.9 17.9 49.0 76.4 76.8 2.6
BING++ 17.4 42.1 75.7 93.7 8.1 20.4 51.3 77.3 77.5 2.9
E-BING 5.5 10.3 27.8 56.1 2.7 5.6 15.2 31.5 50.1 2.1
S-BING 4.8 13.8 37.5 64.8 2.3 5.8 20.6 44.2 56.9 3.0
BING++ 4.8 14.8 37.2 62.6 2.3 6.4 21.2 43.1 56.0 3.7
TABLE I: Performance comparison (%) among different BING’s derivatives.
Methods DR, # Prop., DR, # Prop., MABO Time
1 10 100 1000 1 10 100 1000 (1000) (ms)
No+No 17.5 41.6 76.9 95.0 8.3 19.2 50.8 78.8 78.0 4.2
Yes+No 17.3 41.3 76.4 94.1 8.1 17.9 49.6 77.3 77.3 5.8
No+Yes 17.3 41.9 77.6 94.5 8.2 19.3 51.4 78.7 78.1 3.6
BING++ 17.4 42.1 75.7 93.7 8.1 20.4 51.3 77.3 77.5 2.9
No+No 5.1 14.5 38.4 65.5 2.4 6.6 21.2 46.6 57.9 11.2
Yes+No 5.0 14.2 38.1 64.5 2.4 5.8 20.4 44.8 57.0 12.1
No+Yes 4.9 14.8 38.2 63.9 2.4 6.5 22.0 45.4 57.1 7.2
BING++ 4.8 14.8 37.2 62.6 2.3 6.4 21.2 43.1 56.0 3.7
TABLE II: Effect of image resize operation on performance (%) in BING++.

4.1 Comparison on Derivatives of BING

We refer to E-BING as edge based refinement (see Section 3.1), S-BING as segmentation based refinement (see Section 3.2), and BING++ as sequential refinement using edge first and then segmentation (see Section 3.3).

Fig. 7: Distributions of objects based on their BO scores and the width and height of their ground-truth bounding boxes, given the proposals from BING++ as inputs. For larger objects BING++ works better, in general.
Fig. 8: DR comparison on VOC2007 test dataset by varying the maximum number of quantized scales/aspect-ratios in BING.

We first compare the performance of different BING’s derivatives on VOC2007 test dataset and COCO validation dataset in Table I, where the timing reported for all the methods is based on multi-thread computation on our server with two INTEL XEON E5 2696v2 CPU@2.50GHz. We observe that: (1) In terms of proposal quality, BING++ works the best, and S-BING is better than E-BING. (2) In terms of computation, E-BING is more efficient than S-BING and BING++. To see the contribution of each component in Alg. 3 on the overall running time, we show the timing cost in percentage in Fig. 9. As we see, BING actually takes the largest portion of computation by 56.6%, segmentation is ranked as the second by 20.1%, and Alg. 2 for segmentation based refinement is ranked as the third by 16.0%. The extra computation for edge based refinement takes only 7.3%. The increase of timing in Table I roughly follows this distribution.

Fig. 9: Timing distribution over components in BING++.

In BING++ image resize operation plays a very important role in reducing computational time. To show its effect on performance as well as running speed, we list all the comparison in Table II, where “Yes/No” denotes with/without resize operation, the first “Yes/No” is for edge based refinement, and the second is for segmentation based refinement. In this context BING++ is equivalent to the “Yes+Yes” option. As we see here, all the four competitors perform similarly in terms of DR and MABO, especially when the number of proposals is small. This is because most of the objects with low best overlap (BO) scores are small in terms of number of pixels covered by the ground-truth bounding boxes, as shown in Fig. 7. Therefore, even ignoring small objects by resizing images has marginal effect on proposal quality for BING++, but results in significantly better computational efficiency.

Methods # Prop., # Prop., Time
1 10 100 1000 1 10 100 1000 (s)
Rahtu [16, 17] 7.0 32.7 64.7 83.5 2.5 15.8 44.7 70.1 3.81
Objectness [15] 17.3 49.5 75.8 92.0 7.4 23.4 37.6 43.1 3.83
CSVM [4] 17.4 33.5 65.1 91.2 5.4 14.8 20.8 27.1 0.47
Sel. Search [6] 9.7 37.3 71.5 93.5 4.1 19.7 49.0 80.0 10.64
Rand. Prim [18] 8.6 35.0 70.4 90.3 3.5 17.3 45.1 73.4 0.79
Endres [19] 20.9 55.2 82.8 90.1 11.5 35.0 58.0 73.0 11.67
Rantalankila [27] 0.1 0.9 16.2 85.6 0.0 0.4 8.5 67.5 23.72
GoP [20] 2.4 13.8 60.2 94.2 1.3 7.7 35.1 77.8 1.26
EdgeBox [8] 17.8 45.8 75.4 95.1 9.5 30.9 60.8 85.1 0.25
BING [1] 18.2 37.3 73.0 95.2 7.3 16.9 24.5 29.1 0.01
MCG [26] 18.5 44.2 65.7 86.5 9.4 26.9 49.1 70.1 18.97
LPO [21] 18.5 38.0 75.5 94.4 8.0 18.0 49.2 76.8 1.43
MTSE-BING [9] 14.5 37.7 75.2 95.3 7.0 18.1 47.2 78.1 0.15
RPN [52] 27.1 50.3 74.8 95.2 8.0 27.8 54.9 82.4 0.14
Rand. Uniform++ 17.3 32.3 34.3 37.6 8.0 20.9 23.3 27.0 0.01
Rand. Gaussian++ 17.2 34.8 38.2 43.0 8.0 22.8 27.0 32.1 0.01
Sliding Window++ 17.2 37.4 47.0 50.8 8.0 23.6 34.6 38.4 0.01
BING++ 17.4 42.1 75.7 93.7 8.1 20.4 51.3 77.3 0.02
TABLE III: DR (%) and running time (s) comparison on VOC2007 test dataset.
Fig. 10: Comparison of recall-overlap curves using different methods and numbers of proposals on VOC2007 test set.
Methods aer. bic. bird boat bot. bus car cat cha. cow din. dog hor. mot. per. pot. she. sofa tra. tv MABO
Rahtu [17, 16] 72.6 74.5 69.0 69.7 49.0 79.9 67.2 82.6 62.9 72.9 80.5 80.6 78.5 74.5 65.7 58.9 69.8 82.3 79.5 73.8 72.2
Objectness [15] 67.3 69.0 65.6 64.4 57.1 72.3 65.3 72.8 64.8 67.6 73.3 71.1 70.9 67.6 63.5 61.4 65.6 74.7 70.6 65.5 67.5
CSVM [4] 70.4 70.2 67.6 66.7 58.9 73.6 67.6 76.5 64.9 68.0 74.1 74.7 72.7 71.4 66.6 62.3 67.9 75.6 74.5 66.7 69.6
Sel. Search [6] 83.5 83.1 80.1 78.1 62.8 85.2 77.7 90.7 77.0 83.2 88.6 89.4 82.9 81.9 72.6 71.2 80.4 90.3 85.7 83.7 81.4
Rand. Prim [18] 80.9 80.9 74.5 74.3 59.2 83.7 76.5 87.0 74.6 79.8 87.6 85.1 79.8 81.0 70.6 67.1 72.8 89.4 82.8 80.0 78.4
Endres [19] 71.0 81.0 72.3 65.5 60.9 85.1 79.1 87.9 72.4 80.3 87.0 87.1 82.2 82.9 70.5 67.4 76.2 89.7 84.5 79.1 78.1
Rantalankila [27] 73.5 74.6 73.5 66.7 54.0 81.3 72.7 89.2 68.6 76.4 83.2 87.4 81.0 76.0 66.2 62.8 72.1 87.1 82.0 77.5 75.3
GoP [20] 73.8 80.1 76.0 72.2 63.0 86.0 80.3 88.2 75.9 81.3 85.8 85.7 79.9 79.1 73.5 71.1 78.7 88.4 82.3 82.3 79.2
EdgeBoxes [8] 76.8 81.6 78.5 76.7 65.8 83.9 76.8 82.3 76.4 82.2 80.9 83.6 81.3 80.9 73.6 71.7 80.8 82.5 79.8 81.4 78.9
BING [1] 65.5 66.0 64.0 62.3 60.6 66.5 64.4 69.9 62.6 65.1 69.5 68.3 65.9 65.7 63.8 62.4 64.6 69.0 68.6 63.4 65.4
MCG [26] 75.2 77.3 73.3 68.9 55.3 81.4 70.8 87.5 69.6 80.5 82.8 86.0 78.8 75.6 67.9 61.3 78.7 88.7 81.2 76.2 75.9
LPO [21] 74.9 79.9 76.9 72.9 61.4 86.4 80.4 89.1 74.5 82.0 85.1 86.9 82.4 81.7 73.0 71.5 79.4 88.7 85.3 81.6 79.7
MTSE-BING [9] 78.7 77.6 75.5 75.3 63.3 80.6 75.3 83.2 75.8 78.5 82.7 81.9 77.3 78.1 72.1 71.1 76.9 84.0 77.7 79.9 77.3
RPN [52] 76.8 81.9 77.6 76.4 69.1 79.5 81.8 84.4 76.0 84.2 81.5 83.9 83.5 80.7 80.6 69.8 80.3 83.5 82.0 77.2 79.5
Rand. Uniform++ 56.7 42.2 35.5 37.0 11.1 51.5 35.8 64.5 22.6 30.8 57.3 59.0 54.1 46.5 29.6 21.1 25.1 59.2 58.3 24.2 41.1
Rand. Gaussian++ 59.2 47.2 39.1 41.2 13.1 56.5 39.1 68.9 26.4 34.8 63.4 64.3 60.4 51.3 33.8 24.3 29.3 64.6 62.7 28.1 45.4
Sliding Window++ 62.0 54.6 45.5 45.2 16.1 62.2 44.5 73.7 33.7 40.9 71.1 69.3 62.6 56.2 36.4 29.0 37.1 73.0 67.0 37.1 50.9
BING++ 79.5 78.5 76.6 75.2 60.0 81.5 75.5 85.3 72.4 78.2 83.6 84.0 79.7 79.2 70.7 68.7 77.9 85.5 79.8 77.2 77.5
TABLE IV: ABO & MABO comparison (%) between different proposal algorithms on VOC2007 test dataset using 1,000 proposals.

We also test the robustness of BING++ w.r.t. the quality of BING proposals by varying the maximum number of quantized scales/aspect-ratios (i.e. 36, 121, 196) in BING to generate different proposals (see the details in [4]). We then feed all these BING proposals into the three derivatives. We show the DR comparison in Fig. 8 (for MABO we observe similar behavior for each method). As we see E-BING (as well as BING) is actually sensitive to the parameter, but S-BING and BING++ are not. This is because segments are much stronger clues to estimate object boundaries than edges, leading to robust performance.

Methods # Prop., # Prop., MABO Time
1 10 100 1000 1 10 100 1000 (s)
Rahtu [16, 17] 17.5 34.2 59.6 79.6 8.2 21.7 44.8 68.2 69.8 1.06
Sel. Search [6] 10.4 37.4 71.6 94.4 4.5 20.1 49.0 77.7 79.7 5.13
Rand. Prim [18] 10.0 39.6 69.5 71.9 3.9 20.7 48.2 53.2 65.1 0.11
Endres [19] 21.3 50.0 66.1 66.7 11.1 29.7 45.8 46.9 60.3 2.31
Rantalankila [27] 0.0 0.0 6.9 39.2 0.0 0.0 0.8 10.6 41.5 9.57
GoP [20] 1.0 5.6 36.7 89.2 0.5 2.2 17.2 66.5 73.9 0.69
EdgeBox [8] 18.6 39.2 64.1 80.9 8.0 22.6 46.1 65.0 67.9 0.09
MCG [26] 20.2 51.9 77.0 91.4 10.3 27.6 53.0 74.3 78.8 4.55
LPO [21] 17.6 37.3 70.3 89.5 7.2 16.5 43.5 68.8 75.5 1.09
RPN [52] 22.0 40.8 58.6 82.7 5.6 19.6 40.7 67.7 70.6 0.15
BING++ 17.4 42.1 75.7 93.7 8.1 20.4 51.3 77.3 77.5 0.02
TABLE V: DR (%), MABO (%) and running time (s) comparison on VOC2007 test dataset with images resized to of their original sizes.
Methods # Prop., # Prop., MABO Time
1 10 100 1000 1 10 100 1000 (s)
Rahtu [16, 17] 18.5 34.0 62.4 82.9 8.7 21.3 45.8 70.2 71.5 2.34
Sel. Search [6] 10.4 37.6 72.3 95.1 4.2 20.3 50.3 79.8 81.3 6.68
Rand. Prim [18] 9.0 35.0 71.0 89.6 3.8 17.8 46.8 72.6 77.9 0.56
Endres [19] 21.6 55.0 82.3 89.7 11.9 34.7 58.2 72.2 77.5 9.50
Rantalankila [27] 0.0 0.1 2.5 56.8 0.0 0.0 0.3 25.7 52.84 12.0
GoP [20] 2.3 14.8 61.7 93.9 1.2 7.6 36.4 76.5 78.6 1.32
EdgeBox [8] 19.7 41.1 66.9 90.0 8.6 24.7 50.5 74.9 73.5 0.16
MCG [26] 17.9 52.1 82.6 95.3 9.8 29.3 59.9 81.9 82.7 16.47
LPO [21] 18.4 38.3 74.7 88.5 8.1 18.3 48.2 67.7 75.4 2.26
RPN [52] 28.6 50.2 74.5 94.9 10.2 29.8 54.7 81.8 79.7 0.13
BING++ 17.4 42.1 75.7 93.7 8.1 20.4 51.3 77.3 77.5 0.02
TABLE VI: DR (%), MABO (%) and running time (s) comparison on VOC2007 test dataset with images resized to pixels.

4.2 Benchmark Comparison (I): VOC2007

We first compare our BING++ with other proposal algorithms using DR vs. IoU overlap threshold in Fig. 10. We also implement three other baseline methods by replacing BING proposals in BING++ with bounding boxes sampled by (1) Random Uniform, (2) Random Gaussian, or (3) Sliding Window111111We used the published code at for [37] to sample 1,000 proposals.. These sampling methods have ignorable running time, leading to faster speed than BING++, as shown in Table III, yet much worse proposal quality. Overall, our BING++ behaves similarly to many other competitive proposal algorithms such as selective search, edgeBoxes, and GoP, especially when the number of proposals is sufficiently large (e.g. 100 or 1,000). Note that when the proposals are sufficient, there are significant performance gaps between BING and our BING++, indicating that BING++ achieves huge improvement on DR over BING.

To quantify these plots, we list the corresponding numbers as well as the average single-thread computational time of each method in Table III, which are called from MATLAB, except RPN. In both cases with IoU threshold equal to 0.5 or 0.7, BING++ can always achieve similar performance to the best ones. However, it is quite notable that BING++ is much faster than other competitive proposal algorithms. For instance, BING++ is 500 times faster than selective search. Also by comparing BING++ with BING using IoU threshold equal to 0.7 and 1000 proposals, there is huge improvement again from 29.1% to 77.3%. This well demonstrates the capability of BING++ for generating high quality object proposals.

Methods (# Proposals) aer. bic. bird boat bot. bus car cat cha. cow din. dog hor. mot. per. pot. she. sofa tra. tv mAP
Objectness [15] (1,000) 61.1 64.9 54.0 38.1 25.6 71.8 69.5 75.7 29.7 66.0 57.3 68.2 76.8 61.9 51.4 19.4 51.2 53.9 65.3 59.9 56.1
Sel. Search [6] (999) 71.9 78.3 68.2 53.6 35.4 78.9 75.5 85.6 42.4 75.7 70.0 80.5 82.9 72.5 66.3 35.0 68.4 66.9 77.9 68.4 67.7
Rand. Prim[18] (852) 76.2 79.0 63.0 54.8 30.1 80.9 72.2 84.6 39.5 73.5 70.1 77.2 80.6 72.4 64.1 28.3 59.3 69.5 75.8, 66.5 65.9
Endres [19] (830) 66.9 76.2 67.2 47.8 33.4 80.8 75.0 84.3 36.5 71.6 68.0 78.1 77.9 71.7 63.7 27.6 63.7 69.8 76.2 67.3 65.2
Rantalankila [27] (856) 68.1 70.2 64.3 49.0 27.2 78.6 69.8 82.4 33.1 71.4 67.0 79.7 78.3 69.1 58.9 26.0 61.9 65.4 76.9 65.8 63.2
GoP [20] (992) 66.8 80.6 68.6 50.9 36.4 82.7 80.6 85.6 39.3 74.4 70.9 82.2 86.2 78.9 68.2 29.9 66.4 69.5 74.7 69.7 68.1
EdgeBoxes [8] (991) 64.2 79.2 66.8 53.6 38.0 83.8 78.4 84.4 40.1 78.3 65.5 81.9 83.3 76.5 69.6 34.3 69.5 65.1 73.0 67.6 67.7
BING [1] (1,000) 56.7 63.1 55.3 37.4 34.8 70.6 69.9 70.6 27.7 61.7 45.6 63.5 72.5 62.9 57.5 21.8 52.0 46.8 64.9 57.1 54.6
LPO [21](823) 66.7 81.9 68.4 52.5 33.5 81.7 78.4 85.9 40.5 76.4 67.6 81.5 85.7 74.4 68.1 34.7 67.6 66.4 74.6 67.9 67.7
MCG (1,000) [26] 67.0 74.0 64.9 49.9 32.5 77.4 64.9 83.7 34.9 72.1 69.9 78.5 78.0 69.4 60.5 28.8 64.2 67.5 76.4 64.2 63.9
MTSE-BING [9] (996) 70.1 80.6 65.5 54.0 36.7 81.7 79.3 84.6 40.1 78.2 64.2 79.5 84.2 76.8 69.1 33.8 67.2 67.5 73.5 67.9 67.7
RPN [52] 68.6 78.9 67.4 54.9 52.4 75.2 79.7 79.1 49.5 75.5 66.5 76.6 80.9 77.2 77.4 41.7 68.2 64.1 72.8 72.4 69.0
No + No (1,000) 69.8 75.9 67.5 53.7 38.2 78.6 76.3 82.6 41.1 74.6 65.7 79.0 83.3 75.9 66.8 35.3 65.1 66.0 72.1 65.0 66.6
Yes + No (1,000) 67.0 75.1 65.1 53.7 36.9 81.7 75.7 82.7 40.2 72.8 64.7 79.6 81.3 75.4 66.2 34.2 66.2 65.6 72.6 64.6 66.1
No + Yes (1,000) 68.9 75.4 63.9 53.3 36.2 77.9 76.9 83.0 38.5 74.9 65.2 75.3 81.9 74.8 65.9 34.5 68.5 65.8 69.0 66.1 65.8
BING++ (1,000) 66.3 75.4 65.1 52.7 35.8 79.5 75.8 80.5 40.8 72.5 66.3 75.7 81.5 73.7 65.6 35.0 63.4 63.4 74.7 64.2 65.4
TABLE VII: AP & mAP comparison (%) for object detection using fast R-CNN on VOC2007 test dataset with 1,000 proposals with IoU threshold 0.5.
(a) (b)
Fig. 11: Comparison of DR vs. number of proposals on VOC2007 test dataset (a) and MS COCO validation dataset (b), respectively.
(a) BING++ (b) BING (c) EdgeBoxes (d) LPO (e) MTSE-BING (f) Selective Search
Fig. 12: Illustration of detection results on VOC2007 test dataset for some comparative algorithms using classes of (top) bottle, (middle) potted plants, and (bottom) bicycle. In each image, we show top-5 detections for the class, colored by red, green, blue, cyan, and yellow.

In order to understand the effect of image down-sampling on performance of different competitors, we resize the images to either of their original sizes (used in edge-based refinement in BING++) or the fixed size of pixels (used in segmentation-based refinement in BING++), respectively, and repeat the same experiments in Table III and Table IV using the default parameters for each algorithm without fine-tuning. The results are listed in Table V and Table VI, respectively. As we see: (1) Among the comparison our BING++ is still the fastest as well as achieving comparable performance with the state-of-the-art. (2) The running time of RPN is quite similar in various experiments, because images are rescaled to the same size as inputs to the neural network. (3) For the rest of competitors, generally speaking, the running time is improved, and the smaller the images are, the faster the methods can run. However, the DR and MABO become worse, in general. In Table V even if EdgeBox can run 4.5 times slower than BING++, its DRs are 12.8% (with and 1,000 proposals) and 12.3% (with and 1,000 proposals) lower than those of BING++, and its MABO is 9.6% lower than that of BING++.

Next we show the comparison of DR vs. number of proposals in Fig. 11(a). Clearly with , BING++ performs among the top, which is consistent with Table III. We also list our ABO and MABO comparison in Table IV. Still BING++ performs consistently close to the best performance among the competitors and finally achieves 77.5% MABO, only 3.9% smaller than selective search. As shown in [8], considering overall achievement this small difference is negligible in terms of proposal quality.

We also conduct the object detection task to measure the impact of DR, ABO and MABO of proposals on real applications, and list the results in Table VII. We run different algorithms to generate proposals and feed them to fast R-CNN [35] with pre-trained VGG-16 model [53] to perform detection. In terms of mean average precision (mAP), the overall detection performance of each competitive proposal algorithm is quite close to each other, i.e. selective search, GoP, EdgeBoxes, LPO, MTSE-BING, BING++ and its siblings. Also the average precision (AP) for each class from BING++ is close to the best performance among the competitors. We emphasize that the running time of BING++ is about 3ms per image only using CPUs on our server, which is much faster than any of the existing competitive proposal algorithms with good quality.

To better view the difference between different proposal algorithms for object detection, we illustrate some results in Fig. 12. Compared with BING, our BING++ produces more reasonable detections. Interestingly, the focuses of all the comparative algorithms are very similar even in such complex images, while the predicted bounding boxes vary.

4.3 Benchmark Comparison (II): Microsoft COCO

Fig. 13: Comparison of recall-overlap curves using different methods and numbers of proposals on MS COCO validation set.

Recall that on COCO for all the methods we keep using the same (predefined or learned) parameters as those on VOC2007 without any retraining. Because there are at least 60 different object classes between the two datasets, in such way we can compare the generalization ability of different methods for the purpose of generic object proposals across different object classes/datasets.

As on VOC2007, we first compare different algorithms using DR vs. IoU overlap threshold in Fig. 13. Due to the large size of the dataset, here we only compare several relatively efficient algorithms. Again BING++ performs reasonably well among the top for all the cases. Interestingly EdgeBoxes seems to struggle on COCO. One possible reason is that images in COCO are more complex than those in VOC2007, in general, leading to noisy/missing edges which confuse EdgeBoxes. Another possible reason is that EdgeBoxes is quite sensitive to its parameters, and we need to re-tune its parameters using training data in COCO. Similarly the pre-trained RPN using VOC2007 data does not work well on COCO, indicating that the RPN method is not suitable for the purpose of generic object proposal generation as it is sensitive to the parameters. However, our BING++ is more robust to parameter settings. We list in Table VIII the corresponding numbers in Fig. 13 as well as MABO for numerical comparison. Note that compared with BING, both DR and MABO of BING++ are boosted significantly. Also in Fig. 11(b) we show the behavior of different algorithms using DR vs. number of proposals where BING++ performs slightly worse. We speculate that this is because a large portion of small objects occurring in COCO worsen the performance, as we show in Fig. 7. Using 1,000 proposals the BING++ performs inferiorly to the best (i.e. MCG), but with about 1,000 times faster.

Methods # Prop., # Prop., MABO
1 10 100 1000 1 10 100 1000 (1000)
Sel. Search [6] 3.1 14.0 37.4 65.8 1.3 7.0 23.0 49.2 60.8
Rand. Prim [18] 2.9 13.6 38.7 67.7 1.2 6.6 22.8 47.7 61.8
Endres [19] 6.6 22.5 49.2 67.1 3.8 13.8 31.6 49.8 61.0
GoP [20] 1.9 11.5 41.4 65.7 1.4 7.3 24.9 47.8 59.2
EdgeBox [8] 5.5 13.9 29.5 55.0 2.4 7.6 19.0 39.6 50.0
BING [1] 4.5 11.9 28.8 56.7 0.7 2.1 4.3 7.6 48.0
MCG [26] 6.6 24.4 49.0 70.9 3.9 14.6 33.1 51.5 64.8
LPO [21] 5.6 15.1 41.8 68.4 2.5 7.1 24.6 48.2 61.3
MTSE-BING [9] 4.9 13.9 37.3 65.7 2.3 6.0 20.1 46.5 58.0
RPN [52] 2.9 8.4 18.5 38.1 0.3 1.8 6.7 18.7 25.4
BING++ 4.8 14.8 37.2 62.6 2.3 6.4 21.2 43.1 56.0
TABLE VIII: DR and MABO comparison (%) on COCO validation dataset using the same (learned) parameters on VOC2007 for each method.
(a) (b)
Fig. 14: (a) AP and (b) mAP comparison for object detection on COCO validation dataset.

We also show the AP and mAP scores for object detection on COCO validation dataset in Fig. 14 using fast R-CNN with pre-trained VGG-16 model. Different from VOC2007, all the methods on AP in Fig. 14(a) behave similarly with marginal gaps. In terms of mAP shown in Fig. 14(b) BING++ performs comparably with the best method (i.e. selective search) with difference of 1.6%. Interestingly MCG, the best method in Table VIII, performs slightly worse than selective search, but better than BING++ with margin of 0.6%. LPO is better than BING++ in terms of MABO in Table VIII, but worse in terms of mAP. These observations suggest that there is no clear positive correlation between proposal quality and detection performance, but in general better proposal quality will probably lead to better detection performance.

5 Conclusion

In this paper, we propose a novel object proposal algorithm, BING++, for generating high quality proposals efficiently based on BING. BING is a simple and fast object proposal algorithm with only a few atomic (e.g. add, bitwise, etc.) operations for scoring each window in images. However, as we examined in Fig. 2 and Fig. 3, the proposal localization quality generated by BING is not satisfactory, on average.

Our BING++ algorithm essentially improves the proposal quality of BING significantly as well as preserves its high computational efficiency. BING++ consists of three components sequentially: (1) BING algorithm, (2) a novel EdgeRecursiveBox algorithm, (3) another novel SegmentRecursiveBox algorithm, where (2) and (3) manage to adapt the BING proposals to object boundaries. We leverage the facts that edges/segments in images can be used to approximate object boundaries, and the ground-truth bounding boxes should cover the entire objects as tightly as possible. Based on these considerations, we propose estimating ground-truth bounding boxes in a recursive way using nearest edge points first and then segments, based on which we update the proposals to the ones that cover the sets of pixels of nearest edges or segments tightly.

Fundamentally our RecursiveBox algorithm essentially tries to solve a sequential minimization problem with 0/1-loss function for object proposal generation. Due to high non-convexity of our problem, we propose a novel parameter space quantization algorithm as a solver to exhaustively search for an approximate solution. Comprehensive experiments on VOC2007 and Microsoft COCO have demonstrated the effectiveness and efficiency of our algorithm, making BING++ among the top object proposal generation algorithms with achievement of better trade-off between proposal quality and computational efficiency in the literature.

As BING++ predicts a small set of object bounding boxes based on edge and segmentation information, it may suffer similar limitations as other edge or segmentation based proposal algorithms (see proposal repeatability section in [37]). However, empirically these two types of information are actually working complementarily against the drawbacks of each other, resulting in better proposals in terms of localization/detection quality as we demonstrated in our comprehensive comparison.

The major limitation of BING++ is that it works inferiorly with small objects sometimes, as we show in Fig. 7. This is probably because BING cannot generate reasonably good proposals to cover these small objects, or no edges or segments are produced for them, leading to the failure cases. Recently this problem of small object proposal generation has attracted the attention of researchers [54], and it will be one of our future works to further improve proposal quality as well as preserving computational efficiency.

Our BING++ could be one possible solution (partially) to the computational bottleneck in real-time object detection with thousands of object categories by efficiently reducing the number of bounding boxes as proposals that are needed to be verified. Another effort could be reducing the classification complexity such as [55]. It would be very interesting to explore the integration of BING++ with such methods for detection in the future. Because of the high efficiency of BING++, it is also desirable in many video applications such as person re-identification [56, 57], video event detection [58]

, and weakly supervised learning

[59]. We will explore such applications in the future as well.


We thank Tolga Bolukbasi from Boston University for helping to prepare some of experimental results.


  • [1] M.-M. Cheng, Z. Zhang, W.-Y. Lin, and P. H. S. Torr, “BING: Binarized normed gradients for objectness estimation at 300fps,” in CVPR, 2014.
  • [2] Y. Wei, W. Xia, J. Huang, B. Ni, J. Dong, Y. Zhao, and S. Yan, “Cnn: Single-label to multi-label,” arXiv preprint arXiv:1406.5726, 2014.
  • [3] R. Girshick, J. Donahue, T. Darrell, and J. Malik, “Rich feature hierarchies for accurate object detection and semantic segmentation,” in CVPR.    IEEE, 2014, pp. 580–587.
  • [4] Z. Zhang, J. Warrell, and P. H. Torr, “Proposal generation for object detection using cascaded ranking svms,” in CVPR, 2011, pp. 1497–1504.
  • [5] Z. Zhang and P. H. Torr, “Object proposal generation using two-stage cascade svms,” TPAMI, vol. 38, no. 1, pp. 102–115, 2016.
  • [6] J. Uijlings, K. van de Sande, T. Gevers, and A. Smeulders, “Selective search for object recognition,” IJCV, 2013.
  • [7] M. Everingham, L. Van Gool, C. K. I. Williams, J. Winn, and A. Zisserman, “The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results,”
  • [8] C. L. Zitnick and P. Dollár, “Edge boxes: Locating object proposals from edges,” in ECCV, 2014.
  • [9] X. Chen, H. Ma, X. Wang, and Z. Zhao, “Improving object proposals with multi-thresholding straddling expansion,” in CVPR, 2015.
  • [10] T.-Y. Lin, M. Maire, S. Belongie, J. Hays, P. Perona, D. Ramanan, P. Dollár, and C. L. Zitnick, “Microsoft coco: Common objects in context,” in ECCV, 2014, pp. 740–755.
  • [11] D. A. Forsyth, J. Malik, M. M. Fleck, H. Greenspan, T. Leung, S. Belongie, C. Carson, and C. Bregler, Finding pictures of objects in large collections of images.    Springer, 1996.
  • [12] H. Teuber, “Physiological psychology,” Annual Review of Psychology, vol. 6, no. 1, pp. 267–296, 1955.
  • [13] S. Hare, A. Saffari, and P. H. Torr, “Efficient online structured output learning for keypoint-based object tracking,” in CVPR, 2012, pp. 1894–1901.
  • [14] S. Zheng, P. Sturgess, and P. H. S. Torr, “Approximate structured output learning for constrained local models with application to real-time facial feature detection and tracking on low-power devices,” in IEEE FG, 2013.
  • [15] B. Alexe, T. Deselaers, and V. Ferrari, “Measuring the objectness of image windows,” PAMI, 2012.
  • [16] E. Rahtu, J. Kannala, and M. Blaschko, “Learning a category independent object detection cascade,” in ICCV, 2011.
  • [17] M. B. Blaschko, J. Kannala, and E. Rahtu, “Non maximal suppression in cascaded ranking models,” in Image Analysis, ser. Lecture Notes in Computer Science, J.-K. Kämäräinen and M. Koskela, Eds.    Springer, 2013, vol. 7944, pp. 408–419.
  • [18] S. Manén, M. Guillaumin, and L. Van Gool, “Prime Object Proposals with Randomized Prim’s Algorithm,” in ICCV, Dec. 2013.
  • [19] I. Endres and D. Hoiem, “Category-independent object proposals with diverse ranking,” IEEE TPAMI, vol. 36, no. 2, pp. 222–234, 2014.
  • [20] P. Krähenbühl and V. Koltun, “Geodesic object proposals,” in ECCV, 2014, pp. 725–739.
  • [21] P. Krähenbühl and V. Koltun, “Learning to propose objects,” in CVPR, 2015.
  • [22] J. Carreira and C. Sminchisescu, “CPMC: Automatic Object Segmentation Using Constrained Parametric Min-Cuts,” IEEE TPAMI, vol. 34, no. 7, pp. 1312–1328, 2012.
  • [23] A. Humayun, F. Li, and J. M. Rehg, “The middle child problem: Revisiting parametric min-cut and seeds for object proposals,” in ICCV, 2015.
  • [24] ——, “RIGOR: Reusing Inference in Graph Cuts for generating Object Regions,” in CVPR, june 2014.
  • [25] T. Lee, S. Fidler, and S. Dickinson, “Learning to combine mid-level cues for object proposal generation,” in ICCV, 2015.
  • [26] P. Arbeláez, J. Pont-Tuset, J. Barron, F. Marques, and J. Malik, “Multiscale combinatorial grouping,” in CVPR, 2014.
  • [27] P. Rantalankila, J. Kannala, and E. Rahtu, “Generating object segmentation proposals using global and local search,” in CVPR, 2014, pp. 2417–2424.
  • [28] C. Wang, L. Zhao, S. Liang, L. Zhang, J. Jia, and Y. Wei, “Object proposal by multi-branch hierarchical segmentation.”
  • [29] V. Yanulevskaya, J. Uijlings, and N. Sebe, “Learning to group objects,” in CVPR, 2014.
  • [30] Y. Xiao, C. Lu, E. Tsougenis, Y. Lu, and C.-K. Tang, “Complexity-adaptive distance metric for object proposals generation,” in CVPR, 2015.
  • [31] Q. Zhao, Z. Liu, and B. Yin, “Cracking bing and beyond,” in BMVC, 2014.
  • [32] C. Lu, S. Liu, J. Jia, and C.-K. Tang, “Contour box: Rejecting object proposals without explicit closed contours,” in ICCV, 2015.
  • [33] Y. Qi, Y.-Z. Song, T. Xiang, H. Zhang, T. Hospedales, Y. Li, and J. Guo, “Making better use of edges via perceptual grouping,” in CVPR, 2015.
  • [34] A. Ghodrati, A. Diba, M. Pedersoli, T. Tuytelaars, and L. Van Gool, “Deepproposal: Hunting objects by cascading deep convolutional layers,” in ICCV, 2015, pp. 2578–2586.
  • [35] R. Girshick, “Fast r-cnn,” in CVPR, 2015, pp. 1440–1448.
  • [36] S. He and R. W. Lau, “Oriented object proposals,” in ICCV, 2015.
  • [37] J. Hosang, R. Benenson, P. Dollár, and B. Schiele, “What makes for effective detection proposals?” PAMI, 2015.
  • [38] S. Nowozin, “Optimal decisions from probabilistic models: the intersection-over-union case,” in CVPR, 2014, pp. 548–555.
  • [39] F. Ahmed, D. Tarlow, and D. Batra, “Optimizing expected intersection-over-union with candidate-constrained crfs,” in ICCV, 2015, pp. 1850–1858.
  • [40] Y. Cheng, F. X. Yu, R. S. Feris, S. Kumar, A. Choudhary, and S.-F. Chang, “An exploration of parameter redundancy in deep networks with circulant projections,” in Proceedings of the IEEE International Conference on Computer Vision, 2015, pp. 2857–2865.
  • [41] Z. Zhang, Efficient Object Detection Via Structured Learning and Local Classifiers.    Oxford Brookes University, 2013. [Online]. Available:
  • [42] P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik, “Contour detection and hierarchical image segmentation,” PAMI, vol. 33, no. 5, pp. 898–916, 2011.
  • [43] P. Dollar, Z. Tu, and S. Belongie, “Supervised learning of edges and object boundaries,” in CVPR, vol. 2, 2006, pp. 1964–1971.
  • [44] D. R. Martin, C. C. Fowlkes, and J. Malik, “Learning to detect natural image boundaries using local brightness, color, and texture cues,” PAMI, vol. 26, no. 5, pp. 530–549, 2004.
  • [45] P. F. Felzenszwalb and D. P. Huttenlocher, “Distance transforms of sampled functions.” Theory of Computing, vol. 8, no. 1, pp. 415–428, 2012.
  • [46] P. Dollár and C. L. Zitnick, “Structured forests for fast edge detection,” in Computer Vision (ICCV), 2013 IEEE International Conference on.    IEEE, 2013, pp. 1841–1848.
  • [47] W. Cook, W. Cunningham, W. Pulleyblank, and A. Schrijver, “Combinatorial optimization,” Wiley-Interscience Series in Discrete Mathematics and Optimization, pp. 1–365, 1998.
  • [48] P. F. Felzenszwalb and D. P. Huttenlocher, “Efficient graph-based image segmentation,” IJCV, vol. 59, no. 2, pp. 167–181, Sep. 2004.
  • [49] D. Comaniciu and P. Meer, “Mean shift: A robust approach toward feature space analysis,” PAMI, vol. 24, no. 5, pp. 603–619, 2002.
  • [50] C. Y. Ren, V. A. Prisacariu, and I. D. Reid, “gSLICr: SLIC superpixels at over 250Hz,” ArXiv e-prints, Sep. 2015.
  • [51] J. Hosang, R. Benenson, and B. Schiele, “How good are detection proposals, really?” in BMVC, 2014.
  • [52] S. Ren, K. He, R. Girshick, and J. Sun, “Faster r-cnn: Towards real-time object detection with region proposal networks,” in NIPS, 2015, pp. 91–99.
  • [53] K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” arXiv preprint arXiv:1409.1556, 2014.
  • [54] Z. Jie, X. Liang, J. Feng, W. F. Lu, E. H. F. Tay, and S. Yan, “Scale-aware pixel-wise object proposal networks,” arXiv preprint arXiv:1601.04798, 2016.
  • [55] T. Dean, M. Ruzon, M. Segal, J. Shlens, S. Vijayanarasimhan, and J. Yagnik, “Fast, accurate detection of 100,000 object classes on a single machine,” in CVPR, 2013, pp. 1814–1821.
  • [56] Z. Zhang, Y. Chen, and V. Saligrama, “A novel visual word co-occurrence model for person re-identification,” in ECCV Workshop on Visual Surveillance and Re-Identification, 2014.
  • [57] ——, “Group membership prediction,” in ICCV, 2015, pp. 3916–3924.
  • [58] G. D. Castanon, Y. Chen, Z. Zhang, and V. Saligrama, “Efficient activity retrieval through semantic graph queries,” in ACM Multimedia, 2015.
  • [59] D. Li, J.-B. Huang, Y. Li, S. Wang, and M.-H. Yang, “Weakly supervised object localization with progressive domain adaptation,” in CVPR, 2016.