Computational and space complexity analysis of SubXPCA

Authors:
Vijayakumar Kadappa;Atul Negi
Affiliations:
Department of Computer Applications, BMS College of Engineering, Bangalore 560019, India;School of Computer and Information Sciences, University of Hyderabad, Hyderabad 500046, India
Venue:
Pattern Recognition
Year:
2013

Citing 12
Cited 0

Feedforward neural networks for principal components extraction

Computational Statistics & Data Analysis
An improved face recognition technique based on modular PCA approach

Pattern Recognition Letters
Eigenregions for Image Classification

IEEE Transactions on Pattern Analysis and Machine Intelligence
Clustered Blockwise PCA for Representing Visual Data

IEEE Transactions on Pattern Analysis and Machine Intelligence
PCA-based web page watermarking

Pattern Recognition
SubXPCA and a generalized feature partitioning approach to principal component analysis

Pattern Recognition
Multimodal biometric system using rank-level fusion approach

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Two-stage image denoising by principal component analysis with local pixel grouping

Pattern Recognition
Block-wise 2D kernel PCA/LDA for face recognition

Information Processing Letters
L1-norm-based 2DPCA

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on gait analysis
Blockwise projection matrix versus blockwise data on undersampled problems: Analysis, comparison and applications

Pattern Recognition
A novel incremental principal component analysis and its application for face recognition

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.01

Visualization

Abstract

Principal Component Analysis (PCA) is one of the well-known linear dimensionality reduction techniques in the literature. Large computational requirements of PCA and its insensitivity to 'local' variations in patterns motivated to propose partitional based PCA approaches. It is also observed that these partitioning methods are incapable of extracting 'global' information in patterns thus showing lower dimensionality reduction. To alleviate the problems faced by PCA and the partitioning based PCA methods, SubXPCA was proposed to extract principal components with global and local information. In this paper, we prove analytically that (i) SubXPCA shows its computational efficiency up to a factor of k (k=2) as compared to PCA and competitive to an existing partitioning based PCA method (SubPCA), (ii) SubXPCA shows much lower classification time as compared to SubPCA method, (iii) SubXPCA and SubPCA outperform PCA by a factor up to k (k=2) in terms of space complexity. The effectiveness of SubXPCA is demonstrated upon a UCI data set and ORL face data.