Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/55297
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | An analysis of linear subspace approaches for computer vision and pattern recognition |
Author: | Chen, P. Suter, D. |
Citation: | International Journal of Computer Vision, 2006; 68(1):83-106 |
Publisher: | Kluwer Academic Publ |
Issue Date: | 2006 |
ISSN: | 0920-5691 1573-1405 |
Statement of Responsibility: | Pei Chen and David Suter |
Abstract: | Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is that certain structures are intrinsically (or approximately) low dimensional: for example, the factorization approach to the problem of structure from motion (SFM) and principal component analysis (PCA) based approach to face recognition. In LSA, the singular value decomposition (SVD) is usually the basic mathematical tool. However, analysis of the performance, in the presence of noise, has been lacking. We present such an analysis here. First, the “denoising capacity” of the SVD is analysed. Specifically, given a rank-r matrix, corrupted by noise—how much noise remains in the rank-r projected version of that corrupted matrix? Second, we study the “learning capacity” of the LSA-based recognition system in a noise-corrupted environment. Specifically, LSA systems that attempt to capture a data class as belonging to a rank-r column space will be affected by noise in both the training samples (measurement noise will mean the learning samples will not produce the “true subspace”) and the test sample (which will also have measurement noise on top of the ideal clean sample belonging to the “true subspace”). These results should help one to predict aspects of performance and to design more optimal systems in computer vision, particularly in tasks, such as SFM and face recognition. Our analysis agrees with certain observed phenomenon, and these observations, together with our simulations, verify the correctness of our theory. |
Keywords: | singular value decomposition linear subspaces principal component analysis structure from motion factorization method homography face recognition matrix perturbation first-order perturbation multiple eigenvalue/singular value |
DOI: | 10.1007/s11263-006-6659-9 |
Published version: | http://dx.doi.org/10.1007/s11263-006-6659-9 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.