Compound rank-k projections for bilinear analysis

Publication Type:
Journal Article
Citation:
IEEE Transactions on Neural Networks and Learning Systems, 2016, 27 (7), pp. 1502 - 1513
Issue Date:
2016-07-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
07161356.pdfPublished Version2.73 MB
Adobe PDF
© 2012 IEEE. In many real-world applications, data are represented by matrices or high-order tensors. Despite the promising performance, the existing 2-D discriminant analysis algorithms employ a single projection model to exploit the discriminant information for projection, making the model less flexible. In this paper, we propose a novel compound rank- k projection (CRP) algorithm for bilinear analysis. The CRP deals with matrices directly without transforming them into vectors, and it, therefore, preserves the correlations within the matrix and decreases the computation complexity. Different from the existing 2-D discriminant analysis algorithms, objective function values of CRP increase monotonically. In addition, the CRP utilizes multiple rank- k projection models to enable a larger search space in which the optimal solution can be found. In this way, the discriminant ability is enhanced. We have tested our approach on five data sets, including UUIm, CVL, Pointing'04, USPS, and Coil20. Experimental results show that the performance of our proposed CRP performs better than other algorithms in terms of classification accuracy.
Please use this identifier to cite or link to this item: