返回
Robust visual tracking based on product sparse coding
DOI:10.1016/j.patrec.2015.01.014.png)
摘要
En 中文
In this paper, we propose a sparse coding tracking algorithm based on the Cartesian product of two sub-codebooks. The original sparse coding problem is decomposed into two sub sparse coding problems. And the dimension of sparse representation is intensively enlarged at a lower computational cost. Furthermore, in order to reduce the number of L-1-norm minimization, ridge regression is employed to exclude the substantive outlying particles according to the reconstruction error. Finally the high-dimension sparse representation is put into the classifier and the candidate with the maximal response is considered as the target. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed tracking algorithm performs favorably against several state-of-the-art algorithms. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Visual tracking
Product sparse coding
L-1-norm minimization
Ridge regression
Support vector machine
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
On the Development and Applications of Cellulosic Nanofibrillar and Nanocrystalline Materials纤维素纳米原纤和纳米晶材料的发展与应用

