期刊文献+

基于稀疏特征直方图约束的鲁棒目标跟踪 被引量:1

Robust object tracking based on sparse feature histogram constraint
下载PDF
导出
摘要 为增强目标跟踪的鲁棒性,克服诸如光照、非刚性变化等各种复杂挑战带来的剧烈外观变化,提出一种基于稀疏直方图的通用生成目标跟踪算法。通过滑动窗口将图像分成重叠的子图像块,提取出每一个图像块的局部特征,通过稀疏表示的方法获得对应的稀疏系数向量。为获得特征表达精度,采用增广拉格朗日乘子(ALM)求解最小l1范数问题,目标跟踪中的遮挡问题转换为构建模板的稀疏特征直方图。在粒子滤波框架下,选取候选集中最高相似度指标的图像块作为最优跟踪结果。为适应图标的遮挡带来的形态变化,提出一个简单有效的系数更新机制,产生新的模板直方图。大量基准测试视频定性定量分析结果表明,相比其它跟踪算法,该方法具有更好的跟踪性能。 To enhance the robustness of object tracking, an object tracking algorithm based on sparse histogram with universal generative model was proposed to overcome light, complex background and occlusion challenges. The image was divided into overlapped sub-image blocks using sliding window, and the local features of each image patch were extracted. The corresponding sparse coefficient vectors were obtained by sparse representation. To accurately obtain the expression of the object feature, the augmented Lagrange multiplier (ALM) was adopted to solve the minimum norm problem, where occlusion problem of object tracking was transformed into sparse feature histogram process. In the framework of particle filter, the image patch with the highest similarity measure was selected as the optimal tracking result. To adapt the change of the object occlusion, a simple and effective coefficient update mechanism was proposed to generate a new template histogram. Qualitative and quantitative analysis shows that the proposed algorithm has better tracking performance compared to other tracking algorithms.
作者 刘涛 严锡君 LIU Tao YAN Xi-jun(School of Information and Electrical Engineering, Jiangsu Open University, Nanjing 210017, China School of Computer and Information Science, Hohai University, Nanjing 210098, China)
出处 《计算机工程与设计》 北大核心 2017年第8期2213-2216,2239,共5页 Computer Engineering and Design
关键词 目标跟踪 模板直方图 增广拉格朗日乘子 粒子滤波 稀疏系数 更新机制 object tracking template histogram augmented Lagrange multiplier particle filter sparse coefficient update mechanism
  • 相关文献

参考文献1

二级参考文献40

  • 1常群,王晓龙,林沂蒙,王熙照,Daniel S.Yeung.支持向量分类和多宽度高斯核[J].电子学报,2007,35(3):484-487. 被引量:10
  • 2尹传环,田盛丰,牟少敏.一种面向间隙核函数的快速算法[J].电子学报,2007,35(5):875-881. 被引量:1
  • 3Baram Y.Learning by kernel polarization[J].Neural Com-putation,2005,17(6):1264-1275.
  • 4Nguyen C H,Ho T B.Kernel matrix evaluation[C].Hy-derabad,India:Proc of the 20th International JointConference on Artificial Intelligence,2007:987-992.
  • 5WANG T,TIAN S,HUANG H,et al.Learning by localkernel polarization[J].Neurocomputing,2009,72(13-15):3077-3084.
  • 6Cortes C,Mohri M,Rostamizadeh A.Two-stage learningkernel algorithms[C].Haifa,Israel:Proc of the 27th Inter-national Conference on Machine Learning,2010:239-246.
  • 7Wang G,Yeung D Y,Lochovsky F H.A kernel path algo-rithm for support vector machines[C].Corvalis,USA:Proc of the 24th International Conference on MachineLearning,2007:951-958.
  • 8WU K P,WANG S D.Choosing the kernel parameters forsupport vector machines by inter-cluster distance in the featurespace[J].Pattern Recognition,2009,42(5):710-717.
  • 9Lanckriet G R G,Bie T D,Cristianini N,et al.A statisticalframework for genomic data fusion[J].Bioinformatics,2004,20(16):2626-2635.
  • 10Bach F R,Lanckriet G R G,Jordan M I.Multiple kernellearning,conic duality,and the SMO algorithm[C].Banff,Canada:Proc of the 21st International Conference on MachineLearning,2004:41-48.

共引文献52

同被引文献11

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部