Occlusion Handling with l1-Regularized Sparse Reconstruction

被引:0
作者
Li, Wei [1 ]
Li, Bing [1 ]
Zhang, Xiaoqin [2 ]
Hu, Weiming [1 ]
Wang, Hanzi [3 ,4 ]
Luo, Guan [1 ]
机构
[1] Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing, Peoples R China
[2] Wenzhou Univ, College Math & Informat Sci, Zhengzhou, Peoples R China
[3] Xiamen Univ, Sch Informat Sci & Technol, Xiamen, Peoples R China
[4] Fujian Key Lab Brain Like Intellegient Sys, Xiamen, Peoples R China
来源
COMPUTER VISION - ACCV 2010, PT IV | 2011年 / 6495卷
关键词
TRACKING; MODELS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:630 / +
页数:3
相关论文
共 16 条