METHOD AND DEVICE FOR GENERATING SATELLITE REMOTE-SENSING IMAGE WITH HIGH SPATIAL, TEMPORAL AND SPECTRAL RESOLUTIONS

Abstract
A method and device for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions is provided. The method includes: fusing a multispectral image with high temporal and spatial resolutions but a low spectral resolution and a hyperspectral image with a high spectral resolution but low temporal and spatial resolutions to generate a fused image with high spatial, temporal and spectral resolutions. Compared with a current spatial-temporal-spectral integrated fusion method, the proposed method is more in line with resolution characteristics of current mainstream satellite-borne remote-sensing data and can achieve high-fidelity fusion performance.
Description
TECHNICAL FIELD

The present disclosure relates to the field of optical remote-sensing images, and more specifically, to a method and device for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions.


BACKGROUND

Remote sensing has characteristics of real-time, accurate, and continuous acquisition of large-scale earth surface information, and has enormous application value. It has been widely used in various fields, such as natural resource monitoring, environmental monitoring, mineral identification, precision agriculture, and other fields. However, due to limitations of imaging sensor technologies and costs, a satellite sensor has to make a trade-off between spatial, temporal and spectral resolutions, and it is very difficult to obtain data with high spatial, temporal and spectral resolutions. This limits further application of current remote-sensing data in many fields. As a result, there is more available remote-sensing data, but a relative proportion of data that can be truly used is still low.


In current satellite remote-sensing imaging, a hyperspectral image has a high spectral resolution, but has lower spatial and temporal resolutions than a multispectral image. However, a spectral resolution of the multispectral image is relatively low, and there are generally less than ten bands. China's hyperspectral satellite ZY-1 02D was launched in 2020, and its hyperspectral sensor can capture 166 spectral bands with a spatial resolution of 30 meters, and its revisit period is 55 days. A low spatial resolution (usually 30 m) and a long revisit period (longer than 15 days) make it difficult to finely monitor a rapidly changing scenario based on existing hyperspectral satellite data. Compared with the hyperspectral sensor, a multispectral sensor typically has higher spatial and temporal resolutions. For example, the twin satellites Sentinel-2 a/b launched in 2015 and 2017 can access the earth surface with a 5-day revisit period, providing 4-band data with a spatial resolution of 10 meters. A short revisit period and a fine spatial resolution of the multispectral satellite make it possible to perform rapid monitoring with a long timing sequence, but a small quantity of bands make it difficult to accurately identify a surface feature. Remote-sensing image fusion, as an information processing technology, can systematically synthesize two or more remote-sensing images with complementary information in a same region to generate an image that provides more visual perception and computer processing information than a single image that can be obtained. The remote-sensing image fusion has become one of main means to improve a spatial/temporal/spectral resolution of a single-source satellite. However, current remote-sensing image fusion methods mainly focus on fusion of two of three resolution attributes of a remote-sensing sensor (spatial-spectral fusion, and temporal-spatial fusion). The only few spatial-temporal-spectral fusion methods are mostly used to fuse hyperspectral images having a high temporal resolution, without considering a resolution characteristic of a current satellite-borne remote-sensing image, that is, a characteristic that the spatial and temporal resolutions of the hyperspectral image are lower than those of the multispectral image.


Therefore, based on resolution characteristics of the current remote-sensing data, it is of great significance for the further application of remote sensing data to carry out the research on a multi-source remote-sensing spatial-temporal-spectral collaborative fusion method, which integrates complementary advantages of spatial, temporal and spectral resolutions of a multi-source remote-sensing image and generates image data with high spatial, temporal and spectral resolutions through fusion.


SUMMARY

In order to overcome shortcomings that a current remote-sensing image fusion method insufficiently considers resolution characteristics of current remote-sensing data and cannot fully leverage a collaborative advantage of current multi-source remote-sensing data to generate data with high spatial, temporal and spectral resolutions, the present disclosure provides a method and device for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions to obtain the data with high spatial, temporal and spectral resolutions.


According to a first aspect, a method for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions is provided, including:

    • step 1: obtaining a hyperspectral image H1 and a multispectral image M1 at a time point T1, and a multispectral image M2 at a time point T2, and performing preprocessing to obtain an upsampled hyperspectral image Ĥ1;
    • step 2: based on a local linear constraint, searching for an adjacent similar full-band block M1i,j,k) in the multispectral image M1 to represent an image block centered at (i, j) in the multispectral image M2, and obtaining a representation weight function of the similar full-band block; and sharing the representation weight function with the upsampled hyperspectral image Ĥ1 to obtain an upsampled hyperspectral image Ĥ2*custom-character at a prediction time point;
    • step 3: obtaining a time variation image represented as T=Ĥ2*−Ĥ1 for an initialized target fused image;
    • step 4: decomposing a target image X2 at the time point T2 into an endmember matrix E2 and an abundance matrix A2 based on a spectral linear mixed model, where X2=E2A2, and the target image X2 is an image with high spatial, temporal and spectral resolutions;
    • step 5: establishing observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions;
    • step 6: introducing a generalized linear mixed model, and representing the endmember matrix E2 as E2=PeE1, where the symbol e represents a Hadamard product of element-by-element multiplication, P represents a time variation matrix of the target image, and E1 represents an endmember matrix at the time point T1;
    • step 7: obtaining the abundance matrix A2, the time variation matrix P and a time variation image T of the target image; and
    • step 8: obtaining the target image finally by multiplying the endmember matrix E1 at the time point T1 by the time variation matrix P at the time point T2 element by element and then by the abundance matrix A2 with high resolution: X=(PeE1)A2.


Preferably, the step 1 includes:

    • step 1.1: obtaining the hyperspectral image H1custom-character and the multispectral image M1custom-character at the time point T1, and the multispectral image M2custom-character at the time point T2, where l and L represent quantities of bands, w and W represent quantities of pixels, l<L, and w<W;
    • step 1.2: normalizing the hyperspectral image H1 and the multispectral images M1 and M2, and upsampling a normalized hyperspectral image H1 to a spatial size of the multispectral image to obtain the Ĥ1custom-character; and
    • step 1.3: folding the multispectral images M1 and M2 and the upsampled hyperspectral image Ĥ1 into a three-dimensional form along a spectral dimension, and splitting the three-dimensional form into √{square root over (c)}×√{square root over (c)}×l full-band blocks with both a width and a height being √{square root over (c)} and the spectral dimension being l.


Preferably, in the step 5, the observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions are represented as follows:





Mi=RXi=REiAi





Hi=XiFS=EiAiFS


where i∈{1,2}; Xicustom-character, Hicustom-character, and Micustom-character respectively represent an image with high spatial, temporal and spectral resolutions, a hyperspectral image, and a multispectral image at a time point Ti; Ei∈z,186 and Aicustom-character respectively represent an endmember matrix and an abundance matrix of the image with high spatial, temporal and spectral resolutions at the time point Ti, Q represents a quantity of endmembers, and custom-character<<L; and R∈custom-character represents a spectral downsampling matrix, and F∈custom-character and S∈custom-character respectively represent a spatial blur matrix and a spatial downsampling matrix.


Preferably, the step 7 includes:

    • step 7.1: separately introducing a regularization term of the abundance matrix A2, a regularization term of the time variation matrix P and a regularization term of the time variation image T of the target image to obtain an energy function for a fusion problem;
    • step 7.2: splitting the energy function into three sub-functions corresponding to variables of the abundance matrix A2, the time variation matrix P and the time variation image T, introducing a plurality of auxiliary variables for each sub-function to split the sub-function into sub-problems, and constructing an augmented Lagrangian function for each sub-problem; and
    • step 7.3: using an alternating direction method of multipliers to perform optimal solving on the augmented Lagrangian function to obtain the abundance matrix A2, the time variation matrix P and the time variation image T of the target image.


Preferably, in the step 7.1, the energy function is represented as follows:








arg


min


A
2

,
P
,
T



1
2







M
2

-


R

(

PeE
1

)



A
2





2
2


+


1
2






D
-

R

(



(

PeE
1

)



A
2


-


E
1



A
1



)




2
2


+


1
2






RT
-
D



2
2


+


1
2






T
-

(



(

PeE
1

)



A
2


-


E
1



A
1



)




2
2


+

Φ

(

A
2

)

+

Φ

(
P
)

+

Υ

(
T
)






s
.
t
.

D

=


M
2

-

M
1







where D represents a differential image of the multispectral images M2 and M1. Preferably, the step 7.1 includes:

    • step 7.1.1: introducing the regularization term of the abundance matrix A2 of the target image, where the regularization term is a spatial smoothing constraint and represented as follows:







Φ

(

A
2

)

=



λ
A

2



(






H
h



A
2





2
,
1


+





H
v



A
2





2
,
1



)






where Hh and Hv represent linear operators respectively used to calculate horizontal and vertical gradients between components of adjacent pixels in a two-dimensional signal, ∥·∥2,1 represents a mixed L2,1 norm, and λA represents a regularization parameter of the abundance matrix A2;

    • step 7.1.2: introducing the regularization term of the time variation matrix P, where the regularization term is a spectral smoothing constraint and represented as follows:







Ψ

(
P
)

=




λ
1

2







H



P



F
2


+



λ
2

2






P
-


1
L



1
Q
T





F
2







where H1 represents a differential operator in a spectral dimension direction, 1L1QTcustom-character represents a matrix with all elements in L rows and Q columns being 1, and λ1 and λ2 represent regularization parameters of the time variation matrix P; and

    • step 7.1.3: introducing the regularization term of the time variation image T, where the regularization term is a low-rank constraint and represented as follows:







Υ

(
T
)

=


λ
T





𝒯


TNN






where custom-character represents a third-order tensor form of the T; ∥·∥TNN represents a tensor nuclear norm, with ∥custom-characterTNNi=13Σjσj(T(i) where σj(T(i)) represents a jth singular value of T(i), and T is obtained by performing Fourier transform on the T; and λT represents a regularization parameter of the time variation image T.


Preferably, in the step 7.2, a sub-problem of the abundance matrix A2 of the target image is as follows:







A
2

=


arg


min

A
2



1
2







M
2

-


R

(

Pe



E
1


)



A
2





2
2


+


1
2






D
-

R

(



(

Pe



E
1


)



A
2


-


E
1



A
1



)




2
2


+


η
2






T
-

(



(

Pe



E
1


)



A
2


-


E
1



A
1



)




2
2


+



λ
A

2



(






H
h



A
2





2
,

1


+





H
v



A
2





2
,

1



)







where η represents a term parameter of the time variation image and is used to control a contribution of the time variation image to a model; and

    • auxiliary variables B1=A2, B2=Hh(A1), and B3=Hv(A1) are introduced, u=vec(A2) is set, a symbol vec(·) represents a vectorization operation, and an augmented Lagrangian function for the sub-problem of the abundance matrix A2 is given as follows:









(

u
,

B
1

,

B
2

,

B
3

,

V
1

,

V
2

,

V
3


)

=



1
2







vec

(

M
2

)

-


rep
M

(


R

(

Pe



E
1


)


u

)




2
2


+


1
2







vec

(
D
)

-


rep
M

(

R

(



(

Pe



E
1


)


u

-

)

)

+

vec

(


E
1



A
1


)




2
2


+


η
2







vec

(
T
)

-


rep
M

(


(

Pe



E
1


)


u

)

+

vec

(


E
1



A
1


)




2
2


+


λ
A

(





B
2



2

+




B
3



2


)

+


ρ
2



(






vec

(

B
1

)

-
u
+

V
1




2
2

+





vec

(

B
2

)

-


H
h



vec

(

B
1

)


+

V
2




2
2

+





vec

(

B
3

)

-


H
v



vec

(

B
1

)


+

V
3




2
2


)







where a matrix Vi, i=1,2,3 represents a dual variable of a Lagrangian function; ρ represents a step size, where ρ>0; and repM(V) represents a block diagonal matrix of a matrix V and means copying the matrix V along a diagonal for M times.


Preferably, in the step 7.2, a sub-problem of the time variation matrix P of the target image is as follows:






P
=


arg


min
P


1
2







M
2

-


R

(

Pe



E
1


)



A
2





2
2


+


1
2






D
-

R

(



(

Pe



E
1


)



A
2


-


E
1



A
1



)




2
2


+


1
2






T
-

(



(

Pe



E
1


)



A
2


-


E
1



A
1



)




2
2


+



λ
1

2






P
-


1
L



1
Q





2
2


+



λ
2

2







H
l


P



2
2







an auxiliary variable B=PeE1 is introduced, and an augmented Lagrangian function for the sub-problem of the time variation matrix P is as follows:









(

B
,
P
,
V

)

=



1
2







M
2

-

R

B


A
2





2
2


+


1
2






D
-

R

(


B


A
2


-


E
1



A
1



)




2
2


+


η
2






T
-

(


B


A
2


-


E
1



A
1



)




2
2


+



λ
1

2






P
-


1
L



1
Q





2
2


+



λ
2

2







H
l


P



2
2


+


ρ
2



(




B
-

Pe



E
1


+
V



2
2

)







a sub-problem of the time variation image T of the target image is as follows:






T
=


arg




min

T



1
2






RT
-
D



2
2


+


1
2






T
-

(



(

Pe



E
1


)



A
2


-


E
1



A
1



)




2
2


+


λ
T





𝒯


TNN







an auxiliary variable custom-character=custom-character is introduced, and an augmented Lagrangian function for the sub-problem of the time variation image T is as follows: ?






T
=


arg


min
T


1
2






RT
-
D



2
2


+


1
2






T
-

(



(

Pe



E
1


)



A
2


-


E
1



A
1



)




2
2


+


λ
T









TNN

.







Preferably, in the step 2, the image block centered at the (i, j) in the multispectral image M2 is represented using the adjacent similar full-band block M1i,j,k) in the multispectral image









M
1

:



M
2

(

i
,
j

)


=





Ω

i
,

j
,

k




Ω

i
,

j






ω

i
,

j
,

k





M
1

(

Ω

i
,

j
,

k


)




,




where ωi,j,k represents a weight of a kth image block in the Ωi,j,k, and the ωi,j,k is obtained based on the local linear constraint:








min







M
2

(

i
,
j

)

-



M
1

(

Ω

i
,

j


)



ω

i
,

j






2


+

λ






d

i
,

j




ω

i
,

j





2








s
.
t
.


1
T




ω

i
,

j



=
1





where ωi,j represents a weight corresponding to the image block M2(i,j), ∥di,ji,j 2 represents a regularization term of the local linear constraint, di,j represents a Euclidean distance between a similar pixel and a center of M1(i,j), and λ represents a regularization term parameter; and a solution to an optimization problem of the local linear constraint is as follows:







ω

i
,

j


=


(


(


C

i
,

j


+

λ


diag


(

d

i
,

j


)



)

\
1

)




(


1
T



(


C

i
,

j


+

λ



diag

(

d

i
,

j


)



)

\
1

)


-
1







where Ci,j=(M1i,j)−M2(i,j)T)(M1i,j)−1M2(i,j)T)T represents a covariance matrix of the image block, diag (di,j) represents a diagonal matrix with di,j being a diagonal element; afterwards, the weight ωi,j obtained from the multispectral image is shared with the upsampled hyperspectral image Ĥ1 to generate the upsampled hyperspectral image








H
ˆ

2
*

=





Ω

i
,

j
,

k




Ω

i
,

j






ω

i
,

j
,

k






H
ˆ

1

(

Ω

i
,

j
,

k


)







at the prediction time point.


According to a second aspect, a device for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions is provided, which is configured to execute the method for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions according to any one first aspect, and includes:

    • a first obtaining module configured to obtain a hyperspectral image H1 and a multispectral image M1 at a time point T2, and a multispectral image M2 at a time point T2, and perform preprocessing to obtain an upsampled hyperspectral image Ĥ1;
    • a search module configured to: based on a local linear constraint, search for an adjacent similar full-band block M1i,j,k) in the multispectral image M1 to represent an image block centered at (i,j) in the multispectral image M2, and obtain a representation weight function of the similar full-band block; and share the representation weight function with the upsampled hyperspectral image Ĥ1 to obtain an upsampled hyperspectral image Ĥ2*custom-character at a prediction time point;
    • a second obtaining module configured to obtain a time variation image represented as T=Ĥ2*−Ĥ1 for an initialized target fused image;
    • a decomposition module configured to decompose a target image X2 at the time point T2into an endmember matrix E2 and an abundance matrix A2 based on a spectral linear mixed model, where X2=E2A2, and the target image X2 is an image with high spatial, temporal and spectral resolutions;
    • an establishment module configured to establish observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions;
    • a representation module configured to introduce a generalized linear mixed model, and represent the endmember matrix E2 as E2=PeE1, where the symbol e represents a Hadamard product of element-by-element multiplication, P represents a time variation matrix of the target image, and E1 represents an endmember matrix at the time point Ti;
    • a third obtaining module configured to obtain the abundance matrix A2, the time variation matrix P and a time variation image T of the target image; and
    • an obtaining module configured to obtain the target image finally by multiplying the endmember matrix E1 at the time point Ti by the time variation matrix P at the time point T2element by element and then by the abundance matrix A2 with high resolution: X=(PeE1)A2.


The present disclosure has following beneficial effects:


1. The present disclosure mainly focuses on fusing a hyperspectral remote-sensing image with low temporal and spatial resolutions and a multispectral remote-sensing image with high temporal and spatial resolutions. Compared with existing remote-sensing fusion methods, the present disclosure can fuse attributes of spatial, temporal and spectral resolutions at a time to generate a fused image with high spatial, temporal and spectral resolutions. In addition, a fusion task targeted by the present disclosure is more in line with resolution characteristics of current satellite-borne remote-sensing data.


2. A spatial-temporal-spectral fusion method established in the present disclosure provides a generalized fusion framework, including a time variation model and a resolution enhancement reconstruction model for a time variation image. The time variation model is used to depict and model a time variation between images, and the resolution enhancement reconstruction model accurately estimates and obtains the time variation by reconstructing a resolution-enhanced time variation image model. The time variation model and the resolution enhancement reconstruction model for the time variation image are coupled to achieve high-fidelity spatial-temporal-spectral fusion performance.


3. Based on a local linear constraint, the present disclosure represents a multispectral image M2 at prediction time T2 using a multispectral image M1 observed at observation time T1. After the image is divided into blocks, a similar block M1i,j,k) is searched for around a full-band block of M1(i,j) at a previous time point to represent a target block M2(i,j), so as to obtain a weight coefficient. The learned weight coefficient is shared with an upsampled hyperspectral image Ĥ1 observed at the T1 (observation time) to generate an upsampled hyperspectral image Ĥ2* at the prediction time. This fully utilizes a local self-similarity in a remote-sensing image to learn a time variation feature.


4. The present disclosure establishes a time variation image model. An initialized time variation image generated by Ĥ2 * and Ĥ1 includes a time variation characteristic of a target image between two time points, providing accurate time variation information and hyperspectral resolution information for subsequent estimation of the target image.


5. The present disclosure depicts the time variation based on a generalized linear mixed model, and then coupled with the resolution enhancement reconstruction model for the time variation image to propose a spatial-temporal-spectral fusion model. The estimation of the target image is transformed into estimation of an abundance matrix A2, a time variation matrix P and a time variation image T of the target image. The time variation matrix P in the generalized linear mixed model can capture the time variation of the target image, and the estimation of the time variation image T can serve as a constraint for obtaining the time variation.


6. The present disclosure introduces a spatial smoothing prior for abundance of the target image, a spectral smoothing prior for the time variation, and a low-rank prior for the time variation image model. The introduction of prior information enables the model to obtain an accurate solution, achieving a high-fidelity fused image X.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a schematic diagram of generating an initialized time variation image based on a local linear constraint according to the present disclosure; and



FIG. 2 is a schematic diagram of a spatial-temporal-spectral integrated fusion model according to the present disclosure.





DETAILED DESCRIPTION OF THE EMBODIMENTS

The present disclosure will be further described below with reference to embodiments. The following description of the embodiments is only for helping to understand the present disclosure. It should be noted that, several improvements and modifications may be made by a person of ordinary skill in the art without departing from the principle of the present disclosure, and these improvements and modifications should also fall within the protection scope of the present disclosure.


Embodiment 1

A spatial-temporal-spectral fusion problem addressed by the present disclosure is to predict target image X2custom-character with high spatial, temporal and spectral resolutions at prediction time T2 based on multispectral image M1custom-character (with l bands and W pixels) and hyperspectral image H1custom-character (with L bands and w pixels) that are observed at observation time T1, and multispectral image M2custom-character observed at the T2, where l<L, and w<W. A method provided in the present disclosure includes the following steps:


Step 1: Hyperspectral image H1 and multispectral image M1 at time point T1, and multispectral image M2 at time point T2 are obtained and preprocessed to obtain upsampled hyperspectral image Ĥ1.


The step 1 includes the following sub-steps:


Step 1.1: The hyperspectral image H1custom-character and the multispectral image M1custom-character at the time point T1, and the multispectral image M2custom-character at the time point T2 are obtained, where l and L represent quantities of bands, w and W represent quantities of pixels, l<L, and w<W.


Step 1.2: The hyperspectral image H1 and the multispectral images M1 and M2 are normalized, and normalized hyperspectral image H1 is upsampled to a spatial size of the multispectral image to obtain the Ĥ1 custom-character, where an upsampling method for the hyperspectral image H1 may be bilinear interpolation.


Step 1.3: The multispectral images M1 and M2 and the upsampled hyperspectral image Ĥ1 are folded into a three-dimensional form along a spectral dimension, and the three-dimensional form is split into √{square root over (c)}×√{square root over (c)}×l full-band blocks.


Step 2: Based on a local linear constraint, adjacent similar full-band block M1i,j,k) in the multispectral image M1 is searched for to represent an image block centered at (i, j) in the multispectral image M2, and a representation weight function of the similar full-band block is obtained; and the representation weight function is shared with the upsampled hyperspectral image Ĥ1 to obtain upsampled hyperspectral image Ĥ2*custom-character at a prediction time point.


In the step 2, the image block centered at the (i,j) in the multispectral image M2 is represented using the adjacent similar full-band block M1i,j,k) in the multispectral image M1:









M
2

(

i
,
j

)

=





Ω

i
,

j
,

k




Ω

i
,

j






ω

i
,

j
,

k





M
1

(

Ω

i
,

j
,

k


)




,




where ωi,j,k represents a weight of a kth image block in the Ωi,j,k, and the ωi,j,k is obtained based on the local linear constraint:








min







M
2

(

i
,
j

)

-



M
1

(

Ω

i
,

j


)



ω

i
,

j






2


+

λ






d

i
,

j



e



ω

i
,

j





2








s
.
t
.


1
T




ω

i
,

j



=
1





where ωi,j represents a weight corresponding to the image block M2(i,j), ∥di,ji,j2 represents a regularization term of the local linear constraint, di,j represents a Euclidean distance between a similar pixel and a center of M1(i,j), and λ represents a regularization term parameter; and a solution to an optimization problem of the local linear constraint is as follows:







ω

i
,

j


=


(


(


C

i
,

j


+

λ



diag

(

d

i
,

j


)



)

\
1

)




(


1
T



(


C

i
,

j


+

λ



diag

(

d

i
,

j


)



)

\
1

)


-
1







where Ci,j=(M1i,j)−M2(i,j)T)(M1i,j)−1M2(i,j)T)T represents a covariance matrix of the image block, diag(di,j) represents a diagonal matrix with di,j being a diagonal element; afterwards, the weight ωi,j obtained from the multispectral image is shared with the upsampled hyperspectral image Ĥ1 to generate the upsampled hyperspectral image








H
ˆ

2
*

=





Ω

i
,

j
,

k




Ω

i
,

j






ω

i
,

j
,

k






H
ˆ

1

(

Ω

i
,

j
,

k


)







at the prediction time point.


Step 3: A time variation image represented as T=Ĥ2*−Ĥ1 is obtained for an initialized target fused image.


Step 4: Target image X2 at the time point T2 is decomposed into endmember matrix E2 with retained spectral information and abundance matrix A2 with retained spatial information of the target image based on a spectral linear mixed model, where X2=E2A2, and the target image X2 is an image with high spatial, temporal and spectral resolutions.


Step 5: Observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions are established.


In the step 5, the observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions are represented as follows:





Mi=RXi=REiAi





Hi=XiFS=EiAiFS


where i∈{1,2}; Xicustom-character, Hicustom-character, and Micustom-character respectively represent an image with high spatial, temporal and spectral resolutions, a hyperspectral image, and a multispectral image at a time point Ti; Eicustom-character and Aicustom-character respectively represent an endmember matrix and an abundance matrix of the image with high spatial, temporal and spectral resolutions at the time point Ti, Q represents a quantity of endmembers, and custom-character<<L; and R∈custom-character represents a spectral downsampling matrix, and F∈custom-character and S∈custom-character respectively represent a spatial blur matrix and a spatial downsampling matrix.


Step 6: A generalized linear mixed model is introduced, and the endmember matrix E2 is represented as E2=PeE1, where the symbol e represents a Hadamard product of element-by-element multiplication, P represents a time variation matrix of the target image, and E1 represents an endmember matrix at the time point T1.


In the step 6, after the generalized linear mixed model is introduced, an estimation problem of the target image X2 is transformed into estimation of the abundance matrix A2 of the target image and the time variation matrix P of the target image.


Step 7: The abundance matrix A2, the time variation matrix P, and time variation image T of the target image are obtained.


In the step 7, initialized T is obtained based on T(0)2*−Ĥ1. Initialized E1 is extracted from the hyperspectral image H1 by using an endmember extraction algorithm. The time variation matrix P is initialized as P(0)=1L1QT. Initialized abundance A2 of the target image is obtained by classifying the multispectral image M2 or by spectral unmixing.


The step 7 includes the following sub-steps:


Step 7.1: A regularization term of the abundance matrix A2, a regularization term of the time variation matrix P and a regularization term of the time variation image T of the target image are separately introduced to obtain an energy function for a fusion problem.


In the step 7.1, the energy function is represented as follows:







arg

min


A
2

,
P
,
T



1
2







M
2

-


R

(

P

e


E
1


)



A
2





2
2


+


1
2






D
-

R

(



(

P

e


E
1


)



A
2


-


E
1



A
1



)




2
2


+


1
2






RT
-
D



2
2


+


1
2






T
-

(



(

P

e


E
1


)



A
2


-


E
1



A
1



)




2
2


+

Φ

(

A
2

)

+

Ψ

(
P
)

+

Υ

(
T
)








s
.
t
.

D

=


M
2

-

M
1






The step 7.1 includes the following sub-steps:


Step 7.1.1: The regularization term of the abundance matrix A2 of the target image is introduced, where the regularization term is a spatial smoothing constraint and represented as follows:







Φ

(

A
2

)

=



λ
A

2



(






H
h



A
2





2
,
1


+





H
v



A
2





2
,
1



)






where Hh and Hv represent linear operators respectively used to calculate horizontal and vertical gradients between components of adjacent pixels in a two-dimensional signal, ∥·∥2,1 represents a mixed L2,1 norm, and λA represents a regularization parameter of the abundance matrix A2.


Step 7.1.2: The regularization term of the time variation matrix P is introduced, where the regularization term is a spectral smoothing constraint and represented as follows:







Ψ

(
P
)

=




λ
1

2







H



P



F
2


+



λ
2

2






P
-


1
L



1
Q
T





F
2







where H1 represents a differential operator in a spectral dimension direction, and λ1 and λ2 represent regularization parameters of the time variation matrix P.


Step 7.1.3: The regularization term of the time variation image T is introduced, where the regularization term is a low-rank constraint and represented as follows:







Υ

(
T
)

=


λ
T





𝒯



T

N

N







where custom-character represents a third-order tensor form of the T; ∥·∥TNN represents a tensor nuclear norm, with ∥custom-characterTNNi=13Σjσj(T(i)), where σj(T(i)) represents a jth singular value of T, and T is obtained by performing Fourier transform on the T; and λT represents a regularization parameter of the time variation image T.


In the step 7.1, the present disclosure couples a generalized spectral linear mixed model and a time variation image reconstruction model, and introduces the abundance matrix A2, the time variation matrix P of the target image, and a prior term of reconstructed time variation image T to construct a spatial-temporal-spectral fusion model.


Step 7.2: The energy function is split into three sub-functions corresponding to variables of the abundance matrix A2, the time variation matrix P and the time variation image T, a plurality of auxiliary variables are introduced for each sub-function to split the sub-function into sub-problems, and an augmented Lagrangian function is constructed for each sub-problem.


In the step 7.2, a splitting strategy used in the present disclosure is to separately solve one of the variables while fixing the other two variables, and use an alternating least squares method to minimize a loss function corresponding to each variable, in order to obtain a local stationary point.


In the step 7.2, a sub-problem of the abundance matrix A2 of the target image is as follows:







A
2

=


arg

min

A
2



1
2







M
2

-


R

(

P

e


E
1


)



A
2





2
2


+


1
2






D
-

R

(



(

P

e


E
1


)



A
2


-


E
1



A
1



)




2
2


+


η
2






T
-

(



(

P

e


E
1


)



A
2


-


E
1



A
1



)




2
2


+



λ
A

2



(






H
h



A
2





2
,
1


+





H
v



A
2





2
,
1



)







auxiliary variables B1=A2, B2=Hh(A1), and B3=Hv(A1) are introduced, u=vec(A2) is set, symbol vec(·) represents a vectorization operation, and an augmented Lagrangian function for the sub-problem of the abundance matrix A2 is given as follows:









(

u
,

B
1

,

B
2

,

B
3

,

V
1

,

V
2

,

V
3


)

=



1
2







ve


c

(

M
2

)


-


rep
M

(


R

(

P

e


E
1


)


u

)




2
2


+


1
2







ve


c

(
D
)


-


rep
M

(

R

(



(

P

e


E
1


)


u

-

)

)

+

v

e


c

(


E
1



A
1


)





2
2


+


η
2







ve


c

(
T
)


-


rep
M

(


(

P

e


E
1


)


u

)

+

v

e


c

(


E
1



A
1


)





2
2


+


λ
A

(





B
2



2

+




B
3



2


)

+


ρ
2



(






ve


c

(

B
1

)


-
u
+

V
1




2
2

+





ve


c

(

B
2

)


-


H
h


v

e


c

(

B
1

)


+

V
2




2
2

+





ve


c

(

B
3

)


-


H
v


v

e


c

(

B
1

)


+

V
3




2
2


)







where matrix Vi, i=1,2,3 represents a dual variable of a Lagrangian function; ρ represents a step size, where ρ>0; and repM(V) represents a block diagonal matrix of matrix V and means copying the matrix V along a diagonal for M times.


The present disclosure splits a solution of a Lagrangian function of the abundance matrix A2 into sub-problems about variables u, B1,B2,B3,V1,V2,V3.


The sub-problem of the variable u of the abundance matrix A2 is as follows:







u


arg

min
u




(

u
,

B
1

,

B
2

,

B
3

,

V
1

,

V
2

,

V
3


)



=


arg

min
u


1
2







ve


c

(

M
2

)


-


rep
M

(


R

(

P

e


E
1


)


u

)




2
2


+


1
2







ve


c

(
D
)


-


rep
M

(

R

(


(

P

e


E
1


)


u

)

)

+

v

e


c

(


E
1



A
1


)





2
2


+


η
2







ve


c

(
T
)


-


rep
M

(


(

P

e


E
1


)


u

)

+

v

e


c

(


E
1



A
1


)





2
2


+


ρ
2







ve


c

(

B
1

)


-
u
+

V
1




2
2







A solution to the above equation is: u*=Ω1−1Ω2, where Ω1 and Ω2 are given according to the following equations:







Ω
1

=


2



(

R

(

P

e


E
1


)

)

T



R

(

P

e


E
1


)


+



η

(

P

e


E
1


)

T



(

P

e


E
1


)


+

ρ

I









Ω
2

=




(

R

(

P

e


E
1


)

)

T



(


M
2

+
D
+

H
1


)


+



(

P

e


E
1


)

T



(

T
+


E
1



A
1



)


+

ρ

(


B
1

+

V
1


)






The sub-problem of the variable B1 of the abundance matrix A2 is as follows:








B
1



arg

min

B
1





(

u
,

B
1

,

B
2

,

B
3

,

V
1

,

V
2

,

V
3


)



=

arg

min

B
1



ρ
2



(






ve


c

(

B
1

)


-
u
+

V
1




2
2

+





ve


c

(

B
2

)


-


H
h


v

e


c

(

B
1

)


+

V
2




2
2

+





ve


c

(

B
3

)


-


H
v


v

e


c

(

B
1

)


+

V
3




2
2


)






A solution to the above equation is:







v

e


c

(

B
1

)


=



(

I
+


H
h
T



H
h


+


H
v
T



H
v



)


-
1




(

u
-

V
1

+


H
h
T


v

e


c

(

B
2

)


+


H
v
T



V
2


+


H
v
T


v

e


c

(

B
3

)


+


H
v
T



V
3



)






The symbol vec(·) in the above equation represents an operator that converts a matrix into a vector.


The sub-problem of the variable B2 of the abundance matrix A2 is as follows:








B
2



arg

min

B
2





(

u
,

B
1

,

B
2

,

B
3

,

V
1

,

V
2

,

V
3


)



=


arg

min

B
2




λ
A

2







H
h



A
2





2
,
1



+





ve


c

(

B
2

)


-


H
h


v

e


c

(

B
1

)


+

V
2




2
2






A solution to the above equation is equivalent to a proximal operator of an L2 norm. This solution can be obtained by using a soft-threshold operator, which is expressed as follows:







B
2
*

=


soft


λ
A

/
ρ


(



H
h


v

e


c

(

B
1

)


+

V
2


)





In the above equation, the soft-threshold operator is defined as follows:








soft
a

(
b
)

=

{






max

(


1
-

a


b




,
0

)


b

,




b

0






0
,




b
=
0









The sub-problem of the variable B3 of the abundance matrix A2 is as follows:








B
3



arg

min

B
3





(

u
,

B
1

,

B
2

,

B
3

,

V
1

,

V
2

,

V
3


)



=


arg

min

B
3




λ
A

2







H
h



A
2





2
,
1



+





ve


c

(

B
2

)


-

(

B
1

)

+

V
2




2
2






Similar to an optimization strategy of the sub-problem of the B2, a solution is obtained by a soft threshold:







B
3
*

=


soft


λ
A

/
ρ


(



H
v



vec

(

B
1

)


+

V
3


)





An update rule for the dual variable of the variable of the abundance matrix A2 is as follows:







V
1




V
1

+

vec

(

B
1

)

-
u








V
2




V
2

+

v

e


c

(

B
2

)


-


H
h


v

e


c

(

B
1

)










V
3




V
3

+

v

e


c

(

B
3

)


-


H
v


v

e


c

(

B
1

)







A sub-problem of the time variation matrix P of the target image is as follows:






P
=


arg


min
P


1
2







M
2

-


R

(

PeE
1

)



A
2





2
2


+


1
2






D
-

R

(



(

PeE
1

)



A
2


-


E
1



A
1



)




2
2


+


1
2






T
-

(



(

PeE
1

)



A
2


-


E
1



A
1



)




2
2


+



λ
1

2






P
-


1
L



1
Q





2
2


+



λ
2

2







H
l


P



2
2







Auxiliary variable B=PeE1 is introduced, and an augmented Lagrangian function for the sub-problem of the time variation matrix P is as follows:









(

B
,
P
,
V

)

=



1
2







M
2

-

RBA
2




2
2


+


1
2






D
-

R

(


BA
2

-


E
1



A
1



)




2
2


+


η
2






T
-

(


BA
2

-


E
1



A
1



)




2
2


+



λ
1

2






P
-


1
L



1
Q





2
2


+



λ
2

2







H
l


P



2
2


+


ρ
2



(




B
-

PeE
1

+
V



2
2

)







The present disclosure splits a solution of the augmented Lagrangian function of the time transformation P into sub-problems about variables B, P, V.


The sub-problem of the variable B of the time transformation P is as follows:







B


arg


min
B




(

B
,
P
,
V

)



=


arg


min
B


1
2







M
2

-

RBA
2




2
2


+


1
2






D
-

R

(


BA
2

-

Y
1


)




2
2


+


1
2






T
-

(


BA
2

-

Y
1


)




2
2


+


ρ
2



(




B
-

PeE
1

+
V



2
2

)







A solution to the above equation is:









(


2


R
T


R

+
1

)



BA
2



A
2
T


+

ρ

B


=




R
T

(


M
2

+
D
+


RE
1



A
1



)



A
2
T


+


(

T
+


E
1



A
1



)



A
2
T


+

ρ

(


PeE
1

-
V

)






The above equation forms a Silvestre equation, which can be solved using command X=dlyap(A,B,C) in matlab.


The sub-problem of the variable P of the time transformation P is as follows:







P


arg


min
P




(

B
,
P
,
V

)



=


arg


min
P



λ
1

2






P
-


1
L



1
Q





2
2


+



λ
2

2







H
l


P



2
2


+


ρ
2



(




B
-

PeE
1

+
V



2
2

)







The above equation is rewritten into a form of a vector for solving:







P
*

=

invec
(



λ
1


1

+








ρ


vec

(

(



E
1


eB

+


E
1


eV


)

)

/

(



λ
1


I

+


λ
2




rep
Q

(


H
L
T



H
L


)


+

ρ


diag

(

vec

(


E
1



eE
1


)

)



)





An update rule for a dual variable of the time transformation P is as follows:






V


V
+
B
-

PeE
1






A sub-problem of the time variation image T of the target image is as follows:






T
=


arg


min
T


1
2







?

-
D



2
2


+


1
2






T
-

(



(

PeE
1

)



A
2


-


E
1



A
1



)




2
2


+


λ
T





𝒯


TNN










?

indicates text missing or illegible when filed




Auxiliary variable custom-character=custom-character is introduced, and an augmented Lagrangian function for the sub-problem of the time variation image T is as follows:






T
=


arg


min
T


1
2






RT
-
D



2
2


+


1
2






T
-

(



(

PeE
1

)



A
2


-


E
1



A
1



)




2
2


+


λ
T








TNN







The present disclosure splits a solution of a Lagrangian function of the time variation image T into sub-problems about variables custom-character, custom-character, custom-character, where the custom-character, custom-character, custom-character respectively represent third-order tensor forms of matrices T, B, V.


The sub-problem of the variable custom-character of the time variation image T is as follows:









𝒯



arg


min





(

𝒯
,

,
𝒱

)








=



arg


min
𝒯


1
2






RT
-
D



2
2


+


1
2






T
-

(



(

PeE
1

)



A
2


-


E
1



A
1



)




2
2


+


ρ
2



(





-
𝒯
+
𝒱



2
2

)










The custom-character, custom-character, custom-character are expanded into matrices, and ∂custom-character/∂T is set to be equal to 0 to obtain an equation for solving the T:







T
*

=



(



1

1
+
ρ




R
T


RT

+
1

)


-
1




(


1

1
+
ρ




(



R
T


D

+

η

(



(

PeE
1

)



A
2


-


E
1



A
1



)

+

ρ

(

B
+
V

)


)


)






The sub-problem of the variable custom-character of the time variation image T is as follows:










arg


min





(

𝒯
,

,
𝒱

)



=


arg


min



ρ
2







-
𝒯
+
𝒱



2
2


+


λ
T








TNN







A solution to the above equation is:








B
*

=




i
=
1

3



fold
i

(


S


ρ

λ
T


,
ε


(

B
+
V

)

)



,


where




S


ρ

λ
T


,
ε


(
·
)


=


U

(

Σ
-


ρ

λ
T




diag

(
ε
)



)



V
T







represents a singular value contraction operator, and UΣVT represents a singular value decomposition process.


An update rule for a dual variable of the time transformation T is as follows:






𝒱


𝒱
+

-
𝒯





Step 7.3: An alternating direction method of multipliers is used to perform optimal solving on the augmented Lagrangian function to obtain the abundance matrix A2, the time variation matrix P and the time variation image T of the target image.


Step 8: The target image is finally obtained by multiplying the endmember matrix E1 at the time point T1 by the time variation matrix P at the time point T2 element by element and then by the abundance matrix A2 with high resolution: X=(PeE1) A2.


Embodiment 2

A device for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions includes:

    • a first obtaining module configured to obtain hyperspectral image H1 and multispectral image M1 at time point T1, and multispectral image M2 at time point T2, and perform preprocessing to obtain upsampled hyperspectral image Ĥ1;
    • a search module configured to: based on a local linear constraint, search for adjacent similar full-band block M1i,j,k) in the multispectral image M1 to represent an image block centered at (i, j) in the multispectral image M2, and obtain a representation weight function of the similar full-band block; and share the representation weight function with the upsampled hyperspectral image Ĥ1 to obtain upsampled hyperspectral image Ĥ2*custom-character at a prediction time point;
    • a second obtaining module configured to obtain a time variation image represented as T=Ĥ2*−Ĥ1 for an initialized target fused image;
    • a decomposition module configured to decompose target image X2 at the time point T2 into endmember matrix E2 and abundance matrix A2 based on a spectral linear mixed model, where X2=E2A2, and the target image X2 is an image with high spatial, temporal and spectral resolutions;
    • an establishment module configured to establish observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions;
    • a representation module configured to introduce a generalized linear mixed model, and represent the endmember matrix E2 as E2=PeE1, where the symbol ⊙ represents a Hadamard product of element-by-element multiplication, P represents a time variation matrix of the target image, and E1 represents an endmember matrix at the time point T1;
    • a third obtaining module configured to obtain the abundance matrix A2, the time variation matrix P, and time variation image T of the target image; and
    • an obtaining module configured to obtain the target image finally by multiplying the endmember matrix E1 at the time point T1 by the time variation matrix P at the time point T2 element by element and then by the abundance matrix A2 with high resolution: X=(PeE1)A2.


In conclusion, the present disclosure proposes a time variation model for depicting and modeling a time variation characteristic of an image, and a resolution enhancement reconstruction model that is of a time variation image and achieves a fidelity optimization solving of a time variation. The time variation model and the resolution enhancement reconstruction model of the time variation image are coupled to establish a generalized spatial-temporal-spectral fusion framework. The time variation model models and depicts time variation characteristics between images, while the resolution enhancement reconstruction model of the time variation image obtains a fidelity constraint on the time variation. This method can achieve spatial-temporal-spectral fusion of a hyperspectral image with low temporal and spatial resolutions and a multispectral image with high temporal and spatial resolutions to generate a fused image with high spatial and spectral fidelity and high spatial, temporal and spectral resolutions.

Claims
  • 1. A method for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions, comprising: step 1: obtaining a hyperspectral image H1 and a multispectral image M1 at a time point T1, and a multispectral image M2 at a time point T2, and performing preprocessing to obtain an upsampled hyperspectral image Ĥ1;step 2: based on a local linear constraint, searching for an adjacent similar full-band block M1(Ωi,j,k) in the multispectral image M1 to represent an image block centered at (i,j) in the multispectral image M2, and obtaining a representation weight function of the adjacent similar full-band block; and sharing the representation weight function with the upsampled hyperspectral image Ĥ1 to obtain an upsampled hyperspectral image Ĥ2*∈ at a prediction time point;step 3: obtaining a time variation image represented as T=Ĥ2*−Ĥ1 for an initialized target fused image;step 4: decomposing a target image X2 at the time point T2 into an endmember matrix E2 and an abundance matrix A2 based on a spectral linear mixed model, wherein X2=E2A2, and the target image X2 is an image with high spatial, temporal and spectral resolutions;step 5: establishing observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions;step 6: introducing a generalized linear mixed model, and representing the endmember matrix E2as E2=PeE1, wherein a symbol e represents a Hadamard product of element-by-element multiplication, P represents a time variation matrix of the target image, and E1 represents an endmember matrix at the time point T1;step 7: obtaining the abundance matrix A2, the time variation matrix P and a time variation image T of the target image; andstep 8: obtaining the target image finally by multiplying the endmember matrix E1 at the time point T1 by the time variation matrix P at the time point T2 element by element and then by the abundance matrix A2 with high resolution: X=(PeE1)A2.
  • 2. The method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 1, wherein the step 1 comprises: step 1.1: obtaining the hyperspectral image Hi∈ and the multispectral image M1∈ at the time point T1, and the multispectral image M2∈ at the time point T2, wherein l and L represent quantities of bands, w and W represent quantities of pixels, l<L, and w<W;step 1.2: normalizing the hyperspectral image H1 and the multispectral images M1 and M2, and upsampling a normalized hyperspectral image H1 to a spatial size of the multispectral image to obtain the Ĥ1∈; andstep 1.3: folding the multispectral images M1 and M2 and the upsampled hyperspectral image Ĥ1 into a three-dimensional form along a spectral dimension, and splitting the three-dimensional form into full-band blocks with both a width and a height being √{square root over (c)} and the spectral dimension being l.
  • 3. The method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 2, wherein in the step 5, the observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions are represented as follows: Mi=RXi=REiAi Hi=XiFS=EiAiFSwherein i∈{1,2}; Xi∈, Hi∈, and Mi∈ respectively represent an image with high spatial, temporal and spectral resolutions, a hyperspectral image, and a multispectral image at a time point Ti; Ei∈ and Ai∈ respectively represent an endmember matrix and an abundance matrix of the image with high spatial, temporal and spectral resolutions at the time point Ti, and Q represents a quantity of endmembers; and R∈ represents a spectral downsampling matrix, and F∈ and S∈ respectively represent a spatial blur matrix and a spatial downsampling matrix.
  • 4. The method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 3, wherein the step 7 comprises: step 7.1: separately introducing a regularization term of the abundance matrix A2, a regularization term of the time variation matrix P and a regularization term of the time variation image T of the target image to obtain an energy function for a fusion problem;step 7.2: splitting the energy function into three sub-functions corresponding to variables of the abundance matrix A2, the time variation matrix P and the time variation image T, introducing a plurality of auxiliary variables for each sub-function to split the sub-function into sub-problems, and constructing an augmented Lagrangian function for each sub-problem; andstep 7.3: using an alternating direction method of multipliers to perform optimal solving on the augmented Lagrangian function to obtain the abundance matrix A2, the time variation matrix P and the time variation image T of the target image.
  • 5. The method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 4, wherein in the step 7.1, the energy function is represented as follows:
  • 6. The method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 5, wherein the step 7.1 comprises: step 7.1.1: introducing the regularization term of the abundance matrix A2 of the target image, wherein the regularization term of the abundance matrix A2 of the target image is a spatial smoothing constraint and represented as follows:
  • 7. The method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 6, wherein in the step 7.2, a sub-problem of the abundance matrix A2 of the target image is as follows:
  • 8. The method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 7, wherein in the step 7.2, a sub-problem of the time variation matrix P of the target image is as follows:
  • 9. The method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 8, wherein in the step 2, the image block centered at the (i,j) in the multispectral image M2 is represented using the adjacent similar full-band block M1(Ωi,j,k) in the multispectral image
  • 10. A device for generating a satellite remote-sensing image with high spatial, temporal and spectral resolutions, configured to execute the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 1, and comprising: a first obtaining module configured to obtain the hyperspectral image H1 and the multispectral image M1 at the time point T1, and the multispectral image M2 at the time point T2, and perform preprocessing to obtain the upsampled hyperspectral image Ĥ1;a search module configured to: based on the local linear constraint, search for the adjacent similar full-band block M1(Ωi,j,k) in the multispectral image M1 to represent the image block centered at (i,j) in the multispectral image M2, and obtain the representation weight function of the adjacent similar full-band block; and share the representation weight function with the upsampled hyperspectral image Ĥ1 to obtain the upsampled hyperspectral image Ĥ2*∈ at the prediction time point;a second obtaining module configured to obtain the time variation image represented as T=Ĥ2*−Ĥ1 for the initialized target fused image;a decomposition module configured to decompose the target image X2 at the time point T2 into the endmember matrix E2 and the abundance matrix A2 based on the spectral linear mixed model, wherein X2=E2A2, and the target image X2 is the image with high spatial, temporal and spectral resolutions;an establishment module configured to establish the observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions;a representation module configured to introduce the generalized linear mixed model, and represent the endmember matrix E2 as E2=PeE1, wherein the symbol e represents the Hadamard product of element-by-element multiplication, P represents the time variation matrix of the target image, and E1 represents the endmember matrix at the time point T1;a third obtaining module configured to obtain the abundance matrix A2, the time variation matrix P and the time variation image T of the target image; andan obtaining module configured to obtain the target image finally by multiplying the endmember matrix E1 at the time point Ti by the time variation matrix P at the time point T2 element by element and then by the abundance matrix A2 with high resolution: X=(PeE1)A2.
  • 11. The device for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 10, wherein the step 1 of the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions comprises: step 1.1: obtaining the hyperspectral image Hi∈ and the multispectral image M1∈ at the time point T1, and the multispectral image M2∈ at the time point T2, wherein l and L represent quantities of bands, w and W represent quantities of pixels, l<L, and w<W;step 1.2: normalizing the hyperspectral image H1 and the multispectral images M1 and M2, and upsampling a normalized hyperspectral image H1 to a spatial size of the multispectral image to obtain the Ĥ1∈; andstep 1.3: folding the multispectral images M1 and M2 and the upsampled hyperspectral image Ĥ1 into a three-dimensional form along a spectral dimension, and splitting the three-dimensional form into full-band blocks with both a width and a height being √{square root over (c)} and the spectral dimension being l.
  • 12. The device for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 11, wherein in the step 5 of the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions, the observation models of the multispectral image, the hyperspectral image, and the image with high spatial, temporal and spectral resolutions are represented as follows: Mi=RXi=REiAi Hi=XiFS=EiAiFSwherein i∈{1,2}; Xi∈, Hi∈, and Mi∈ respectively represent an image with high spatial, temporal and spectral resolutions, a hyperspectral image, and a multispectral image at a time point Ti; Ei∈ and Ai∈ respectively represent an endmember matrix and an abundance matrix of the image with high spatial, temporal and spectral resolutions at the time point Ti, and Q represents a quantity of endmembers; and R∈ represents a spectral downsampling matrix, and F∈ and S∈ respectively represent a spatial blur matrix and a spatial downsampling matrix.
  • 13. The device for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 12, wherein the step 7 of the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions comprises: step 7.1: separately introducing a regularization term of the abundance matrix A2, a regularization term of the time variation matrix P and a regularization term of the time variation image T of the target image to obtain an energy function for a fusion problem;step 7.2: splitting the energy function into three sub-functions corresponding to variables of the abundance matrix A2, the time variation matrix P and the time variation image T, introducing a plurality of auxiliary variables for each sub-function to split the sub-function into sub-problems, and constructing an augmented Lagrangian function for each sub-problem; andstep 7.3: using an alternating direction method of multipliers to perform optimal solving on the augmented Lagrangian function to obtain the abundance matrix A2, the time variation matrix P and the time variation image T of the target image.
  • 14. The device for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 13, wherein in the step 7.1 of the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions, the energy function is represented as follows:
  • 15. The device for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 14, wherein the step 7.1 of the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions comprises: step 7.1.1: introducing the regularization term of the abundance matrix A2 of the target image, wherein the regularization term of the abundance matrix A2 of the target image is a spatial smoothing constraint and represented as follows:
  • 16. The device for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 15, wherein in the step 7.2 of the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions, a sub-problem of the abundance matrix A2 of the target image is as follows:
  • 17. The device for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 16, wherein in the step 7.2 of the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions, a sub-problem of the time variation matrix P of the target image is as follows:
  • 18. The device for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions according to claim 17, wherein in the step 2 of the method for generating the satellite remote-sensing image with high spatial, temporal and spectral resolutions, the image block centered at the (i,j) in the multispectral image M2 is represented using the adjacent similar full-band block M1(Ωi,j,k) in the multispectral image
Priority Claims (1)
Number Date Country Kind
202310546379.5 May 2023 CN national
CROSS-REFERENCE TO THE RELATED APPLICATIONS

This application is a continuation application of international patent application No. PCT/CN2024/094956, filed on May 23, 2024, which is based upon and claims priority to Chinese Patent Application No. 202310546379.5, filed on May 16, 2023, the entire contents of which are incorporated herein by reference.

Continuations (1)
Number Date Country
Parent PCT/CN2024/094956 May 2024 WO
Child 19023595 US