’ Histograms of Oriented Gradients for Human Detection ’ versus ’ Fast Human Detection Using a Cascade of Histograms of Oriented Gradients
’ Histograms of Oriented Gradients for Human Detection ’ versus ’ Fast Human Detection Using a Cascade of Histograms of Oriented Gradients
复制标题
DOI:
--
复制
发表时间:
2007
期刊:
影响因子:
--
通讯作者:
Qiang Zhu;Mei-Chen Yeh;K. Cheng;S. Avidan
中科院分区:
文献类型:
--
作者:
Qiang Zhu;Mei-Chen Yeh;K. Cheng;S. Avidan
Dalal and Triggs [1] studied the question of feature sets for robust visual object recognition. They first considered existing edge and gradient based descriptors and then they showed experimentally that grids of Histograms of Oriented Gradients (HoG) descriptors significantly outperform existing feature sets for human detection. After this they studied the influence of each stage of the computation with reference to performance. They finally came to the conclusion that fine scale gradients, fine orientation binning, relatively coarse spatial binning, and high quality local contrast normalization in overlapping descriptor blocks were important to get good results. Their detector reached nearly perfect results on the original MIT pedestrian database, so they produced a more challenging dataset called INRIA which contained extremely complicated backgrounds and dramatic illumination changes. Qiang Zhu, Shai Avidan, Mei-Chen Yeh, and Kwang-Ting Cheng [2] then showed that the combination of the cascade of rejectors approach and the HoG features led to a fast and accurate human detection system. The features were HoGs with variable block-size. To select the best blocks for the detection, from a larger set of possible blocks, AdaBoost (short for Adaptive Boosting) was used. Furthermore, the integral image representation was used and the rejection cascade significantly speeded up the computation.