A structured multi-view hessian regularized sparse feature selection method
A sparse feature and feature selection technology, applied in instrument, computing, character and pattern recognition, etc., can solve the problems of not taking into account the characteristics of multi-view data, ignoring the correlation and complementary characteristics of different views, and achieve good feature selection. performance, the effect of improving performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0052] The structured multi-view Hessian regularization sparse feature selection method of the present invention will be described in detail below in conjunction with the accompanying drawings, including the following steps:
[0053] 1) Collect the underlying visual features of n original images to obtain m view image feature matrices, where,
[0054] The m view image feature matrices are:
[0055] X=(X v ) m×1 =[X 1 ,X 2 ,...,X m ] T ∈R d×n ,
[0056] In the formula (1), the d v is the feature dimension of the vth view image; the X v is the feature matrix of the vth view image, and In the formula (2), x 1 v ,x 2 v ...,x l v is the feature vector of the l labeled image under the vth view in the n original images, x l+1 v ,...,x n v Be the feature vector of n-l unlabeled images under the vth view in the n original images;
[0057] In the step 1), the underlying visual features include: color correlation map, wavelet texture and edge direction histogram, ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


