Xi-Le Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xi-Le Zhao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ting-Zhu Huang
School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, China
2 shared publications - Chao-Chao Zheng
School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu 611731, Sichuan, China
1 shared publication - Gang Liu
College of Applied Mathematics, Chengdu University of Information Technology, Chengdu, China
1 shared publication - Jie Huang
School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu 611731, Sichuan, China
1 shared publication - Liang-Jian Deng
University of Electronic Science and Technology of China
1 shared publication - Si Wang
University of Wuppertal, Wuppertal D-42119, Germany#TAB
1 shared publication
Latest Publications
- Open Access
- 3 July 2018
- Published by MDPI AG in Remote Sensing
- Vol. 10 (7) , 1046
Double Reweighted Sparse Regression and Graph Regularization for Hyperspectral Unmixing
Hyperspectral unmixing, aiming to estimate the fractional abundances of pure spectral signatures in each mixed pixel, has attracted considerable attention in analyzing hyperspectral images. Plenty of sparse unmixing methods have been proposed in the literature that achieved promising performance. However, many of these methods overlook the latent geometrical structure of the hyperspectral data which limit their performance to some extent. To address this issue, a double reweighted sparse and graph regularized unmixing method is proposed in this paper. Specifically, a graph regularizer is employed to capture the correlation information between abundance vectors, which makes use of the property that similar pixels in a spectral neighborhood have higher probability to share similar abundances. In this way, the latent geometrical structure of the hyperspectral data can be transferred to the abundance space. In addition, a double weighted sparse regularizer is used to enhance the sparsity of endmembers and the fractional abundance maps, where one weight is introduced to promote the sparsity of endmembers as a hyperspectral image typically contains fewer endmembers compared to the overcomplete spectral library and the other weight is exploited to improve the sparsity of the abundance matrix. The weights of the double weighted sparse regularizer used for the next iteration are adaptively computed from the current abundance matrix. The experimental results on synthetic and real hyperspectral data demonstrate the superiority of our method compared with some state-of-the-art approaches.
- 3 July 2018
- Published by MDPI AG in Remote Sensing
- Vol. 10 (7) , 1046
Open AccessDouble Reweighted Sparse Regression and Graph Regularization for Hyperspectral Unmixing
Hyperspectral unmixing, aiming to estimate the fractional abundances of pure spectral signatures in each mixed pixel, has attracted considerable attention in analyzing hyperspectral images. Plenty of sparse unmixing methods have been proposed in the literature that achieved promising performance. However, many of these methods overlook the latent geometrical structure of the hyperspectral data which limit their performance to some extent. To address this issue, a double reweighted sparse and graph regularized unmixing method is proposed in this paper. Specifically, a graph regularizer is employed to capture the correlation information between abundance vectors, which makes use of the property that similar pixels in a spectral neighborhood have higher probability to share similar abundances. In this way, the latent geometrical structure of the hyperspectral data can be transferred to the abundance space. In addition, a double weighted sparse regularizer is used to enhance the sparsity of endmembers and the fractional abundance maps, where one weight is introduced to promote the sparsity of endmembers as a hyperspectral image typically contains fewer endmembers compared to the overcomplete spectral library and the other weight is exploited to improve the sparsity of the abundance matrix. The weights of the double weighted sparse regularizer used for the next iteration are adaptively computed from the current abundance matrix. The experimental results on synthetic and real hyperspectral data demonstrate the superiority of our method compared with some state-of-the-art approaches.
- Open Access
- 18 April 2018
- Published by MDPI AG in Remote Sensing
- Vol. 10 (4) , 622
A Framelet-Based Iterative Pan-Sharpening Approach
Pan-sharpening is used to fuse multispectral images and panchromatic images to produce a multispectral image with high spatial resolution. In this paper, we design a new iterative method based on framelet for pan-sharpening. The proposed model takes advantage of the upsampled multispectral image and a linear relation between the panchromatic image and the latent high-resolution multispectral image. Since the sparsity of the pan-sharpened image under a B-spline framelet transform is assumed, we regularize the model by penalizing norm of a framelet based term. The model is solved by a designed algorithm based on alternating direction method of multipliers (ADMM). For better performance, we propose an iterative strategy to pick up more spectral and spatial details. Experiments on four datasets demonstrate that the proposed method outperforms several existing pan-sharpening methods.- 18 April 2018
- Published by MDPI AG in Remote Sensing
- Vol. 10 (4) , 622
Open AccessA Framelet-Based Iterative Pan-Sharpening Approach
Pan-sharpening is used to fuse multispectral images and panchromatic images to produce a multispectral image with high spatial resolution. In this paper, we design a new iterative method based on framelet for pan-sharpening. The proposed model takes advantage of the upsampled multispectral image and a linear relation between the panchromatic image and the latent high-resolution multispectral image. Since the sparsity of the pan-sharpened image under a B-spline framelet transform is assumed, we regularize the model by penalizing norm of a framelet based term. The model is solved by a designed algorithm based on alternating direction method of multipliers (ADMM). For better performance, we propose an iterative strategy to pick up more spectral and spatial details. Experiments on four datasets demonstrate that the proposed method outperforms several existing pan-sharpening methods.