TY - JOUR
T1 - Image classification using correlation tensor analysis
AU - Fu, Yun
AU - Huang, Thomas S.
N1 - Funding Information:
Manuscript received June 19, 2007; revised November 2, 2007. This work was supported in part by the Beckman Graduate Fellowship, in part by the U.S. Government VACE program, and in part by the National Science Foundation under Grant CCF 04-26627. The views and conclusions are those of the authors, not of the U.S. Government or its Agencies. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Dan Schonfeld.
PY - 2008/2
Y1 - 2008/2
N2 - Images, as high-dimensional data, usually embody large variabilities. To classify images for versatile applications, an effective algorithm is necessarily designed by systematically considering the data structure, similarity metric, discriminant subspace, and classifier. In this paper, we provide evidence that, besides the Fisher criterion, graph embedding, and tensorization used in many existing methods, the correlation-based similarity metric embodied in supervised multilinear discriminant subspace learning can additionally improve the classification performance. In particular, a novel discriminant subspace learning algorithm, called correlation tensor analysis (CTA), is designed to incorporate both graph-embedded correlational mapping and discriminant analysis in a Fisher type of learning manner. The correlation metric can estimate intrinsic angles and distances for the locally isometric embedding, which can deal with the case when Euclidean metric is incapable of capturing the intrinsic similarities between data points. CTA learns multiple interrelated subspaces to obtain a low-dimensional data representation reflecting both class label information and intrinsic geometric structure of the data distribution. Extensive comparisons with most popular subspace learning methods on face recognition evaluation demonstrate the effectiveness and superiority of CTA. Parameter analysis also reveals its robustness.
AB - Images, as high-dimensional data, usually embody large variabilities. To classify images for versatile applications, an effective algorithm is necessarily designed by systematically considering the data structure, similarity metric, discriminant subspace, and classifier. In this paper, we provide evidence that, besides the Fisher criterion, graph embedding, and tensorization used in many existing methods, the correlation-based similarity metric embodied in supervised multilinear discriminant subspace learning can additionally improve the classification performance. In particular, a novel discriminant subspace learning algorithm, called correlation tensor analysis (CTA), is designed to incorporate both graph-embedded correlational mapping and discriminant analysis in a Fisher type of learning manner. The correlation metric can estimate intrinsic angles and distances for the locally isometric embedding, which can deal with the case when Euclidean metric is incapable of capturing the intrinsic similarities between data points. CTA learns multiple interrelated subspaces to obtain a low-dimensional data representation reflecting both class label information and intrinsic geometric structure of the data distribution. Extensive comparisons with most popular subspace learning methods on face recognition evaluation demonstrate the effectiveness and superiority of CTA. Parameter analysis also reveals its robustness.
KW - Correlation tensor analysis (CTA)
KW - Discriminant analysis
KW - Face recognition
KW - Image classification
KW - Subspace learning
UR - http://www.scopus.com/inward/record.url?scp=39549087054&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39549087054&partnerID=8YFLogxK
U2 - 10.1109/TIP.2007.914203
DO - 10.1109/TIP.2007.914203
M3 - Article
C2 - 18270114
AN - SCOPUS:39549087054
SN - 1057-7149
VL - 17
SP - 226
EP - 234
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 2
ER -