Abstract
For recognition tasks with large amounts of data, the nonlinear discriminant feature extraction technique often suffers from large computational burden. Although some nonlinear accelerating methods have been presented, how to greatly reduce computing time and simultaneously keep favorable recognition result is still challenging. In this paper, we introduce parallel computing into nonlinear subspace learning and build a parallel nonlinear discriminant feature extraction framework. We firstly design a random non-overlapping equal data division strategy to divide the whole training sample set into several subsets and assign each computational node a subset. Then we separately learn nonlinear discriminant subspaces from these subsets without mutual communications, and finally select the most appropriate subspace for classification. Under this framework, we propose a novel nonlinear subspace learning approach, i.e., parallel nonlinear discriminant analysis(PNDA). Experimental results on three public face and handwritten digit image databases demonstrate the efficiency and effectiveness of the proposed approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.