Low-rank discriminant feature subspace learning method
A technology of feature subspace and learning method, applied in the field of low-rank discriminative feature subspace learning, can solve the problems of neglect and consideration, and achieve the effect of ensuring convergence and solving the objective function
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0052] The present invention will be described in detail below in conjunction with the accompanying drawings.
[0053] A low-rank discriminative feature subspace learning method, comprising the following steps:
[0054] Step a, an image dataset is divided into a test set and a training set;
[0055] Step b, defining the objective function of the discriminant feature subspace learning model,
[0056]
[0057] Among them, X=[X 1 ,X 2 ,...,X m ] represents the training set, X i (i=1,2,...,m) represents each column of X, m represents the total number of training samples, Z represents the matrix, P represents the feature subspace, E represents the error matrix, and λ is a parameter to balance the three terms, x jAlso denote each column of X, Z ij represents each element in the matrix Z, P T Represents the transposition of the matrix P; the first item in the objective function imposes a low-rank constraint on the matrix, and the second item is a discriminative regularizat...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


