Rotating forest hyperspectral image classification method based on weighting
A technology of hyperspectral images and classification methods, applied in the fields of instruments, character and pattern recognition, computer components, etc., can solve the problems of ignoring potential, increasing the computational complexity of algorithms, and reducing the integration performance of algorithms, so as to improve the integration performance, improve the The effect of classification accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0020] Hyperspectral images contain rich spectral information and can effectively reflect the information of imaging targets. Therefore, they are widely used in precision agriculture, environmental monitoring, military reconnaissance and other fields. In these applications, hyperspectral image classification is one of the important links, and the ultimate goal of classification is to accurately give each pixel in the image a unique category identifier. The RoF algorithm is one of many classification algorithms. The RoF algorithm generates a sparse rotation matrix by using a feature extraction algorithm, and projects the original image into a different coordinate system, so that the constructed base classifier has a strong difference. Compared with algorithms such as bagging, AdaBoost and RFs, the RoF algorithm can improve the classification accuracy of hyperspectral image samples. However, in the RoF algorithm, all training samples are given the same weight, ignoring the pote...
Embodiment 2
[0032] Based on weighted rotating forest hyperspectral image classification method with embodiment 1, the establishment in step (4) is based on weighted rotating forest model, see figure 2 , including the following steps:
[0033] (4a) Initialize the decision tree base classifier: introduce the rotation forest model, the basic structure of the introduction rotation forest model is to assume that the weighted rotation forest model is composed of T decision tree base classifiers, and set the sequence number of the decision tree base classifier as t, t=1,2,...,T, T decision tree base classifiers are arranged in sequence, and trained according to the sequence, initialize the sequence number t=1 of the decision tree base classifier, and start the iteration of training the decision tree base classifier . After initializing the serial number of the decision tree base classifier, the diversity training sample set, the feature subset, the diversity training sample subset, and the rot...
Embodiment 3
[0046] Weighted rotation forest hyperspectral image classification method based on embodiment 1-2, update sample weight W(x described in step (4h) i ):
[0047]
[0048]
[0049] Among them, t represents the sequence number of the decision tree base classifier after current training, q represents the sequence number of the trained decision tree base classifier, q=1,2,...,t, ξ q (x i ) represents the qth trained decision tree base classifier ξ q For sample x i The classification result of Y t (x i ) represents the diversity training sample set S t Corresponding to sample x in i Tag of.
[0050] The RoF algorithm has the problem of treating all training samples as equal and ignoring the potential of samples containing important information. This invention provides an improved technical solution. By designing a dynamic weighting function, the potential of samples containing important information is tapped and the samples are weighted. . In the present invention, th...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


