As an effective feature extraction method, locality sensitive discriminant analysis (LSDA) utilizes the neighbor relationship of data to characterize the manifold structure of data and uses label information of data to adapt to classification tasks. However, the performance of LSDA is affected by outliers and the destruction of local structure. Aiming at solving the limitations of LSDA, a locality sensitive discriminant projection (LSDP) algorithm is proposed. LSDP minimizes the distance of intraclass neighbor samples to maintain local structure and minimizes the intraclass non-neighbor samples to increase the compactness of intraclass samples after projection. The problem of outliers is alleviated by increasing the compactness of intraclass samples in subspace. At the same time, we redefine the weights of interclass neighbor samples to maintain the neighbor relationship of different labels samples. Holding the local structure of interclass samples maintains the manifold structure of data. Experiments on face datasets demonstrate the effectiveness of the LSDP algorithm. |
ACCESS THE FULL ARTICLE
No SPIE Account? Create one
CITATIONS
Cited by 11 scholarly publications.
Databases
Detection and tracking algorithms
Feature extraction
Principal component analysis
Facial recognition systems
Statistical analysis
Computing systems