Concurrent subspaces analysis

• Published in: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) Vol. 2; pp. 203 - 208 vol. 2
• Main Authors: Dong Xu, Shuicheng Yan, Lei Zhang, Hong-Jiang Zhang, Zhengkai Liu, Heung-Yeung Shum
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Algorithm design and analysis; Analytical models; Digital filters; Gabor filters; Image analysis; Image coding; Image databases; Image sequence analysis; Tensile stress; Video sequences
• ISBN: 0769523722; 9780769523729
• ISSN: 1063-6919; 1063-6919
• DOI: 10.1109/CVPR.2005.107

A representative subspace is significant for image analysis, while the corresponding techniques often suffer from the curse of dimensionality dilemma. In this paper, we propose a new algorithm, called concurrent subspaces analysis (CSA), to derive representative subspaces by encoding image objects as 2/sup nd/ or even higher order tensors. In CSA, an original higher dimensional tensor is transformed into a lower dimensional one using multiple concurrent subspaces that characterize the most representative information of different dimensions, respectively. Moreover, an efficient procedure is provided to learn these subspaces in an iterative manner. As analyzed in this paper, each sub-step of CSA takes the column vectors of the matrices, which are acquired from the k-mode unfolding of the tensors, as the new objects to be analyzed, thus the curse of dimensionality dilemma can be effectively avoided. The extensive experiments on the 3/sup rd/ order tensor data, simulated video sequences and Gabor filtered digital number image database show that CSA outperforms principal component analysis in terms of both reconstruction and classification capability.