CN115496662A - High-order tensor spectral image super-resolution reconstruction method based on spectral information fusion - Google Patents

High-order tensor spectral image super-resolution reconstruction method based on spectral information fusion Download PDF

Info

Publication number
CN115496662A
CN115496662A CN202211213611.5A CN202211213611A CN115496662A CN 115496662 A CN115496662 A CN 115496662A CN 202211213611 A CN202211213611 A CN 202211213611A CN 115496662 A CN115496662 A CN 115496662A
Authority
CN
China
Prior art keywords
spectral
image
tensor
resolution
super
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202211213611.5A
Other languages
Chinese (zh)
Inventor
陈希爱
范慧杰
田建东
贾慧迪
王非凡
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenyang Institute of Automation of CAS
Original Assignee
Shenyang Institute of Automation of CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenyang Institute of Automation of CAS filed Critical Shenyang Institute of Automation of CAS
Priority to CN202211213611.5A priority Critical patent/CN115496662A/en
Publication of CN115496662A publication Critical patent/CN115496662A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T3/00Geometric image transformations in the plane of the image
    • G06T3/40Scaling of whole images or parts thereof, e.g. expanding or contracting
    • G06T3/4053Scaling of whole images or parts thereof, e.g. expanding or contracting based on super-resolution, i.e. the output image resolution being higher than the sensor resolution
    • G06T3/4061Scaling of whole images or parts thereof, e.g. expanding or contracting based on super-resolution, i.e. the output image resolution being higher than the sensor resolution by injecting details from different spectral ranges

Landscapes

  • Physics & Mathematics (AREA)
  • Spectroscopy & Molecular Physics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Image Processing (AREA)

Abstract

The invention relates to a high-order Tensor spectral image super-resolution reconstruction method based on spectral information fusion, in particular to a method for realizing hyperspectral image super-resolution reconstruction by weighted low-Tensor-Train (TT) rank Tensor analysis of weighted group sparseness and spectral unmixing. The method utilizes the high spatial-spectral correlation and the non-local self-similarity of the high-multispectral image, utilizes the low TT rank tensor decomposition to approximately recover the block tensor data, and excavates the non-local self-similarity contained in the block tensor data; the weighted group sparseness is used as a regularization term to describe the spatio-spectral continuity of the hyperspectral image; linear spectral decomposition based on weighted non-convex regularization is adopted as effective spectral regularization to reduce spectral distortion. The method solves the problems of super-resolution reconstruction, high-multispectral fusion, noise removal, image detail recovery and the like, and the effectiveness and the advancement of the method are verified through experiments.

Description

High-order tensor spectral image super-resolution reconstruction method based on spectral information fusion
Technical Field
The invention relates to super-resolution reconstruction of a hyperspectral image, in particular to a method for realizing super-resolution reconstruction of a hyperspectral image based on weighted group sparseness and weighted low TT rank tensor analysis of spectral unmixing.
Background
A Hyperspectral (HS) image consists of images of a scene in tens to hundreds of discrete spectral bands at specific frequencies. HS images have extremely high spectral resolution and coverage, and can accurately identify materials present in the scene, which facilitates characterization of the imaged scene and greatly improves performance in many applications, including remote sensing, monitoring, target detection, military applications, and tracking. However, although HS images have a high spectral resolution, there are often severe limitations in spatial resolution. In fact, HS imaging systems require a large number of exposures to acquire multiple bands simultaneously within a narrow spectral window, and often require long exposures to ensure adequate signal-to-noise ratio (SNR), which often sacrifices spatial resolution. Therefore, the spatial resolution of the HS-image is typically low, because of the large number of mixed pixels in the low resolution HS-image, which limits its wide application to some extent. Therefore, increasing the spatial resolution of HS images has become an important issue, and has received increasing attention in recent years.
Simply increasing the spatial resolution of the image sensor is not effective for HS imaging, since the average number of photons reaching the sensor will be further reduced, resulting in a lower signal-to-noise ratio, and hence increasing the resolution by post-processing is a better option. Furthermore, multispectral (MS) imaging sensors are able to capture images at increasingly higher spatial resolutions. Therefore, the low-resolution HS image can be fused with a high-resolution (HR) MS image captured by the same scene, and the low-resolution HS image can be reconstructed. This process is called HS and MS image fusion and has attracted a wide range of attention. In fact, new HS imagers are also planned to carry MS image sensors. This means that both high spectral resolution HS images and high spatial resolution MS images can be captured simultaneously and more data sources for HS and MS image fusion are expected.
There have been many fruitful studies in recent years regarding the HS and MS image fusion problem. The bayesian framework is a common method for fusing low-resolution HS images and HRHS images. Such methods typically establish a posterior distribution of the desired HRHS images based on a priori knowledge and observation models. Matrix decomposition is also a common method in HS-MS image fusion. Matrix decomposition-based fusion methods typically first expand the target HR-HS image into a matrix, which is then decomposed into a base matrix and a coefficient matrix, where the base matrix and coefficient matrix are extracted from the low resolution HS image and HR-MS image, respectively. Although matrix factorization based approaches achieve impressive performance in the HS and MS fusion problem. There are still inherent drawbacks. All matrix decomposition methods require the unfolding of the three-dimensional data structure into a matrix, and the unfolding process may destroy the spatial structure of the data, which makes it difficult to fully exploit the spatio-spectral correlation of HS images. Compared with low-rank matrix decomposition, the method based on low-rank tensor can better maintain and utilize the spatial structure of the HS image, and therefore, the method is applied to some HS image recovery problems. In order to maintain the inherent spatial structure of the HS image, the method based on tensor decomposition carries out third-order tensor modeling on high spatial spectral correlation in the HR-HS image, different from the traditional method based on matrix decomposition. Despite good performance, other effective a priori knowledge in the HS image is not fully exploited. In the past decade, deep learning based approaches have achieved impressive performance in many computer vision tasks, and are therefore introduced into the HS and MS fusion problem. Deep learning based methods, while having good performance, typically require large amounts of training data, which is often impractical in the HS image recovery problem.
Disclosure of Invention
Aiming at the technical defects, the invention aims to provide a method for processing the problem of hyperspectral and multispectral fusion based on weighted non-local low TT rank tensor decomposition and spectral unmixing to realize the super-resolution of spectral images. In order to fully utilize the high spatial-spectral correlation and the non-local self-similarity of a high-multispectral image, approximate recovery is carried out on block tensor data by utilizing low TT rank tensor decomposition, and the non-local self-similarity contained in the block tensor data is mined; describing spatio-spectral continuity of the hyperspectral image using group sparsity as regularization; linear spectral decomposition based on non-convex regularization is adopted as effective spectral regularization to reduce spectral distortion. Based on the prior knowledge, a unified optimization model is provided to describe the problem of hyperspectral and multispectral image fusion, and an efficient algorithm for solving the model by using an alternative direction multiplication operator is designed. Compared with the existing new work, the method has better effect in the hyperspectral and multispectral fusion problem, and has better reconstruction performance and robustness in the hyperspectral image super-resolution.
The technical scheme adopted by the invention for solving the technical problems is as follows:
the method for reconstructing the super-resolution of the high-order tensor spectral image based on the spectral information fusion comprises the following steps of performing iterative optimization solution on the basis of an initial model, obtaining a high-order tensor spectral image super-resolution reconstruction model based on the spectral information fusion, and realizing the super-resolution reconstruction of the high-order tensor spectral image, and comprises the following steps of:
step 1, adding a weighted low TT rank high-order tensor regular term for mining the non-local self-similarity contained in the block tensor data by utilizing the high spatial-spectral correlation and the non-local self-similarity of a high-multispectral image;
step 2, adding a weighting group sparse regular term for describing the space-spectrum continuity of the hyperspectral image;
and 3, adding a weighted spectrum unmixing regularization term, and using weighted non-convex regularized linear spectrum decomposition as spectrum regularization to reduce spectrum distortion and realize high-multispectral information fusion.
The model is used for fusing the hyperspectral image and the multispectral image, and performing super-resolution reconstruction on the hyperspectral image, so that the super-resolution performance of the hyperspectral image is effectively improved.
The prior super-resolution reconstruction model is a traditional prior modeling with a prior information regular term and is recorded as:
Figure BDA0003873554940000031
wherein the content of the first and second substances,
Figure BDA0003873554940000032
in the case of a spatial domain fidelity term,
Figure BDA0003873554940000033
in order to be a spectral domain fidelity term,
Figure BDA0003873554940000034
for the observed low resolution HSI tensor data,
Figure BDA0003873554940000035
for high resolution MSI tensor data acquired by a multispectral imaging sensor in the same scene,
Figure BDA0003873554940000036
for the high resolution HSI tensor data to be recovered, B is a sampling operator, S is a blurring operator,
Figure BDA0003873554940000037
for the purpose of a degradation operator of the spectral domain,
Figure BDA0003873554940000038
Figure BDA0003873554940000039
is a priori information.
The high-order tensor spectral image super-resolution reconstruction model based on spectral information fusion is as follows:
Figure BDA00038735549400000310
wherein the content of the first and second substances,
Figure BDA00038735549400000311
to weight the low TT rank higher order tensor regularization term,
Figure BDA00038735549400000312
for the weighted set sparseness as a regularization term,
Figure BDA00038735549400000313
Figure BDA00038735549400000314
unmixing regular term for hyperspectral, multispectral weighted spectrum r Is a low rank weighting factor, λ t For the group of sparse weight factors, the weight factor,
Figure BDA00038735549400000315
is a weighting factor for the image to be restored,
Figure BDA0003873554940000041
as weight factors of the input image, W r Is a low rank weight matrix, W t For a set of sparse weight matrices,
Figure BDA0003873554940000042
is a weight matrix for the image to be restored,
Figure BDA0003873554940000043
as a weight matrix of the input image, U 1 For richness of the image to be restored, U 2 Is the richness of the input image.
The weighted low TT rank tensor item has non-local self-similarity, and the non-local self-similarity is formed by segmenting an image into a group of image blocks, finding a group of blocks most similar to a selected block, and stacking the blocks to form a 4D non-local self-similarity block.
The weighting group sparse term is used for describing the smoothness of the spectral images of different spectral bands and mining the difference of the line space structures of the image blocks of the spectral bands and the shared sparse structure.
The weighted spectrum unmixing term adopts the non-convex regularized linear spectrum decomposition as spectrum regularization so as to reduce spectrum distortion.
In the repeated iteration optimization solving process, when the error of the two adjacent image recovery result data is within the threshold range, the image is judged to be in accordance with the convergence from the image reconstruction to the current turn, and the iteration is stopped.
The error function is:
Figure BDA0003873554940000044
wherein K is the number of iterations,
Figure BDA0003873554940000045
for the high resolution HSI tensor data to be recovered,
Figure BDA0003873554940000046
for the observed low resolution HSI tensor data, the algorithm converges to stop timing when the error function is within a set threshold range.
The repeated iteration optimization solution adopts an ADMM algorithm.
The invention has the following beneficial effects and advantages:
1. the method adopts weighted low TT rank tensor decomposition to approximately recover the block tensor data, and excavates the non-local self-similarity contained in the block tensor data.
2. The method adopts a weighting group sparse regular term to excavate the difference of the spatial structure of the image block line of each spectral band and the shared sparse structure.
3. The method adopts the non-convex regularized linear spectrum decomposition as an effective spectrum regularization term to reduce the spectrum distortion.
4. The method is superior to the existing algorithm in the aspects of hyperspectral and multispectral fusion, and has better hyperspectral reconstruction performance and robustness.
Drawings
FIG. 1 is a general framework diagram of the process herein;
FIG. 2 is a 38 th spectral band and corresponding error map of a reconstructed high resolution hyperspectral image on a Pavia University dataset with different methods.
FIG. 3 is a 38 th spectral band of a reconstructed high resolution hyperspectral image on Washington DC Mall dataset with different methods and the corresponding error map.
Detailed Description
The present invention will be described in further detail with reference to examples.
A unified optimization model is proposed to describe the hyperspectral and multispectral image fusion problem, and an efficient algorithm for solving the model by using an alternate direction multiplication operator is designed.
In order to improve the spatial resolution of the hyperspectral image, the invention provides an effective fusion method of the hyperspectral image and the multispectral image by utilizing the low-rank tensor analysis and the spectrum unmixing thought.
The super-resolution reconstruction method of the high-order tensor spectral image based on the spectral information fusion comprises four items: the super items are used for ensuring the fidelity of the observation data and the original data; carrying out approximate recovery on the block tensor data by weighted low TT rank tensor decomposition, and mining the non-local self-similarity contained in the block tensor data; weighting group sparseness as regularization to describe spatio-spectral continuity of the HS images; linear spectral decomposition based on weighted non-convex regularization is adopted as effective spectral regularization to reduce spectral distortion. The model solves the problem of hyperspectral and multispectral fusion, can perform super-resolution reconstruction on the spectral image, and effectively improves the super-resolution performance and robustness of the spectral image. The hyperspectral image data and the multispectral image data are input as models in a tensor form, and observation data are generated by setting different sampling rates and fuzzy operators. And when the error of the data recovery for two times needs to be calculated after each image reconstruction, judging the convergence of the image reconstruction according to whether the error function meets the threshold requirement.
The error function is
Figure BDA0003873554940000051
Wherein, K is the number of iterations,
Figure BDA0003873554940000052
in order to recover the data it is necessary to,
Figure BDA0003873554940000053
to observe the data.
1. Problem modeling
High resolution tensor for HSI to be restored
Figure BDA0003873554940000054
Where W, H, S represent the width, height and spectral band pattern, respectively, of the high resolution HSI tensor data. The observed low resolution HSI tensor data is recorded as
Figure BDA0003873554940000055
Where the spectral bands are consistent with high resolution HSI but are spatially down-sampled.
Figure BDA0003873554940000061
Representing a high resolution MSI acquired by a multi-spectral imaging sensor in the same scene. The above three mathematical relationships are described as
Figure BDA0003873554940000062
Wherein
Figure BDA0003873554940000063
The degradation operators representing the spatial domain comprise a down-sampling operator B, a fuzzy operator S and a degradation operator of the spectral domain
Figure BDA0003873554940000064
Namely:
Figure BDA0003873554940000065
since the above problem is an underdetermined problem, the solution of equation (2) is not unique. Conventional a priori modeling is performed by combining one or more data
Figure BDA0003873554940000066
As a regular term, to constrain the solution space, denoted as:
Figure BDA0003873554940000067
wherein the content of the first and second substances,
Figure BDA0003873554940000068
in the case of a spatial domain fidelity term,
Figure BDA0003873554940000069
in order to be a spectral domain fidelity term,
Figure BDA00038735549400000610
for the observed low resolution HSI tensor mode 3 data,
Figure BDA00038735549400000611
for high resolution MSI tensor mode 3 data acquired by a multispectral imaging sensor in the same scene,
Figure BDA00038735549400000612
for the high resolution HSI tensor mode 3 data to be recovered, B is the sampling operator, S is the blurring operator,
Figure BDA00038735549400000613
for the purpose of a degradation operator of the spectral domain,
Figure BDA00038735549400000614
is a priori information.
So far, a spectral image super-resolution reconstruction problem model is obtained.
1.1. Weighted low TT rank higher order tensor regularization term
In recent years, low rank priors have shown their effectiveness and superiority in image processing tasks. Setting:
Figure BDA00038735549400000615
representing a low rank prior of the image data. The problem model can be written as
Figure BDA00038735549400000616
Wherein λ is r Is a low rank weighting factor.
The non-local similarity of HSI describes the fact that each three-dimensional block of HSI has many similar blocks in the nearby space. Generally, to exploit the self-similarity implied in images, the HSI is first segmented into overlapping three-dimensional blocks, and then non-locally similar blocks are clustered by the k-means algorithm. The simultaneous mining of non-locally similar blocks takes advantage of the spectral and spatial low rank characteristics of HSI. Furthermore, the low rank tensor super-resolution reconstruction model based on the non-local block can be recorded as
Figure BDA00038735549400000617
Wherein k is the order of the non-local similarity block,
Figure BDA0003873554940000071
is an operator for taking similar blocks in the spectral image spatial domain.
For the high-order tensor data processing problem, the traditional tensor decomposition is limited in performance in tensor approximation due to the problem of NP difficulty in calculation and the problem of mode imbalance. The method herein is based on exploiting the better TT decomposition for pattern equality. For a given tensor
Figure BDA0003873554940000072
Its weighted low TT rank norm may be defined as:
Figure BDA0003873554940000073
in the formula, W r In the form of a low-rank weight matrix,
Figure BDA0003873554940000074
is a diagonal matrix whose elements are n-order matrices
Figure BDA0003873554940000075
Singular value of alpha n Is the weight of each n-order matrix, defined as
Figure BDA0003873554940000076
Wherein
Figure BDA0003873554940000077
Based on this weighted low TT rank norm, the relaxed form of equation (5) can be expressed as
Figure BDA0003873554940000078
1.2. Weighted group sparse regularization term
In addition to spatial spectral correlation and non-local self-similarity,
Figure BDA0003873554940000079
it also exhibits spatial spectral continuity, which can be represented by a Total Variation (TV) regularization term. The TV regularization term is widely applied to exploring a spatial piecewise smooth structure to solve the HS image restoration task. Consider that there is also a strong local smoothing structure of the HS image along its spectral pattern. Simulation using 3D-TV in general
Figure BDA00038735549400000710
Spatial spectral continuity of (a). However, the image is usually represented by strong sparsity of a shared structure along a spectrum mode, so that the group sparse regular term is more reasonable and effective than the traditional TV regular term in the aspects of describing the smoothness of spectrum images of different spectral bands, and mining the difference of the line space structures of image blocks of the spectral bands and the shared sparsity structure. For a given tensor
Figure BDA00038735549400000711
With a weight set of sparse regularization terms of
Figure BDA00038735549400000712
Wherein the content of the first and second substances,(i, j,: is the pixel position,
Figure BDA00038735549400000713
for the weight in the x-direction,
Figure BDA00038735549400000714
for weights in the y-direction, D is two differential operators, i.e., D x And D y The difference between the width and height along the space is calculated.
Using the weighted set sparsity of the spatial domain, the proposed model equation (7) can be rewritten as
Figure BDA00038735549400000715
Wherein λ is t As a group sparse weight factor, W t Is a group sparse weight matrix.
1.3. Weighted spectral unmixing regularization term
The above model (8) only considers spatial domain resolution enhancement, a processing scheme that is susceptible to spectral distortion. Spectral unmixing has become an important way of spectral regularization to reduce spectral distortion. The sparse spectral unmixing for a given matrix X can be expressed as
Figure BDA0003873554940000081
Wherein E is an end member set, lambda is a weight factor, and U is the image richness.
Its non-convex relaxation form formula based on the weighting MCP penalty function can be written as
Figure BDA0003873554940000082
Where W is a weight matrix.
By utilizing the prior regularization terms of the spatial domain and the spectral band domain, a higher-order tensor spectral image super-resolution reconstruction model based on spectral information fusion is provided, namely
Figure BDA0003873554940000083
Wherein the content of the first and second substances,
Figure BDA0003873554940000084
in order to be a spatial domain fidelity term,
Figure BDA0003873554940000085
in order to be a spectral domain fidelity term,
Figure BDA0003873554940000086
to weight the low TT rank higher order tensor regularization term,
Figure BDA0003873554940000087
for weighted group sparseness as the regularization term,
Figure BDA0003873554940000088
Figure BDA0003873554940000089
unmixing regularization term, λ, for hyperspectral, multispectral weighted spectra r Is a low rank weight factor, λ t For the purpose of the group sparse weight factor,
Figure BDA00038735549400000810
is a weighting factor for the image to be restored,
Figure BDA00038735549400000811
as a weighting factor of the input image, W r Is a low rank weight matrix, W t Is a set of sparse weight matrices
Figure BDA0003873554940000091
Is a weight matrix for the image to be restored,
Figure BDA0003873554940000092
as a weight matrix of the input image, U 1 For richness of the image to be restored, U 2 Is the richness of the input image.
2. Algorithm solution
In order to solve the coupling problem in the process of variable solution, auxiliary variables are introduced into corresponding variables
Figure BDA0003873554940000093
s.t.
Figure BDA0003873554940000094
V 1 =U 1 ,V 2 =U 2 ) (12)
Furthermore, we have their Lagrangian functional form
Figure BDA0003873554940000095
The variables are updated in sequence, including
Updating
Figure BDA0003873554940000096
Figure BDA0003873554940000101
The problem is a strong convex one, and a solution can be obtained by forcing its derivative. w.r.t
Figure BDA0003873554940000102
Is zero, i.e.
Figure BDA0003873554940000103
Wherein
Figure BDA0003873554940000104
C 2 =BS(BS) T
Figure BDA0003873554940000105
Figure BDA0003873554940000106
Updating Z n
Figure BDA0003873554940000107
Closed type solution
Figure BDA0003873554940000108
Updating
Figure BDA0003873554940000109
Figure BDA00038735549400001010
Order to
Figure BDA00038735549400001011
Figure BDA00038735549400001012
The closed form solution of the fiber is calculated by the following formula
Figure BDA0003873554940000111
Updating
Figure BDA0003873554940000112
Figure BDA0003873554940000113
Linear system solution
Figure BDA0003873554940000114
Updating
Figure BDA00038735549400001111
Figure BDA0003873554940000116
Closed type solution
Figure BDA0003873554940000117
Updating U 1 ,U 2
Figure BDA0003873554940000118
Closed type solution
Figure BDA0003873554940000119
The same can be obtained
Figure BDA00038735549400001110
Closed type solution
Figure BDA0003873554940000121
Update V 1 ,V 2
Figure BDA0003873554940000122
Closed type solution
Figure BDA0003873554940000123
The same can be obtained
Figure BDA0003873554940000124
Closed type solution
Figure BDA0003873554940000125
Updating lagrange multipliers
Figure BDA0003873554940000126
Figure BDA0003873554940000127
Figure BDA0003873554940000128
Figure BDA0003873554940000129
Figure BDA00038735549400001210
Figure BDA00038735549400001211
Figure BDA0003873554940000131
Experiments are carried out on the public hyperspectral image datasets Pavia University and Washington DC Mall, and compared with a representative method, as shown in figures 2 and 3, the hyperspectral image details which are over-divided and reconstructed by the method are clearer. The blueness and smoothness of the blue error image of the method indicate that the reconstruction error is smaller.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.

Claims (10)

1. The method for reconstructing the super-resolution of the high-order tensor spectral image based on the spectral information fusion is characterized by comprising the following steps of performing iterative optimization solution on the basis of an initial model, obtaining a high-order tensor spectral image super-resolution reconstruction model based on the spectral information fusion, and realizing the reconstruction of the high-order tensor spectral image super-resolution, wherein the steps comprise:
step 1, adding a weighted low TT rank high-order tensor regular term for mining the non-local self-similarity contained in the block tensor data by utilizing the high spatial-spectral correlation and the non-local self-similarity of a high-multispectral image;
step 2, adding a weighting group sparse regular term for describing the space-spectrum continuity of the hyperspectral image;
and 3, adding a weighted spectrum unmixing regular term, and using the linear spectrum decomposition of weighted non-convex regular as spectrum regular, so as to reduce spectrum distortion and realize high-multispectral information fusion.
2. The higher-order tensor spectral image super-resolution reconstruction method based on spectral information fusion as claimed in claim 1, wherein the model is used for the fusion of the hyperspectral image and the multispectral image, and the super-resolution reconstruction is carried out on the hyperspectral image, so that the super-resolution performance of the spectral image is effectively improved.
3. The method for super-resolution reconstruction of the higher-order tensor spectral image based on spectral information fusion as claimed in claim 1, wherein the prior super-resolution reconstruction model is a traditional prior modeling with a prior information regular term, and is recorded as:
Figure FDA0003873554930000011
wherein, the first and the second end of the pipe are connected with each other,
Figure FDA0003873554930000012
in the case of a spatial domain fidelity term,
Figure FDA0003873554930000013
in order to be a spectral domain fidelity term,
Figure FDA0003873554930000017
for the observed low resolution HSI tensor data,
Figure FDA0003873554930000018
for high resolution MSI tensor data acquired by a multispectral imaging sensor in the same scene,
Figure FDA0003873554930000019
for the high resolution HSI tensor data to be recovered, B is a sampling operator, S is a blurring operator,
Figure FDA0003873554930000014
for the purpose of a degradation operator of the spectral domain,
Figure FDA0003873554930000015
Figure FDA0003873554930000016
is a priori information.
4. The method for reconstructing super-resolution of high-order tensor spectral image based on spectral information fusion as claimed in claim 1, wherein the model for reconstructing super-resolution of high-order tensor spectral image based on spectral information fusion is as follows:
Figure FDA0003873554930000021
wherein the content of the first and second substances,
Figure FDA0003873554930000022
to weight the low TT rank higher order tensor regularization term,
Figure FDA0003873554930000029
for the weighted set sparseness as a regularization term,
Figure FDA0003873554930000023
Figure FDA0003873554930000024
unmixing regular term for hyperspectral, multispectral weighted spectrum r Is a low rank weight factor, λ t For the group of sparse weight factors, the weight factor,
Figure FDA0003873554930000025
is a weighting factor for the image to be restored,
Figure FDA0003873554930000026
as weight factors of the input image, W r Is a low rank weight matrix, W t To form a set of sparse weight matrices,
Figure FDA0003873554930000027
is a weight matrix for the image to be restored,
Figure FDA0003873554930000028
as a weight matrix of the input image, U 1 For richness of the image to be restored, U 2 Is the richness of the input image.
5. The method for super-resolution reconstruction of higher-order tensor spectral image based on spectral information fusion as claimed in claim 4, wherein the weighted low TT rank tensor term, the non-local self-similarity, is formed by dividing the image into a set of image blocks, finding a set of blocks most similar to the selected block, and stacking the blocks to form a 4D non-local self-similar block.
6. The method for super-resolution reconstruction of the higher-order tensor spectral image based on spectral information fusion as claimed in claim 1, wherein the weighted set sparse term is used for describing smoothness of spectral images in different spectral bands, and mining spatial structure difference and shared sparse structure of image blocks in each spectral band.
7. The super-resolution reconstruction method for the higher-order tensor spectral image based on the spectral information fusion as claimed in claim 1, wherein the weighted spectral unmixing term adopts a non-convex regularized linear spectral decomposition as the spectral regularization to reduce the spectral distortion.
8. The hyperspectral image anomaly detection method based on high-order tensor representation according to claim 1 is characterized in that in the repeated iterative optimization solution process, when the error of the image recovery result data of two adjacent times is within a threshold range, the image is judged to be in accordance with convergence when being reconstructed to the current turn, and the iteration is stopped.
9. The method for detecting the abnormality of the hyperspectral image based on the higher-order tensor representation according to claim 8, wherein the error function is:
Figure FDA0003873554930000031
wherein K is the number of iterations,
Figure FDA0003873554930000032
for the high resolution HSI tensor data to be recovered,
Figure FDA0003873554930000033
for the observed low resolution HSI tensor data, the algorithm converges to stop timing when the error function is within a set threshold range.
10. The method for detecting the abnormality of the hyperspectral image based on the high-order tensor representation according to claim 1, wherein the repeated iterative optimization solution adopts an ADMM algorithm.
CN202211213611.5A 2022-09-30 2022-09-30 High-order tensor spectral image super-resolution reconstruction method based on spectral information fusion Pending CN115496662A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211213611.5A CN115496662A (en) 2022-09-30 2022-09-30 High-order tensor spectral image super-resolution reconstruction method based on spectral information fusion

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211213611.5A CN115496662A (en) 2022-09-30 2022-09-30 High-order tensor spectral image super-resolution reconstruction method based on spectral information fusion

Publications (1)

Publication Number Publication Date
CN115496662A true CN115496662A (en) 2022-12-20

Family

ID=84471996

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211213611.5A Pending CN115496662A (en) 2022-09-30 2022-09-30 High-order tensor spectral image super-resolution reconstruction method based on spectral information fusion

Country Status (1)

Country Link
CN (1) CN115496662A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115719309A (en) * 2023-01-10 2023-02-28 湖南大学 Spectrum super-resolution reconstruction method and system based on low-rank tensor network
CN116245779A (en) * 2023-05-11 2023-06-09 四川工程职业技术学院 Image fusion method and device, storage medium and electronic equipment
CN116433534A (en) * 2023-06-09 2023-07-14 四川工程职业技术学院 Hyperspectral image restoration method and device, storage medium and electronic equipment
CN117197627A (en) * 2023-09-13 2023-12-08 长春理工大学 Multi-mode image fusion method based on high-order degradation model

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115719309A (en) * 2023-01-10 2023-02-28 湖南大学 Spectrum super-resolution reconstruction method and system based on low-rank tensor network
CN116245779A (en) * 2023-05-11 2023-06-09 四川工程职业技术学院 Image fusion method and device, storage medium and electronic equipment
CN116245779B (en) * 2023-05-11 2023-08-22 四川工程职业技术学院 Image fusion method and device, storage medium and electronic equipment
CN116433534A (en) * 2023-06-09 2023-07-14 四川工程职业技术学院 Hyperspectral image restoration method and device, storage medium and electronic equipment
CN116433534B (en) * 2023-06-09 2023-08-22 四川工程职业技术学院 Hyperspectral image restoration method and device, storage medium and electronic equipment
CN117197627A (en) * 2023-09-13 2023-12-08 长春理工大学 Multi-mode image fusion method based on high-order degradation model
CN117197627B (en) * 2023-09-13 2024-03-01 长春理工大学 Multi-mode image fusion method based on high-order degradation model

Similar Documents

Publication Publication Date Title
Jiang et al. Matrix factorization for low-rank tensor completion using framelet prior
CN115496662A (en) High-order tensor spectral image super-resolution reconstruction method based on spectral information fusion
Nasrollahi et al. Super-resolution: a comprehensive survey
Zhang et al. A super-resolution reconstruction algorithm for hyperspectral images
CN107025632B (en) Image super-resolution reconstruction method and system
CN108133465B (en) Non-convex low-rank relaxation hyperspectral image recovery method based on spatial spectrum weighted TV
CN106920214B (en) Super-resolution reconstruction method for space target image
Liu et al. Hyperspectral restoration and fusion with multispectral imagery via low-rank tensor-approximation
Kato et al. Multi-frame image super resolution based on sparse coding
Peng et al. Integrated fusion framework based on semicoupled sparse tensor factorization for spatio-temporal–spectral fusion of remote sensing images
CN108520495B (en) Hyperspectral image super-resolution reconstruction method based on clustering manifold prior
Shen et al. Coupling model-and data-driven methods for remote sensing image restoration and fusion: Improving physical interpretability
Wong et al. Hsi-ipnet: Hyperspectral imagery inpainting by deep learning with adaptive spectral extraction
Zou et al. Bayesian dictionary learning for hyperspectral image super resolution in mixed Poisson–Gaussian noise
Fu et al. Hyperspectral image denoising via robust subspace estimation and group sparsity constraint
CN108171124B (en) Face image sharpening method based on similar sample feature fitting
CN114331976A (en) Hyperspectral anomaly detection method based on multistage tensor prior constraint
Lv et al. Joint image registration and point spread function estimation for the super-resolution of satellite images
CN109615584B (en) SAR image sequence MAP super-resolution reconstruction method based on homography constraint
Torun et al. Hyperspectral image denoising via self-modulating convolutional neural networks
Cheng et al. Classification-based video super-resolution using artificial neural networks
Amiri et al. A fast video super resolution for facial image
Nair et al. Hyperspectral image fusion using fast high-dimensional denoising
Ghassab et al. Plug-and-play video super-resolution using edge-preserving filtering
CN112634167B (en) Hyperspectral image filtering method of full-variation collaborative norm constraint iterative projection

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination