Method for solving linear discrimination vector in matrix rank spaces of between-class scatter and total scattering
A linear identification and classification technology, applied in character and pattern recognition, instruments, computer parts, etc., can solve the problem of difficulty in searching all the best identification vectors, and achieve the effect of improving the identification ability and eliminating redundancy.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0037] The public AT&T standard face image database is used. The AT&T library includes 40 face categories, and each face category has 10 face images with different facial poses, expressions and facial details, and the image size is 112×92.
[0038] Data preprocessing: downsampling the 112×92 image matrix to a size of 28×23. Straighten by row into a 644-dimensional column vector, and normalize the pixel values of the image between 0-1. Each type of face sample is randomly divided into two parts, one part is used as a training sample and the other part is used as a test sample.
[0039] There are samples of C=40 categories, and the number of training samples of the i-th category is N i , N i The value range is N i =2,3,4,5,6,7,8,9, where i=1,2...,40, the total number of samples is First construct matrices A, B and D:
[0040] Construct a matrix A with N rows and N-1 columns as
[0041] A = - ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 