Compact Matrix Factorization With Dependent Subspaces

Viktor Larsson, Carl Olsson; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 280-289

Abstract


Traditional matrix factorization methods approximate high dimensional data with a low dimensional subspace. This imposes constraints on the matrix elements which allow for estimation of missing entries. A lower rank provides stronger constraints and makes estimation of the missing entries less ambiguous at the cost of measurement fit. In this paper we propose a new factorization model that further constrains the matrix entries. Our approach can be seen as a unification of traditional low-rank matrix factorization and the more recent union-of-subspace approach. It adaptively finds clusters that can be modeled with low dimensional local subspaces and simultaneously uses a global rank constraint to capture the overall scene interactions. For inference we use an energy that penalizes a trade-off between data fit and degrees-of-freedom of the resulting factorization. We show qualitatively and quantitatively that regularizing both local and global dynamics yields significantly improved missing data estimation.

Related Material


[pdf] [Supp] [video]
[bibtex]
@InProceedings{Larsson_2017_CVPR,
author = {Larsson, Viktor and Olsson, Carl},
title = {Compact Matrix Factorization With Dependent Subspaces},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {July},
year = {2017}
}