| 基于全局和局部约束直推学习的鲁棒跟踪研究 |
| |
| 引用本文： | 查宇飞,毕笃彦,杨源,董守平,罗宁.基于全局和局部约束直推学习的鲁棒跟踪研究[J].自动化学报,2010,36(8):1084-1090. |
| |
| 作者姓名： | 查宇飞 毕笃彦 杨源 董守平 罗宁 |
| |
| 作者单位： | 1.空军工程大学工程学院 西安 710038 |
| |
| 摘 要： | 在目标跟踪中, 大部分算法都是假设目标亮度不变或者目标子空间不变, 然而, 这些假设在实际场景中并不一定满足, 特别是当目标和背景都发生较大变化时, 目标容易丢失. 针对这种情况, 本文从直推学习的角度重新描述跟踪问题, 并提出一种鲁棒的目标跟踪方法.为获得更好的跟踪效果, 目标当前状态估计不仅要逼近目标模型, 而且要与以前的结果具有相同的聚类. 本方法利用目标模型对跟踪问题进行全局约束, 利用以前的结果约束状态局部分布, 构造代价函数. 将以前的状态估计作为正样本, 当前的候选状态作为未标记样本, 以所有样本为顶点建立图, 同时学习目标的全局外观模型和所有状态的局部聚类结构. 最后利用图拉普拉斯, 通过简单的线性代数运算, 获得代价函数的最优解. 在实验中, 选取包含各种情形的视频, 如目标的姿势改变、表情变化、部分遮挡以及周围光照的变化等, 利用本文提出的方法测试, 并和其他算法比较. 实验结果表明, 本文方法能够很好处理这些情形, 实现对目标的鲁棒跟踪.
|
| 关 键 词： | 鲁棒跟踪 图拉普拉斯 直推学习 全局约束 局部约束 |
| 收稿时间： | 2009-04-07 |
Transductive Learning with Global and Local Constraints for Robust Visual Tracking |
| |
| ZHA Yu-Fei,BI Du-Yan,YANG Yuan,DONG Shou-Ping,LUO Ning.Transductive Learning with Global and Local Constraints for Robust Visual Tracking[J].Acta Automatica Sinica,2010,36(8):1084-1090. |
| |
| Authors: | ZHA Yu-Fei BI Du-Yan YANG Yuan DONG Shou-Ping LUO Ning |
| |
| Affiliation: | 1.Engineering College, Air Force Engineering University, Xi'an 710038;2.Department of Air Navigation and Weapon Control, Air Force Second Flight College, Xi'an 710306 |
| |
| Abstract: | In the problem for object tracking, most methods assume brightness constancy or subspace constancy. When both of the foreground and background are changed, the above assumes are violated in practice and the object will be lost. In this paper, the object tracking problem is considered as a transductive learning problem and a robust tracking method is proposed. In order to obtain good result, the object not only fits the object model but also has the same cluster as the previous objects. The previous objects are the labeled data and the candidates are considered as unlabeled data. The cost function is obtained with global and local constraints. Moreover, a novel graph is constructed over the positive samples and candidate patches, which can simultaneously learn the object's global appearance and the local intrinsic geometric structure of all the patches. The solution for minimizing the cost function can be solved by the simple linear algebra with graph Laplacian. The proposed method is tested on different videos, which undergo large pose, expression, illumination, and partial occlusion, and is compared with state-of-the-art algorithms. Experimental results and comparative studies are provided to demonstrate that the proposed method works well with these situations and tracks the object robustly. |
| |
| Keywords: | Robust tracking graph Laplacian transductive learning global constrain local constrain |
|
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
|
