English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

According to the error approximation problem the sparse preserving projections (SPP) reconstruct the original sample. This paper proposes the algorithms based on orthogonal sparse preserving projections of kernel. In order to get sparse representation coefficients that contain more identification information by kernel method, it mapped samples to highdimensional feature space to. Then, reconstructing sparse coefficient of kernel sparse representation increase the similar non neighbor sample weight, and reduce heterogeneous neighbor sample weight. Finally, the whole orthogonal constraint transformation improve the ability of sparse retain sample. The algorithm experiments were carried out on the YALE_B and ORL face database, and the recognition rate reached 96.3%, and the results verify the effectiveness and robustness of the algorithm.

Face Recognition Algorithms Based on Orthogonal Sparse Preserving Projections of Kernel