Pansharpening With Spatial Hessian Non-Convex Sparse and Spectral Gradient Low Rank Priors

被引:4
作者
Liu, Pengfei [1 ,2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Comp Sci, Nanjing 210023, Peoples R China
[2] Jiangsu Key Lab Big Data Secur & Intelligent Proc, Nanjing 210023, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Pansharpening; Laplace equations; Degradation; Spatial resolution; Satellites; Image fusion; Analytical models; spatial Hessian; hyper-Laplacian non-convex sparse prior; spectral gradient low rank; REMOTE-SENSING IMAGES; VARIATIONAL MODEL; LANDSAT TM; FUSION; MULTIRESOLUTION; REGRESSION; ALGORITHM; MS;
D O I
10.1109/TIP.2023.3263103
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To get the high resolution multi-spectral (HRMS) images by the fusion of low resolution multi-spectral (LRMS) and panchromatic (PAN) images, an effectively pansharpening model with spatial Hessian non-convex sparse and spectral gradient low rank priors (PSHNSSGLR) is proposed in this paper. In particularly, from the statistical aspect of view, the spatial Hessian hyper-Laplacian non-convex sparse prior is developed to model the spatial Hessian consistency between HRMS and PAN. More importantly, it is recently the first work for pansharpening modeling with the spatial Hessian hyper-Laplacian non-convex sparse prior. Meanwhile, the spectral gradient low rank prior on HRMS is further developed for spectral feature preservation. Then, the alternating direction method of multipliers (ADMM) approach is applied for optimizing the proposed PSHNSSGLR model. Afterwards, many fusion experiments demonstrate the capability and superiority of PSHNSSGLR.
引用
收藏
页码:2120 / 2131
页数:12
相关论文
共 50 条
[31]   The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction [J].
Wang, Yong ;
Zhou, Guanglu ;
Zhang, Xin ;
Liu, Wanquan ;
Caccetta, Louis .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2016, 170 (03) :1009-1025
[32]   Efficient general sparse denoising with non-convex sparse constraint and total variation regularization [J].
Deng, Shi-Wen ;
Han, Ji-Qing .
DIGITAL SIGNAL PROCESSING, 2018, 78 :259-264
[33]   High-Fidelity compressive spectral image reconstruction through a novel Non-Convex Non-Local Low-Rank tensor approximation model [J].
Jiang, Heng ;
Xu, Chen ;
Liu, Lilin .
OPTICS AND LASER TECHNOLOGY, 2024, 171
[34]   Orthogonal Tensor Recovery Based on Non-Convex Regularization and Rank Estimation [J].
Chen, Xixiang ;
Zheng, Jingjing ;
Zhao, Li ;
Jiang, Wei ;
Zhang, Xiaoqin .
IEEE ACCESS, 2024, 12 :29571-29582
[35]   Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method [J].
Yan, Hui -Yin ;
Zheng, Zhong .
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2024, 361 (02) :796-815
[36]   Cartoon-texture image decomposition via non-convex low-rank texture regularization [J].
Fan, Ya-Ru ;
Huang, Ting-Zhu ;
Ma, Tian-Hui ;
Zhao, Xi-Le .
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2017, 354 (07) :3170-3187
[37]   HYPERSPECTRAL AND MULTISPECTRAL IMAGE FUSION USING NON-CONVEX RELAXATION LOW RANK AND TOTAL VARIATION REGULARIZATION [J].
Yuan, Yue ;
Wang, Qi ;
Li, Xuelong .
IGARSS 2020 - 2020 IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM, 2020, :2683-2686
[38]   Augmented Lagrangian alternating direction method for low-rank minimization via non-convex approximation [J].
Chen, Yongyong ;
Wang, Yongli ;
Li, Mingqiang ;
He, Guoping .
SIGNAL IMAGE AND VIDEO PROCESSING, 2017, 11 (07) :1271-1278
[39]   A globally convergent approximate Newton method for non-convex sparse learning [J].
Ji, Fanfan ;
Shuai, Hui ;
Yuan, Xiao-Tong .
PATTERN RECOGNITION, 2022, 126
[40]   Non-convex lp regularization for sparse reconstruction of electrical impedance tomography [J].
Wang, Jing .
INVERSE PROBLEMS IN SCIENCE AND ENGINEERING, 2021, 29 (07) :1032-1053