Wen, J. and Gao, X. and Li, Xuelong and Tao, D. and Li, J. (2010) Incremental pairwise discriminant analysis based visual tracking. Neurocomputing 74 (1-3), pp. 428-438. ISSN 0925-2312.
Abstract
The distinguishment between the object appearance and the background is the useful cues available for visual tracking, in which the discriminant analysis is widely applied. However, due to the diversity of the background observation, there are not adequate negative samples from the background, which usually lead the discriminant method to tracking failure. Thus, a natural solution is to construct an object–background pair, constrained by the spatial structure, which could not only reduce the neg-sample number, but also make full use of the background information surrounding the object. However, this idea is threatened by the variant of both the object appearance and the spatial-constrained background observation, especially when the background shifts as the moving of the object. Thus, an incremental pairwise discriminant subspace is constructed in this paper to delineate the variant of the distinguishment. In order to maintain the correct the ability of correctly describing the subspace, we enforce two novel constraints for the optimal adaptation: (1) pairwise data discriminant constraint and (2) subspace smoothness. The experimental results demonstrate that the proposed approach can alleviate adaptation drift and achieve better visual tracking results for a large variety of nonstationary scenes.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | pairwise discriminant analysis, log-euclidean riemannian, lncremental learning, visual tracking |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 20 Jun 2013 13:52 |
| Last Modified: | 09 Aug 2023 12:33 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/7542 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
