.png){kind=icon}
返回
Visual Tracking via Constrained Incremental Non-negative Matrix Factorization
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2015.2404856.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter presents a novel visual tracking algorithm by using Incremental Non-negative Matrix Factorization (INMF) and dual l(1)-norm constraints. Firstly, we introduce one l(1) regularization into the NMF reconstruction, which enables appearance model to tolerate different noises to some extent. Meanwhile, we enforce another l(1) regularization on the projection coefficients when using iterative operators to obtain NMF basis vectors for the effective tracking. Secondly, to obtain the sparse error and projection coefficient matrice, we present an iterative algorithm to solve the optimal problem, which ensures the representation is more robust. Finally, we take partial occlusion into construct likelihood function, and combined with INMF learning to update appearance model for alleviating tracking drift. Experimental results compared with the state-of-the-art tracking methods demonstrate the proposed algorithm achieves favorable performance when the object undergoes large occlusion, motion blur and illumination changes.
Keyword:
INMF
online subspace learning
soft-thresholding
sparse constraint
visual tracking
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
分享收藏On-line learning parts-based representation via incremental orthogonal projective non-negative matrix factorization.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏
分享收藏Localization of the Medial Branches of the Cervical Dorsal Rami During Cervical LaminoplastySpine
SpineIF0
PREAI
分享收藏
查看更多内容