Occlusion Handling With L(1)-Regularized Sparse Reconstruction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)(2011)

引用 4|浏览16
暂无评分
摘要
Tracking multi-object under occlusion is a challenging task.. When occlusion happens, only the visible part of occluded object can provide reliable information for the matching. In conventional algorithms, the deducing of the occlusion relationship is needed to derive the visible part. However deducing the occlusion relationship is difficult. The inter-determined effect between the occlusion relationship and the tracking results will degenerate the tracking performance, and even lead to the tracking failure. In this paper, we propose a novel framework to track multi-object with occlusion handling according to sparse reconstruction. The matching with l(1)-regularized sparse reconstruction can automatically focus on the visible part of the occluded object, and thus exclude the need of deducing the occlusion relationship. The tracking is simplified into a joint Bayesian inference problem. We compare our algorithm with the state-of-the-art algorithms. The experimental results show the superiority of our algorithm over other competing algorithms.
更多
查看译文
关键词
occlusion relationship,visible part,occluded object,occlusion handling,tracking failure,tracking performance,tracking result,competing algorithm,conventional algorithm,l1-regularized sparse reconstruction
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要