| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 533021 | Pattern Recognition | 2005 | 4 Pages |
Abstract
The algorithm for generalized low-rank approximations of matrices (GLRAM) has been developed recently. In this paper, the optimality property of GLRAM is revealed. Accordingly, an analytical method for GLRAM is proposed. The proposed method is non-iterative. Moreover, the relationship between 2DPCA and GLRAM is shown.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Zhizheng Liang, Pengfei Shi,