2004 GeneralizedLowRankApproximation

Subject Headings: Low Rank Approximation Task.

Notes

Cited By

Quotes

Abstract

We consider the problem of computing low rank approximations of matrices. The novelty of our approach is that the low rank approximations are on a sequence of matrices. Unlike the problem of low rank approximations of a single matrix, which was well studied in the past, the proposed algorithm in this paper does not admit a closed form solution in general. We did extensive experiments on face image data to evaluate the effectiveness of the proposed algorithm and compare the computed low rank approximations with those obtained from traditional Singular Value Decomposition based method.

References

;

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2004 GeneralizedLowRankApproximationJieping YeGeneralized Low Rank Approximations of Matrices10.1145/1015330.10153472004