Sciweavers

330 search results - page 1 / 66
» Robust Visual Tracking using L1 Minimization
Sort
View
ICCV
2009
IEEE
1957views Computer Vision» more  ICCV 2009»
14 years 9 months ago
Robust Visual Tracking using L1 Minimization
In this paper we propose a robust visual tracking method by casting tracking as a sparse approximation problem in a particle filter framework. In this framework, occlusion, corru...
Xue Mei, Haibin Ling
CVPR
2012
IEEE
11 years 6 months ago
Real time robust L1 tracker using accelerated proximal gradient approach
Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called ...
Chenglong Bao, Yi Wu, Haibin Ling, Hui Ji
CVPR
2010
IEEE
13 years 2 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
CVPR
2005
IEEE
14 years 6 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
ICCV
2007
IEEE
14 years 6 months ago
Robust Visual Tracking Using the Time-Reversibility Constraint
Visual tracking is a very important front-end to many vision applications. We present a new framework for robust visual tracking in this paper. Instead of just looking forward in ...
Hao Wu, Rama Chellappa, Aswin C. Sankaranarayanan,...