Multi-objective hyperspectral unmixing algorithm based on high-order nonlinear mixing model

2019 ◽  
Vol 48 (10) ◽  
pp. 1026002
Author(s):  
甘士忠 Gan Shizhong ◽  
肖志涛 Xiao Zhitao ◽  
陈 雷 Chen Lei ◽  
南瑞杰 Nan Ruijie
2021 ◽  
pp. 108214
Author(s):  
Saeideh Ghanbari Azar ◽  
Saeed Meshgini ◽  
Soosan Beheshti ◽  
Tohid Yousefi Rezaii

Author(s):  
Daniel Gallego-Sánchez ◽  
José M. Granado-Criado ◽  
Sergio Santander-Jiménez ◽  
Álvaro Rubio-Largo ◽  
Miguel A. Vega-Rodríguez

2019 ◽  
Vol 11 (19) ◽  
pp. 2188
Author(s):  
Li ◽  
Zhu ◽  
Guo ◽  
Chen

Spectral unmixing of hyperspectral images is an important issue in the fields of remotesensing. Jointly exploring the spectral and spatial information embedded in the data is helpful toenhance the consistency between mixing/unmixing models and real scenarios. This paper proposesa graph regularized nonlinear unmixing method based on the recent multilinear mixing model(MLM). The MLM takes account of all orders of interactions between endmembers, and indicates thepixel-wise nonlinearity with a single probability parameter. By incorporating the Laplacian graphregularizers, the proposed method exploits the underlying manifold structure of the pixels’ spectra,in order to augment the estimations of both abundances and nonlinear probability parameters.Besides the spectrum-based regularizations, the sparsity of abundances is also incorporated for theproposed model. The resulting optimization problem is addressed by using the alternating directionmethod of multipliers (ADMM), yielding the so-called graph regularized MLM (G-MLM) algorithm.To implement the proposed method on large hypersepectral images in real world, we proposeto utilize a superpixel construction approach before unmixing, and then apply G-MLM on eachsuperpixel. The proposed methods achieve superior unmixing performances to state-of-the-artstrategies in terms of both abundances and probability parameters, on both synthetic and real datasets.


Genes ◽  
2021 ◽  
Vol 12 (2) ◽  
pp. 191
Author(s):  
Yuanyuan Chen ◽  
Fengjiao Xu ◽  
Cong Pian ◽  
Mingmin Xu ◽  
Lingpeng Kong ◽  
...  

In genome-wide association studies, detecting high-order epistasis is important for analyzing the occurrence of complex human diseases and explaining missing heritability. However, there are various challenges in the actual high-order epistasis detection process due to the large amount of data, “small sample size problem”, diversity of disease models, etc. This paper proposes a multi-objective genetic algorithm (EpiMOGA) for single nucleotide polymorphism (SNP) epistasis detection. The K2 score based on the Bayesian network criterion and the Gini index of the diversity of the binary classification problem were used to guide the search process of the genetic algorithm. Experiments were performed on 26 simulated datasets of different models and a real Alzheimer’s disease dataset. The results indicated that EpiMOGA was obviously superior to other related and competitive methods in both detection efficiency and accuracy, especially for small-sample-size datasets, and the performance of EpiMOGA remained stable across datasets of different disease models. At the same time, a number of SNP loci and 2-order epistasis associated with Alzheimer’s disease were identified by the EpiMOGA method, indicating that this method is capable of identifying high-order epistasis from genome-wide data and can be applied in the study of complex diseases.


Sign in / Sign up

Export Citation Format

Share Document