Fast Extraction of Pedestrian Candidate Windows Based on BING Algorithm

• Published in: Journal of Multimedia Information System Vol. 6; no. 1; pp. 1 - 6
• Main Authors: Zeng, Jiexian, Fang, Qi, Wu, Zhe, Fu, Xiang, Leng, Lu
• Format: Journal Article
• Language: English
• Published: 한국멀티미디어학회 31.03.2019
• Subjects: 컴퓨터학
• ISSN: 2383-7632; 2383-7632
• DOI: 10.33851/JMIS.2019.6.1.1

In the field of industrial applications, the real-time performance of the target detection problem is very important. The most serious time consumption in the pedestrian detection process is the extraction phase of the candidate window. To accelerate the speed, in this paper, a fast extraction of pedestrian candidate window based on the BING (Binarized Normed Gradients) algorithm replaces the traditional sliding window scanning. The BING features are extracted with the positive and negative samples and input into the two-stage SVM (Support Vector Machine) classifier for training. The obtained BING template may include a pedestrian candidate window. The trained template is loaded during detection, and the extracted candidate windows are input into the classifier. The experimental results show that the proposed method can extract fewer candidate window and has a higher recall rate with more rapid speed than the traditional sliding window detection method, so the method improves the detection speed while maintaining the detection accuracy. In addition, the real-time requirement is satisfied. KCI Citation Count: 0