Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection

Abstract

Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints. In this paper, we address this problem from a view which utilizes multiple instances to represent the variations in multiple instance learning (MIL) framework. Specifically, logistic multiple instance boost (LMIBoost) is advocated to learn the pedestrian appearance model. To efficiently use the histogram feature, we propose the graph embedding based decision stump for the data with non-Gaussian distribution. First the topology structure of the examples are carefully designed to keep between-class far and within-class close. Second, K-means algorithm is adopted to fast locate the multiple decision planes for the weak classifier. Experiments show the improved accuracy of the proposed approach in comparison with existing pedestrian detection methods, on two public test sets: INRIA and VOC2006’s person detection subtask [1].

Cite

Text

Pang et al. "Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection." European Conference on Computer Vision, 2008. doi:10.1007/978-3-540-88693-8_40

Markdown

[Pang et al. "Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection." European Conference on Computer Vision, 2008.](https://mlanthology.org/eccv/2008/pang2008eccv-multiple/) doi:10.1007/978-3-540-88693-8_40

BibTeX

@inproceedings{pang2008eccv-multiple,
  title     = {{Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection}},
  author    = {Pang, Junbiao and Huang, Qingming and Jiang, Shuqiang},
  booktitle = {European Conference on Computer Vision},
  year      = {2008},
  pages     = {541-552},
  doi       = {10.1007/978-3-540-88693-8_40},
  url       = {https://mlanthology.org/eccv/2008/pang2008eccv-multiple/}
}