Classification probability analysis of principal component space analysis

In a previous paper, we have presented a new linear classification algorithm, principal component space analysis (PCNSA) which is designed for problems like object recognition where different classes have unequal and non-white noise covariance matrices. PCNSA first obtains a principal components space (PCA space) for the entire data and in this PCA space, it finds for each class "i", an M_i dimensional subspace along which the class\´s intra-class variance is the smallest. We call this subspace an approximate space (ANS) since the lowest variance is usually "much smaller" than the highest. A query is classified into class "i" if its distance from the class\´s mean in the class\´s ANS is a minimum. In this paper, we discuss the PCNSA algorithm more precisely and derive tight upper bounds on its classification error probability. We use these expressions to compare classification performance of PCNSA with that of subspace linear discriminant analysis (SLDA).