Si Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Si Guo has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Guxi Wang
College of Architecture & Environment, Sichuan University, 12530 Chengdu, Sichuan China
1 shared publication - Hongwei Han
The Engineering and Technical College of Chengdu University of Technology, Leshan, 614000, People’s Republic of China
1 shared publication - Jiaqing Miao
School of Mathematics, Southwest Minzu University, Chengdu, China
1 shared publication - Ke Guo
Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, Chengdu 610059, China
1 shared publication - Ling Chen
Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, 47908 Chengdu, Sichuan China
1 shared publication - Maozhi Wang
College of Mathematics Sciences, Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, Chengdu, China
1 shared publication
Latest Publications
- Open Access
- 3 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 13 (19391404) , 5704-5718
Hyperspectral Unmixing Via Nonconvex Sparse and Low-Rank Constraint
In recent years, sparse unmixing has attracted significant attention as it can effectively avoid the bottleneck problems associated with the absence of pure pixels and the estimation of the number of endmembers in hyperspectral scenes. The joint-sparsity model has outperformed the single sparse unmixing method. However, the joint-sparsity model might cause some aliasing artifacts for the pixels on the boundaries of different constituent endmembers. To address this shortcoming, researchers have developed many unmixing algorithms based on low-rank representation, which makes good use of the global structure of data. In addition, the high mutual coherence of spectral libraries strongly affects the applicability of spare unmixing. In this study, adopting combined constraints imposing sparsity and low rankness, a novel algorithm called non-convex joint-sparsity and low-rank unmixing with dictionary pruning (NCJSpLRUDP) is developed. In particular, we impose sparsity on the abundance matrix using the l2,p mixed norm, and we also employ the weighted Schatten p-norm instead of the convex nuclear norm as an approximation for the rank. The key parameter p is set between 0.4 and 0.6, and a good quality sparse solution is generated. The effectiveness of the proposed algorithm is demonstrated on both simulated and real hyperspectral datasets.
- 3 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 13 (19391404) , 5704-5718
Open AccessHyperspectral Unmixing Via Nonconvex Sparse and Low-Rank Constraint
In recent years, sparse unmixing has attracted significant attention as it can effectively avoid the bottleneck problems associated with the absence of pure pixels and the estimation of the number of endmembers in hyperspectral scenes. The joint-sparsity model has outperformed the single sparse unmixing method. However, the joint-sparsity model might cause some aliasing artifacts for the pixels on the boundaries of different constituent endmembers. To address this shortcoming, researchers have developed many unmixing algorithms based on low-rank representation, which makes good use of the global structure of data. In addition, the high mutual coherence of spectral libraries strongly affects the applicability of spare unmixing. In this study, adopting combined constraints imposing sparsity and low rankness, a novel algorithm called non-convex joint-sparsity and low-rank unmixing with dictionary pruning (NCJSpLRUDP) is developed. In particular, we impose sparsity on the abundance matrix using the l2,p mixed norm, and we also employ the weighted Schatten p-norm instead of the convex nuclear norm as an approximation for the rank. The key parameter p is set between 0.4 and 0.6, and a good quality sparse solution is generated. The effectiveness of the proposed algorithm is demonstrated on both simulated and real hyperspectral datasets.
- 1 September 2018
- Published by Springer Nature in Applied Geophysics
- Vol. 15 (3-4) , 481-490
Q-factor estimation in CMP gather and the continuous spectral ratio slope method
- 1 September 2018
- Published by Springer Nature in Applied Geophysics
- Vol. 15 (3-4) , 481-490
Q-factor estimation in CMP gather and the continuous spectral ratio slope method