Real-time compressive tracking based on online feature selection

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As the projection matrix is only generated in the initial stage and kept constant in subsequent processing, so when the object is occluded or its appearance changes, this will result in drifting or tracking lost. To address this problem, this paper proposes a real-time compressive tracking algorithm based on online feature selection. First, the feature pools are constructed. Then, features with high confidence score are selected from the feature pool by a confidence evaluation strategy. These discriminating features and their corresponding confidences are integrated to construct a classifier. Finally, tracking processing is carried on by the classifier. Tracking performance of our algorithm compares with that of the original algorithm on several public testing video sequences. Our algorithm improves on the tracking accuracy and robustness; furthermore, the processing speed is approximately 25 frames per second. It meets the requirements of real-time tracking.

Cite

CITATION STYLE

APA

Mao, Z., Yuan, J., Wu, Z., Qu, J., & Li, H. (2014). Real-time compressive tracking based on online feature selection. Advances in Intelligent Systems and Computing, 255, 431–438. https://doi.org/10.1007/978-81-322-1759-6_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free