模式识别与人工智能
Friday, Apr. 11, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2017, Vol. 30 Issue (7): 588-587    DOI: 10.16451/j.cnki.issn1003-6059.201707002
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Pedestrian Detection on Videos Based on Graph Cuts and Density Clustering
ZENG Chengbin, LIU Jiqian
School of Electrical and Information Engineering, Guizhou Institute of Technology, Guiyang 550003

Download: PDF (1400 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  In the existing pedestrian detection algorithms, the pedestrian detection is considered as a supervised learning problem of two classes, pedestrian and background. Thus, the pedestrian and the background in the video are distinguished. However, the problem of variable poses and heavy occlusion can not be solved by these algorithms effectively. In this paper, a pedestrian detection algorithm based on graph cuts and density clustering is proposed. The pedestrian detection is regarded as an unsupervised learning problem of multiple classes. At the training stage, the multilevel histogram of oriented gradient-local binary pattern(HOG-LBP) features are firstly calculated for each of training samples. Then, different weights are assigned to each image block of the multilevel HOG-LBP features. To distinguish the different parts of pedestrian and assign weight, the image sample is segmented by the block-based graph cuts algorithm. Finally, the density clustering approach is used to classify the positive and negative samples into multiple cluster center respectively. At the testing stage, the distance between the multilevel HOG-LBP of test sample and every cluster center is calculated, and the five shortest distances are voted to classify the test sample. Experiments show that the proposed algorithm can handle the pose variations and partial occlusions effectively. Moreover, with the increase of training samples, the results of the proposed algorithm can be comparable to that of the state-of-the-art pedestrian detection algorithms.
Key wordsPedestrian Detection      Graph Cuts      Density Clustering      Unsupervised Learning     
Received: 15 February 2017     
ZTFLH: TP 18  
Fund:Supported by Natural Science Foundation of Guizhou Province(No.[2014]2081), Project of Innovation Team of Higher Education Institution of Guizhou Province(No.[2014]34)
Corresponding Authors: (ZENG Chengbin(Corresponding author), born in 1979, Ph.D., associate professor. His research interests include pedestrian detection and image classification.)   
About author:: (ZENG Chengbin(Corresponding author), born in 1979, Ph.D., associate professor. His research interests include pedestrian detection and image classification.)
(LIU Jiqian, born in 1979, Ph.D., associate professor. His research interests include image recognition and deep learning.)
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
ZENG Chengbin
LIU Jiqian
Cite this article:   
ZENG Chengbin,LIU Jiqian. Pedestrian Detection on Videos Based on Graph Cuts and Density Clustering[J]. , 2017, 30(7): 588-587.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/10.16451/j.cnki.issn1003-6059.201707002      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2017/V30/I7/588
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn