Prof. Luhong Diao Profile

Prof. Luhong Diao

at Beijing Univ of Technology

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 9 August 2018 Paper

ReLU for sub space approximation and its application in dimension reduction

Xin Zhang, Luhong Diao

Proceedings Volume 10806, 108066A (2018) https://doi.org/10.1117/12.2503025

KEYWORDS: Reconstruction algorithms, Feature extraction, Principal component analysis, Detection and tracking algorithms, Dimension reduction, Autoregressive models, Neural networks, Facial recognition systems, Analytical research

Read Abstract +

In this paper, we first analyze the current research status of the dimension reduction algorithm, especially the subspace learning. We find that the global subspace learning algorithm is based on the assumption that the data is distributed in the same space, so that the samples contained in different subspaces are not well represented. In order to overcome this shortcoming, Researchers have proposed the methods of local linear subspace learning to model the manifold. But no matter what kind of algorithms we use, we must determine whether the samples are contained in different subspaces. If samples are contained in different subspaces, the number of subspaces often needs to be given. It greatly restricts the flexibility and performance of these algorithms. For the above problems, inspired by activation function in neural network, an adaptive local subspace learning method is proposed in this paper. Meanwhile the method of similarity calculation between samples is given, so that the subspace learning of the sample doesn’t need to consider whether samples exists in a number of different subspaces. Through experiments of performance analysis, it can be proved that the subspace learned by the algorithm can be better at representing the adjacency relation among samples in manifold. Experiments of recognition and reconstruction on face database verify the effectiveness and robustness of the proposed feature extraction method on high-dimensional data samples

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years