.png){kind=icon}
返回
Locally connected graph for visual tracking
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2012.08.053.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Based on fast feature extraction, the subspace representation model provides a compact notion of the thing being tracked rather than treating the target as a sparse feature representation. The main challenges of the subspace representation model can be attributed to the difficulty of handling the appearance variability of a target object. In this paper, we present a subspace learning algorithm based on graph embedding that uses a Locally Connected Graph (LCG). By constructing a supervised graph with several types of labeled target samples, the algorithm can effectively learn the semantic subspace modeling for some appearance variability. Moreover, by using an additional constraint connection among several subgraphs, the algorithm can obtain a more compact subspace model. In comprehensive experiments, our algorithm has demonstrated better performance than alternatives reported in the recent literature. (c) 2013 Elsevier B.V. All rights reserved.
Keyword:
Feature extraction
Graph embedding
Subspace learning
Visual tracking
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容