Abstract
This paper proposes a generalized 2-D principal component analysis (G2DPCA) by replacing the L2-norm in conventional 2-D principal component analysis (2DPCA) with Lp-norm, both in objective and constraint functions. It is a generalization of previously proposed robust or sparse 2DPCA algorithms. Under the framework of minorization-maximization, we design an iterative algorithm to solve the optimization problem of G2DPCA. A closed-form solution could be obtained in each iteration. Then a deflating scheme is employed to generate multiple projection vectors. Our algorithm guarantees to find a locally optimal solution for G2DPCA. The effectiveness of the proposed method is experimentally verified.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
