中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 合肥物质科学研究院
  3. 中国科学院合肥物质科学研究院
  4. 中科院合肥智能机械研究所
Robust object tracking via multi-scale patch based sparse coding histogram

文献类型：期刊论文

作者Wang, Zhongpei1; Wang, Hao1; Tan, Jieqing1; Chen, Peng3; Xie, Chengjun1,2
刊名MULTIMEDIA TOOLS AND APPLICATIONS
出版日期2017-05-01
卷号76期号:10页码:12181-12203
关键词Object Tracking Multi-scale Patch Sparse Coding Histogram Appearance Model
DOI10.1007/s11042-016-3289-2
文献子类Article
英文摘要There are many visual tracking algorithms that are based on sparse representation appearance model. Most of them are modeled by local patches with fixed patch scale, which make trackers less effective when objects undergone appearance changes such as illumination variation, pose change or partial occlusion. To solve the problem, a novel appearance representation model is proposed via multi-scale patch based sparse coding histogram for robust visual tracking. In this paper, the appearance of an object is modeled by different scale patches, which are represented by sparse coding histogram with different scale dictionaries. Then a similarity measure is applied to the calculation of the distance between the sparse coding histograms of target candidate and target template. Finally, the similarity score of the target candidate is passed to a particle filter to estimate the target state sequentially in the tracking process. Additionally, in order to decrease the visual drift caused by partial occlusion, an occlusion handling strategy is adopted, which takes the spatial information of multi-scale patches and occlusion into account. Based on the experimental results on some benchmarks of video sequences, our tracker outperforms state-of-the-art tracking methods.
WOS关键词VISUAL TRACKING ; APPEARANCE MODEL ; REPRESENTATION
WOS研究方向Computer Science ; Engineering
语种英语
WOS记录号WOS:000401935200002
资助机构National Natural Science Foundation of China(61070227 ; National Natural Science Foundation of China(61070227 ; National Natural Science Foundation of China(61070227 ; National Natural Science Foundation of China(61070227 ; NSFC-Guangdong Joint Foundation Key Project(U1135003) ; NSFC-Guangdong Joint Foundation Key Project(U1135003) ; NSFC-Guangdong Joint Foundation Key Project(U1135003) ; NSFC-Guangdong Joint Foundation Key Project(U1135003) ; 61300058 ; 61300058 ; 61300058 ; 61300058 ; 61472282 ; 61472282 ; 61472282 ; 61472282 ; 31401293 ; 31401293 ; 31401293 ; 31401293 ; 41302261) ; 41302261) ; 41302261) ; 41302261) ; National Natural Science Foundation of China(61070227 ; National Natural Science Foundation of China(61070227 ; National Natural Science Foundation of China(61070227 ; National Natural Science Foundation of China(61070227 ; NSFC-Guangdong Joint Foundation Key Project(U1135003) ; NSFC-Guangdong Joint Foundation Key Project(U1135003) ; NSFC-Guangdong Joint Foundation Key Project(U1135003) ; NSFC-Guangdong Joint Foundation Key Project(U1135003) ; 61300058 ; 61300058 ; 61300058 ; 61300058 ; 61472282 ; 61472282 ; 61472282 ; 61472282 ; 31401293 ; 31401293 ; 31401293 ; 31401293 ; 41302261) ; 41302261) ; 41302261) ; 41302261)
源URL[http://ir.hfcas.ac.cn:8080/handle/334002/31904]  
专题合肥物质科学研究院_中科院合肥智能机械研究所
作者单位1.Hefei Univ Technol, Sch Comp & Informat, Hefei 230009, Peoples R China
2.Chinese Acad Sci, Inst Intelligent Machines, Hefei 230031, Peoples R China
3.Anhui Univ, Inst Hlth Sci, Hefei 230601, Peoples R China
推荐引用方式
GB/T 7714		 Wang, Zhongpei,Wang, Hao,Tan, Jieqing,et al. Robust object tracking via multi-scale patch based sparse coding histogram[J]. MULTIMEDIA TOOLS AND APPLICATIONS,2017,76(10):12181-12203.
APA Wang, Zhongpei,Wang, Hao,Tan, Jieqing,Chen, Peng,&Xie, Chengjun.(2017).Robust object tracking via multi-scale patch based sparse coding histogram.MULTIMEDIA TOOLS AND APPLICATIONS,76(10),12181-12203.
MLA Wang, Zhongpei,et al."Robust object tracking via multi-scale patch based sparse coding histogram".MULTIMEDIA TOOLS AND APPLICATIONS 76.10(2017):12181-12203.

入库方式： OAI收割

来源：合肥物质科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。