Online Sparse Matrix Gaussian Process Regression and Vision Applications

Online Sparse Matrix Gaussian Process Regression and Vision Applications

Journal Article

Abstract

​​We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP is based on the observation that for kernels with local support, the Gram matrix is typically sparse. Maintaining and updating the sparse Cholesky factor of the Gram matrix can be done efficiently using Givens rotations. This leads to an exact, online algorithm whose update time scales linearly with the size of the Gram matrix. Further, if approximate updates are permissible, the Cholesky factor can be maintained at a constant size using hyperbolic rotations to remove certain rows and columns corresponding to discarded training examples. We demonstrate that, using these matrix downdates, online hyperparameter estimation can be included without affecting the linear runtime complexity of the algorithm. The OSMGP algorithm is applied to head-pose estimation and visual tracking problems. Experimental results demonstrate that the proposed method is accurate, efficient and generalizes well using online learning.​​​

Details

PUBLISHED IN
IEEE Transactions on Image Processing, Vol. 20, No. 2, pp. 391-404
PUBLICATION DATE
01 févr. 2011
AUTHORS
A. Ranganathan, M. Yang, J. Ho