Performance testing and functional limitations of Normalized Autobinomial Markov Channels

The field of pedestrian detection has gained momentum in recent years, due to a large range of applications, including advanced robotics, aided surveillance and automotive safety. Its importance in the field of computer vision is confirmed by the large number of available algorithms, as well as the increased complexity of the public databases used for testing. To comply with the increased demands of the field, we perform extensive performance testing of the proposed Normalized Autobinomial Markov Channels (NAMC) algorithm using the Caltech Pedestrian Dataset. The proposed solution aims at isolating easily distinguishable body characteristics by learning contextual probabilistic dependencies. The functional limitations of the algorithm are derived by separately analyzing three test scenarios: scale, occlusion, aspect ratio. The obtained results demonstrate the efficiency of our approach, especially in the case of heavy occlusions, where the algorithm ranks first among the tested state-of-the art solutions.

[1]  Luc Van Gool,et al.  Handling Occlusions with Franken-Classifiers , 2013, 2013 IEEE International Conference on Computer Vision.

[2]  DollarPiotr,et al.  Fast Feature Pyramids for Object Detection , 2014 .

[3]  Pietro Perona,et al.  Integral Channel Features , 2009, BMVC.

[4]  Bill Triggs,et al.  Histograms of oriented gradients for human detection , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[5]  Fatih Murat Porikli,et al.  Pedestrian Detection via Classification on Riemannian Manifolds , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Joon Hee Han,et al.  Local Decorrelation For Improved Pedestrian Detection , 2014, NIPS.

[7]  David Vázquez,et al.  Random Forests of Local Experts for Pedestrian Detection , 2013, 2013 IEEE International Conference on Computer Vision.

[8]  Dan Levi,et al.  Fast Multiple-Part Based Object Detection Using KD-Ferns , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[9]  Bernt Schiele,et al.  Ten Years of Pedestrian Detection, What Have We Learned? , 2014, ECCV Workshops.

[10]  Armin B. Cremers,et al.  Informed Haar-Like Features Improve Pedestrian Detection , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[11]  Mihai Ciuc,et al.  Normalized Autobinomial Markov Channels For Pedestrian Detection , 2015, BMVC.

[12]  Anton van den Hengel,et al.  Strengthening the Effectiveness of Pedestrian Detection with Spatially Pooled Features , 2014, ECCV.

[13]  Charless C. Fowlkes,et al.  Multiresolution Models for Object Detection , 2010, ECCV.

[14]  Xiaogang Wang,et al.  A discriminative deep model for pedestrian detection with occlusion handling , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[15]  Zhuowen Tu,et al.  Probabilistic boosting-tree: learning discriminative models for classification, recognition, and clustering , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[16]  Shengcai Liao,et al.  Robust Multi-resolution Pedestrian Detection in Traffic Scenes , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[17]  Luc Van Gool,et al.  Seeking the Strongest Rigid Detector , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[18]  David A. McAllester,et al.  Object Detection with Discriminatively Trained Part Based Models , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Paul A. Viola,et al.  Detecting Pedestrians Using Patterns of Motion and Appearance , 2005, International Journal of Computer Vision.

[20]  Pietro Perona,et al.  The Fastest Pedestrian Detector in the West , 2010, BMVC.