Abstract

Feature extraction (FE) plays an important role in machine learning. In order to handle the “dimensionality disaster”problem, the usual approach is to transform the original sample into a low-dimensional target space, in which the FE task is performed. However, the data in reality will always be corrupted by various noises or interfered by outliers, making the task of feature extraction extremely challenging. Thence, we propose a novel image FE method via approximate orthogonal low-rank embedding (AOLRE), which adopts an orthogonal matrix to reserve the major energy of the samples, and the introduction of the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> , <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm makes the features more compact, differentiated and interpretable. In addition, the weighted Schatten p-norm is adopted in this model for fully exploring the effects of different ranks while approaching the original hypothesis of low rank. Meanwhile, as a robust measure, the correntropy is applied in AOLRE. This can effectively suppress the adverse influences of contaminated data and enhance the robustness of the algorithm. Finally, the introduction of the classification loss item allows our model to effectively fit the supervised scene. Five common datasets are used to evaluate the performance of AOLRE. The results show that the recognition accuracy and robustness of AOLRE are significantly better than those of several advanced FE algorithms, and the improvement rate ranges from 2% to 15%.

Highlights

  • S we all know, image processing technology has been applied to various areas of our lives, such as face recognition, image analysis, document clustering and medical diagnosis

  • This study focuses on the design of feature extraction algorithm, so the application of Feature extraction (FE) will not be further described here

  • The analysis reveals that approximate orthogonal low-rank embedding (AOLRE) obtains the best result in all methods, which proves that model AOLRE can effectively extract the features of object images

Read more

Summary

INTRODUCTION

S we all know, image processing technology has been applied to various areas of our lives, such as face recognition, image analysis, document clustering and medical diagnosis. Fu et al et al.: Robust Image Feature Extraction via Approximate Orthogonal Low-rank Embedding class and intra-class dispersion Both methods assume that the data obeys a Gaussian distribution. As a general classification algorithm, SR classification (SRC) [20] utilizes the sparsity in the recognition problem to efficiently improve the effect of face-recognition The key to this method is whether there are enough features and whether the sparse representation can be accurately obtained. As a recently proposed superior FE method, low-rank embedding (LRE) [35] can complete the latent embedding subspace search task while obtaining the optimal low-rank representation This method still has some defects in data reconstruction and noise separation, and as an unsupervised method, its application range is limited.

RELATED WORKS
CORRENTROPY
LRR-BASED FE
PROBLEM FORMULATION
SOLUTION FOR AOLRE
COMPLEXITY ANALYSIS
SETTINGS
FACE RECOGNITION USING THE YALEB DATASET
FACE RECOGNITION USING THE AR DATASET
FACE RECOGNITION USING THE ORL DATASET
DIGIT RECOGNITION USING THE USPS DATASET
OBJECT RECOGNITION USING THE COIL-20
EXPERIMENTAL ANALYSIS
PARAMETERS SENSITIVITY AND CONVERGENCE
COMPUTATIONAL PERFORMANCE
Findings
CONCLUSIONS

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

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.