Si Wang

Si Wang


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 August 2017 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
SWSi Wang
Si Wang
THTing-Zhu Huang
Ting-Zhu Huang
Xi-Le ZhaoXi-Le Zhao
Xi-Le Zhao
JMJin-Jin Mei
Jin-Jin Mei
JHJie Huang
Jie Huang

1 April 2019 in Signal Processing: Image Communication
Verified
Journal Article
Closed access
WXWen-Hao Xu
Wen-Hao Xu
Xi-Le ZhaoXi-Le Zhao
Xi-Le Zhao
TJTeng-Yu Ji
Teng-Yu Ji
JMJia-Qing Miao
Jia-Qing Miao
TMTian-Hui Ma
Tian-Hui Ma
THTing-Zhu Huang
Ting-Zhu Huang

1 March 2019 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
JYJing-Hua Yang
Jing-Hua Yang
Xi-Le ZhaoXi-Le Zhao
Xi-Le Zhao
JMJin-Jin Mei
Jin-Jin Mei
SWSi Wang
Si Wang
TMTian-Hui Ma
Tian-Hui Ma
THTing-Zhu Huang
Ting-Zhu Huang

1 January 2019 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
MDMeng Ding
Meng Ding
THTing-Zhu Huang
Ting-Zhu Huang
SWSi Wang
Si Wang
JMJin-Jin Mei
Jin-Jin Mei
Xi-Le ZhaoXi-Le Zhao
Xi-Le Zhao

3 July 2018 in Remote Sensing
Verified
Journal Article
Open access
PDF file
SWSi Wang
Si Wang
THTing-Zhu Huang
Ting-Zhu Huang
XZXile Zhao
Xile Zhao
GLGang Liu
Gang Liu
YCYougan Cheng
Yougan Cheng
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.

1 May 2017 in Applied Mathematical Modelling
Verified
Journal Article
Closed access
JLJun Liu
Jun Liu
THTing-Zhu Huang
Ting-Zhu Huang
XLXiao-Guang Lv
Xiao-Guang Lv
SWSi Wang
Si Wang