GOSUS: Grassmannian Online Subspace Updates with Structured-Sparsity

Jia Xu, Vamsi K. Ithapu, Lopamudra Mukherjee, James M. Rehg, Vikas Singh; The IEEE International Conference on Computer Vision (ICCV), 2013, pp. 3376-3383


We study the problem of online subspace learning in the context of sequential observations involving structured perturbations. In online subspace learning, the observations are an unknown mixture of two components presented to the model sequentially -the main effect which pertains to the subspace and a residual/error term. If no additional requirement is imposed on the residual, it often corresponds to noise terms in the signal which were unaccounted for by the main effect. To remedy this, one may impose 'structural' contiguity, which has the intended effect of leveraging the secondary terms as a covariate that helps the estimation of the subspace itself, instead of merely serving as a noise residual. We show that the corresponding online estimation procedure can be written as an approximate optimization process on a Grassmannian. We propose an efficient numerical solution, GOSUS, Grassmannian Online ficintnnumeriallsowith n,GGOSSUUS,GGrasssmaafor this problem. GOSUS is expressive enough in modeling both homogeneous perturbations of the subspace and structural contiguities of outliers, and after certain manipulations, solvable via an alternating direction method of multipliers (ADMM). We evaluate the empirical performance of this algorithm on two problems of interest: online background subtraction and online multiple face tracking, and demonstrate that it achieves competitive performance with the state-of-the-art in near real time.

Related Material

author = {Xu, Jia and Ithapu, Vamsi K. and Mukherjee, Lopamudra and Rehg, James M. and Singh, Vikas},
title = {GOSUS: Grassmannian Online Subspace Updates with Structured-Sparsity},
booktitle = {The IEEE International Conference on Computer Vision (ICCV)},
month = {December},
year = {2013}