Compound rank-k projections for bilinear analysis

Xiaojun Chang, Feiping Nie, Sen Wang, Yi Yang, Xiaofang Zhou, Chengqi Zhang

科研成果: 期刊稿件文章同行评审

207 引用 (Scopus)

摘要

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.

源语言英语
文章编号7161356
页(从-至)1502-1513
页数12
期刊IEEE Transactions on Neural Networks and Learning Systems
27
7
DOI
出版状态已出版 - 7月 2016

指纹

探究 'Compound rank-k projections for bilinear analysis' 的科研主题。它们共同构成独一无二的指纹。

引用此