The full text of this article/chapter:

Generalization Abilities of Appearance-Based Subspace Face Recognition Algorithms
by Kresimir Delac, Mislav Grgic, Sonja Grgic
12th International Workshop on Systems, Signals and Image Processing (IWSSIP), Vol. 1, No. 1, 2005
Abstract: In this paper we present an efficient method to test the generalization abilities of subspace face recognition algorithms. The main motivation for this work is the lack of detailed analysis of this problem in current literature. Generalization ability of face recognition algorithm is the ability to recognize new individuals, which were not part of the training process. To illustrate our idea we used well-known recognition algorithms (PCA, ICA and LDA) and the FERET date set. Our results show that even these well-known algorithms have poor generalization abilities in some implementations.

is only available to individual subscribers or to users at subscribing institutions.

Pay per view: If you are not a Subscriber and you just want to read the full contents of this article, please click here to purchase online access to the full-text of this article. Please allow 3 days + mailing time. Current price for article is US$38.00

Members of the Editorial Board or subscribers of the 12th International Workshop on Systems, Signals and Image Processing (IWSSIP), that have been redirected here, please click here if you have IP-authentication access, or check if you have a registered username/password subscription with Inderscience. If that is the case, please Login:

    Username:        Password:         Forgotten your Password?