{'fraction_non_alphanumeric': 0.03992901508429459, 'fraction_numerical': 0.00709849157054126, 'mean_word_length': 5.266666666666667, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Abing: Adjusted Binarized Normed Gradients for objectness measure

Objectness measure, which generates some candidate object proposals, has been shown to accelerate the traditional sliding window category-dependent object detection methods. Binarized Normed Gradients (BING) is one of the state-of-the-art detectors. It achieves high object detection rate (DR), but moderate object overlap rate (OR) because the candidate proposals produced by BING are fixed-sized. In this paper, we propose a novel objectness detector, named as ABING (Adjusted Binarized Normed Gradients). It adjusts the fixed-sized proposals produced by BING, which can be accelerated by heap sort NMS (HS-NMS), and yields variable-sized ones by effectively exploiting Top Border None Object Boundary (TBNOB) principle and superpixel line integral (LI) cue. In experiments on the challenging PASCAL VOC 2007 dataset, we show that our ABING detector can consistently outperform BING with any number of proposals. Moreover, with well-chosen parameters, ABING can markedly enhance the DR and OR of BING with a certain number of proposals (e.g. 1000 proposals).