2015
DOI: 10.1109/tgrs.2014.2375320
|View full text |Cite
|
Sign up to set email alerts
|

A Convex Formulation for Hyperspectral Image Superresolution via Subspace-Based Regularization

Abstract: Abstract-Hyperspectral remote sensing images (HSIs) usually have high spectral resolution and low spatial resolution. Conversely, multispectral images (MSIs) usually have low spectral and high spatial resolutions. The problem of inferring images which combine the high spectral and high spatial resolutions of HSIs and MSIs, respectively, is a data fusion problem that has been the focus of recent active research due to the increasing availability of HSIs and MSIs retrieved from the same geographical area.We form… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
563
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 643 publications
(564 citation statements)
references
References 55 publications
1
563
0
Order By: Relevance
“…Akhtar et al [10] learn a non-negative spectral basis from the HSI, and then solve for the MSI coefficients under a sparsity constraint, again using OMP. Simões et al [11] also recover a linear basis, and include a total variation regularizer to achieve spatial smoothness of the mixing coefficients. Like the previously mentioned works, they proceed sequentially and first construct a basis, which is then held fixed to solve for the coefficients in a second step.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Akhtar et al [10] learn a non-negative spectral basis from the HSI, and then solve for the MSI coefficients under a sparsity constraint, again using OMP. Simões et al [11] also recover a linear basis, and include a total variation regularizer to achieve spatial smoothness of the mixing coefficients. Like the previously mentioned works, they proceed sequentially and first construct a basis, which is then held fixed to solve for the coefficients in a second step.…”
Section: Related Workmentioning
confidence: 99%
“…The formulation of Wei et al [20] leads to an alternating optimization of fusion and unmixing, with Sylvester equation solvers; whereas we use efficient proximal mappings to impose the constraints. Moreover, to account for the influence of the constraints on the spectral basis, we update the endmembers together with the abundances, whereas [8][9][10][11]21] estimate the spectral basis in advance and then keep it fixed. Finally, while several other methods include some sort of smoothness prior, e.g., vector total variation in [11], or the L 2 -distance to the bicubic upsampling in [17], we are not aware of any prior work that uses the MSI to obtain an adaptive regularizer.…”
Section: Related Workmentioning
confidence: 99%
“…The amount of image information is bound to be changed which is fused before and after. According to the principle of Shannon information theory, an image's information entropy is shown by - (20) Where, is the probability of grey level i, L is image's total gray level and the dynamic range of analyzed image is [0, ]. If the value of entropy becomes higher after fusing, it indicates that the information increases and the fusion performances are improved [6] …”
Section: Entropy (H)mentioning
confidence: 99%
“…Several HSI-MSI fusion algorithms have been proposed in the last decades [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. HR HSI can be reconstructed by combining endmember of LR HSI and an abundance of HR MSI.…”
Section: Introductionmentioning
confidence: 99%