Open AccessConjugate gradient algorithm for efficient covariance tracking with Jensen‐Bregman LogDet metric
Author(s) -
Guo Qiang,
Wu Chengdong,
Feng Yu,
Lu Xiaohong
Publication year - 2015
Publication title -
iet computer vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 37
eISSN - 1751-9640
pISSN - 1751-9632
DOI - 10.1049/iet-cvi.2014.0163
Subject(s) - metric (unit) , covariance , mathematics , algorithm , conjugate gradient method , matching (statistics) , covariance intersection , similarity (geometry) , mathematical optimization , artificial intelligence , computer science , pattern recognition (psychology) , covariance matrix , estimation of covariance matrices , image (mathematics) , statistics , operations management , economics
Region covariance descriptor that fuses multiple features compactly has proven to be very effective for visual tracking. While working effectively, the exhaustive global search strategy of covariance tracking is still inefficient, and there is much room for improvement. It may cause inconsecutive tracking trajectory and distraction. A suitable region similarity metric for covariance matching between the candidate object region and a given appearance template is of much importance. However, the computational burden of the metric, especially for large matrices under Riemannian space, may hinder its application in gradient‐based algorithms. In this study, the authors propose an algorithm which, by minimising the metric function, exploits an efficient conjugate gradient method to iteratively search the best matched candidate, and determines the search step size by non‐monotonic liner strategy. Then, an inferential reasoning in view of new efficient metric is derived for the gradient‐based algorithm. The authors test the proposed tracking method on test baseline dataset. Both quantitative and qualitative results demonstrate the effectiveness of the proposed algorithm compared with other state‐of‐the‐art methods.