Tracking objects using orientation covariance matrices

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

Abstract

This paper presents a novel model, called orientation covariance matrices, to represent the object region and introduces a steepest descent method for object tracking. This model partitions the gradient orientation space of joint color channels into subspaces (bins), and computes the covariance matrix of image features in every bin. In the model a feature point does not belong exclusively to one bin; instead, it makes contributions to several neighboring bins. This is accomplished by introducing the cosine function for weighting the gradient components of feature vectors. The weighting function helps to alleviate the effect of errors in the computation of gradients induced by noise and illumination change. We also introduce a spatial kernel for emphasizing the feature vectors which are nearer to the object center and for excluding more background information. Based on the orientation covariance matrices, we introduce a distance metric and develop a steepest descent algorithm for object tracking. Experiments show that the proposed method has better performance than the traditional covariance tracking method. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, P., & Sun, Q. (2011). Tracking objects using orientation covariance matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6838 LNCS, pp. 226–233). https://doi.org/10.1007/978-3-642-24728-6_30

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