Abstract

As the acquisition and application of color images become more and more extensive, color face recognition technology has also been vigorously developed, especially the recognition methods based on convolutional neural network, which have excellent performance. However, with the increasing depth and complexity of network models, the number of calculated parameters also increases, which means the training of most high-performance models depends on large-scale samples and expensive equipment. Therefore, the key to the current research is to realize a lightweight model while ensuring the recognition accuracy. At present, PCANet, a typical lightweight framework for deep learning, has achieved good results in most of the image recognition tasks, but its recognition accuracy for color face images, especially under occlusion, still needs to be improved. Therefore, a color occlusion face recognition method based on quaternion non-convex sparse constraint mechanism is proposed in this paper. Firstly, a quaternion non-convex sparse principal component analysis network model was constructed based on Lp regularization of strong sparsity. Secondly, the fixed point iteration method and coordinate descent method were established to solve the non-convex optimization problem. Finally, the occlusion recognition performance of the proposed method was verified on Georgia Tech, Color FERET, AR, and LFW-A Color face datasets.

Full Text
Published version (Free)

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 call