A High-Resolution Multi-temporal Remote Sensing Image Classification Method Based on Multi-Connection Decision Manifold Alignment
A high-resolution, remote-sensing image technology, which is applied in the directions of instruments, calculations, character and pattern recognition, etc., can solve the problems of spectral aliasing, few spectral bands, and low accuracy of multi-time relative alignment classification, so as to expand the application scope and improve the capabilities, to achieve the effect of deepening utilization
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0029] Specific implementation mode one: combine figure 1 To illustrate this embodiment, the specific process of a high-resolution multi-temporal remote sensing image classification method based on multi-connection decision manifold alignment in this embodiment is as follows:
[0030] Step 1. Input the spectral matrices A and B of all spatial points in the source phase and the target phase, and the corresponding category label vector Y of each row in A;
[0031] Step 2. Calculate the similarity matrix W between A, B and each row in A and B respectively 1 , W 2 and W 12 ;
[0032] Step 3. Calculate W through multi-connection decision-making 1 , W 2 The corresponding source-time-phase single-connection Laplacian graph G 1 , target phase multi-connected Laplacian graph G 2 , and the source-phase and target-phase single-connection similarity matrix W 12 Multi-connection decision-making optimization;
[0033] Step 4, put A, B, G 1 , G 2 and W 12 Input into the independe...
specific Embodiment approach 2
[0035] Specific embodiment 2: The difference between this embodiment and specific embodiment 1 is: in the step 2, calculate the similarity matrix W between A, B and each row in A and B 1 , W 2 and W 12 ; The specific process is:
[0036]
[0037]
[0038]
[0039] In the formula, W respectively 1 , W 2 and W 12The elements in row i and column j of , σ is the control parameter of similarity; A i,: For all elements of the i-th row of the matrix A, A j,: For all elements of the jth row of the matrix A, B i,: For all elements of the i-th row of the matrix B, B j,: is all the elements of the jth row of the matrix B, and : is all the columns of the ith row.
[0040] Other steps and parameters are the same as those in Embodiment 1.
specific Embodiment approach 3
[0041] Specific implementation mode three: combination Figure 2a , Figure 2b , Figure 2c Describe this implementation mode. The difference between this implementation mode and the specific implementation mode 1 or 2 is that in the step 3, W is calculated by means of multi-connection decision-making. 1 , W 2 The corresponding source-time-phase single-connection Laplacian graph G 1 , target phase multi-connected Laplacian graph G 2 , and the source-phase and target-phase single-connection similarity matrix W 12 Multi-connection decision-making optimization; the specific process is:
[0042] Step 31, in turn for W 1 Each row of performs the following operations: find W 1 The first p values sorted from large to small in the i-th row, and find the corresponding label of the position of the p value in the label vector Y, count the label category with the most occurrences among the p labels that appear, and then find The maximum position t of the similarity value of the ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


