Jensen-Bregman LogDet divergence with application to efficient similarity search for covariance matrices

  • Cherian A
  • Sra S
  • Banerjee A
 et al. 
  • 98


    Mendeley users who have this article in their library.
  • 62


    Citations of this article.


Covariance matrices provide compact, informative feature descriptors for use in several computer vision applications, such as people-appearance tracking, diffusion-tensor imaging, activity recognition, among others. A key task in many of these applications is to compare different covariance matrices using a (dis)similarity function. A natural choice here is the Riemannian metric corresponding to the manifold inhabited by covariance matrices. But computations involving this metric are expensive, especially for large matrices and even more so, in gradient-based algorithms. To alleviate these difficulties, we advocate a novel dissimilarity measure for covariance matrices: the Jensen-Bregman LogDet Divergence. This divergence enjoys several useful theoretical properties, but its greatest benefits are: (i) lower computational costs (compared to standard approaches); and (ii) amenability for use in nearest-neighbor retrieval. We show numerous experiments to substantiate these claims.

Author-supplied keywords

  • Bregman divergence
  • LogDet divergence
  • Region covariance descriptors
  • activity recognition
  • image search
  • nearest neighbor search
  • video surveillance

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free