[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A theoretical investigation of feature partitioning principal component analysis methods

  • Theoretical Advances
  • Published:
Pattern Analysis and Applications Aims and scope Submit manuscript

Abstract

Principal Component Analysis (PCA) is a well-known linear dimensionality reduction technique in the literature. It extracts global principal components (PCs) and lacks in capturing local variations in its global PCs. To overcome the issues of PCA, Feature Partitioning based PCA (FP-PCA) methods were proposed; they extract local PCs from subpatterns and they are not sensitive to global variations across the subpatterns. Subsequently, SubXPCA was proposed as a novel FP-PCA approach which extracts PCs by utilizing both global and local information; it was proved to be efficient in terms of computational time and classification. It is observed that there is no detailed theoretical investigation done on the properties of FP-PCA methods. Such theoretical analysis is essential to provide generalized and formal validation of the properties of the FP-PCA methods. In this paper, our focus is to show SubXPCA as an alternative to PCA and other FP-PCA methods by proving analytically the various properties of SubXPCA related to summarization of variance, feature orders, and subpattern sizes. We prove analytically that (i) SubXPCA approaches PCA in terms of summarizing variance with increase in number of local principal components of subpatterns; (ii) SubXPCA is robust against feature orders (permutations) of patterns and variety of partitions (subpattern sizes); (iii) SubXPCA shows higher dimensionality reduction as compared to other FP-PCA methods. These properties of SubXPCA are demonstrated empirically upon UCI Waveform and ORL face data sets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Al-Arashi WH, Ibrahim H, Suandi SA (2014) Optimizing principal component analysis performance for face recognition using genetic algorithm. Neurocomputing 128:415–420

    Article  Google Scholar 

  2. Chen S, Zhu Y (2004) Subpattern-based principal component analysis. Pattern Recognit 37:1081–1083

    Article  Google Scholar 

  3. Connie T, Teoh A, Goh M, Ngo D (2004) Palmhashing: a novel approach for dual-factor authentication. Pattern Anal Appl 7(3):255–268

    Article  MathSciNet  Google Scholar 

  4. Eftekhari A, Forouzanfar M, Moghaddam HA, Alirezaie J (2010) Block-wise 2D kernel PCA/LDA for face recognition. Inf Process Lett 110:761–766

    Article  MathSciNet  MATH  Google Scholar 

  5. Fredembach C, Schroder M, Susstrunk S (2004) Eigenregions for image classification. IEEE Trans Pattern Anal Mach Intell 26(12):1645–1649

    Article  Google Scholar 

  6. Gottumukkal R, Asari VK (2004) An improved face recognition technique based on modular PCA approach. Pattern Recognit Lett 25:429–436

    Article  Google Scholar 

  7. Jaffe, Jaffe face data set. http://www.kasrl.org/jaffe.html. Accessed Dec 2012

  8. R. A. Johnson, D. W. Wichern (2001) Applied multivariate statistical analysis. Prentice-Hall of India, 3rd edn. New Delhi, pp. 356–394

  9. Liang Z, Xia S, Zhou Y, Li Y (2011) Blockwise projection matrix versus blockwise data on undersampled problems: analysis, comparison and applications. Pattern Recognit 44:2774–2785

    Article  MATH  Google Scholar 

  10. Liu S, Gu M, Zhang Q, Li B (2014) Principal component analysis algorithm in video compressed sensing. Optik Int J Light Electron Opt 125(3):1149–1153

    Article  Google Scholar 

  11. A. Negi, K. Vijayakumar, An investigation on recent advances in feature partitioning based principal component analysis methods. In: Proceedings of Vaagdevi International Conference on IT for Real World Problems, Warangal, A.P., India, 2010.

  12. A. Negi, K. Vijayakumar, SubXPCA versus PCA: a theoretical investigation. In: Proceedings of 2010 International Conferenece on Pattern Recognition, Istambul, Turkey, 2010.

  13. ORL, ORL face data set. http://www.cam-orl.co.uk/facedatabase.html.

  14. Pedrycz W, Lee DJ, Pizzi NJ (2010) Representation and classification of high-dimensional biomedical spectral data. Pattern Anal Appl 33(4):423–436

    Article  MathSciNet  Google Scholar 

  15. Press WH, Teukolsky SA, Vetterling WT, Flannery BP (2002) Numerical recipes in C. 2nd edn. Cambridge University Press, Foundation Books, New Delhi 110002:469–481

    MathSciNet  MATH  Google Scholar 

  16. Rizvi SA, Saadawi TN, Nasrabadi NM (2000) A clutter rejection technique for FLIR imagery using region based principal component analysis. Pattern Recognit 33:1931–1933

    Article  Google Scholar 

  17. A. Savasere, E. Omiecinski, S. Navathe (1995) An efficient algorithms for mining association rules in large database. In: Proceedings of 21th International Conference on Very Large Data Bases, Swizerland

  18. UCI, UCI repository of machine learning databases. http://www.ics.uci.edu/mlearn/MLRepository.html.

  19. Vijayakumar K, Negi A (2013) Computational and space complexity analysis of SubXPCA. Pattern Recognit 46(8):2169–2174

    Article  MATH  Google Scholar 

  20. Vijayakumar K, Negi A (2008) SubXPCA and a generalized feature partitioning approach to principal component analysis. Pattern Recognit 41(4):1398–1409

    Article  MATH  Google Scholar 

  21. Zhao C, Gao F (2014) Fault-relevant principal component analysis (fpca) method for multivariate statistical modeling and process monitoring. Chemom Intell Laboratory Syst 133:1–16

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Applications, BMS College of Engineering, Bangalore, 560019, India

    Vijayakumar Kadappa

  2. School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India

    Atul Negi

Authors
  1. Vijayakumar Kadappa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Atul Negi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vijayakumar Kadappa.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kadappa, V., Negi, A. A theoretical investigation of feature partitioning principal component analysis methods. Pattern Anal Applic 19, 79–91 (2016). https://doi.org/10.1007/s10044-014-0390-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10044-014-0390-x

Keywords

Search

Navigation