Efficient DPM-Based Object Detection Using Shift with Importance Sampling

B. Wong, J. Hsieh, Chia-Jen Hsiao, S. Chien, Feng-Chia Chang
{"title":"Efficient DPM-Based Object Detection Using Shift with Importance Sampling","authors":"B. Wong, J. Hsieh, Chia-Jen Hsiao, S. Chien, Feng-Chia Chang","doi":"10.1109/ICS.2016.0075","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel Shift with Importance Sampling (SIS) scheme to improve the efficiency in DPM-based object detection but maintain its high accuracy. For fast and efficient object detection, the cascade-boosting structure is the commonly-used approach in the literature. However, its detection performance is quite lower due to non-robust features and a fully-scanning on image especially when deformable part models are adopted. Another powerful method \"deformable part model\" is commonly adopted to deal with the above problem. However, its full combinations of parts to represent an object make its inefficiency in the scanning process which needs to check all possible object positions. The proposed SIS scheme can avoid many redundant positions and thus significantly improve the efficiency of the DPM scheme up to a time order. Firstly, various interest points are first detected and then clustered via the ISO-data clustering scheme to produce potential candidates. Since each candidate will not exactly locate in the center of the detected target, it will be shifted according to the weights of its eight neighborhoods. The importance of each neighbor is scored by the DPM-classifier. Once it is shifted, the size of search window to find its positions will be narrowed to only quarter. Thus, the proposed SIS scanning scheme can quickly find the correct location of each pedestrian with minimum tries and tests. After analysis, the time complexity of scanning is reduced from O(n2) to O(logn), where the frame dimension is n×n. After that, the particle filter is adopted to track targets if they are missed. Experimental results show the superiority of our SIS method in pedestrian detection (evaluated on different famous datasets).","PeriodicalId":281088,"journal":{"name":"2016 International Computer Symposium (ICS)","volume":"105 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Computer Symposium (ICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICS.2016.0075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper proposes a novel Shift with Importance Sampling (SIS) scheme to improve the efficiency in DPM-based object detection but maintain its high accuracy. For fast and efficient object detection, the cascade-boosting structure is the commonly-used approach in the literature. However, its detection performance is quite lower due to non-robust features and a fully-scanning on image especially when deformable part models are adopted. Another powerful method "deformable part model" is commonly adopted to deal with the above problem. However, its full combinations of parts to represent an object make its inefficiency in the scanning process which needs to check all possible object positions. The proposed SIS scheme can avoid many redundant positions and thus significantly improve the efficiency of the DPM scheme up to a time order. Firstly, various interest points are first detected and then clustered via the ISO-data clustering scheme to produce potential candidates. Since each candidate will not exactly locate in the center of the detected target, it will be shifted according to the weights of its eight neighborhoods. The importance of each neighbor is scored by the DPM-classifier. Once it is shifted, the size of search window to find its positions will be narrowed to only quarter. Thus, the proposed SIS scanning scheme can quickly find the correct location of each pedestrian with minimum tries and tests. After analysis, the time complexity of scanning is reduced from O(n2) to O(logn), where the frame dimension is n×n. After that, the particle filter is adopted to track targets if they are missed. Experimental results show the superiority of our SIS method in pedestrian detection (evaluated on different famous datasets).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于dpm的重要采样偏移目标检测
为了提高基于dpm的目标检测的效率,同时保持其较高的准确性,提出了一种新的重要抽样偏移(SIS)方案。为了快速有效地检测目标,级联增强结构是文献中常用的方法。然而,由于该方法具有非鲁棒性和对图像的全扫描等特点,特别是在采用可变形零件模型时,其检测性能较低。通常采用另一种强大的方法“可变形零件模型”来处理上述问题。然而,它的全组合部分来表示一个对象,使其在扫描过程中效率低下,需要检查所有可能的对象位置。所提出的SIS方案可以避免许多冗余位置,从而大大提高了DPM方案的效率,直至一个时间顺序。首先,检测各种兴趣点,然后通过iso数据聚类方案聚类产生潜在候选点;由于每个候选目标不会精确地定位在被检测目标的中心,因此它将根据其八个邻域的权重进行移动。每个邻居的重要性由dpm分类器评分。一旦移动,查找其位置的搜索窗口的大小将缩小到只有四分之一。因此,所提出的SIS扫描方案能够以最少的尝试和测试快速找到每个行人的正确位置。经过分析,将扫描的时间复杂度从O(n2)降低到O(logn),其中帧维为n×n。然后,采用粒子滤波对未命中的目标进行跟踪。实验结果表明了我们的SIS方法在行人检测方面的优越性(在不同的著名数据集上进行了评估)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Resource Allocation Algorithms for LTE over Wi-Fi Spectrum A Dynamically Adjusted Vehicles Navigation Scheme with Real-Time Traffic Information to Relieve Regional Traffic Congestion in Vehicular Ad-Hoc Networks Forward/Backward Unforgeable Digital Signature Scheme Using Symmetric-Key Crypto-System Mobile Edge Fog Computing in 5G Era: Architecture and Implementation Investigating the Determinants of Mobile Learning Acceptance in Higher Education Based on UTAUT
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1