{"title":"A manifold-based adversarial autoencoder with Fourier convolution for hyperspectral unmixing","authors":"Ziyang Guo , Meixia Xiao , Fa Zhu , Xingchi Chen , Achyut Shankar , Mazdak Zamani , Sushil Kumar Singh","doi":"10.1016/j.asoc.2025.113176","DOIUrl":null,"url":null,"abstract":"<div><div>Hyperspectral unmixing aims to decompose each subpixel into their pure endmembers and the corresponding proportions. But existing deep autoencoder-based hyperspectral unmixing methods often suffer from obstacles like endmember variability, local respective fields and insufficient use of inner structure. In the manuscript, we build a manifold-based Fourier adversarial autoencoder which regards generative adversarial mechanism as a utilization of prior information. This method combines manifold learning with adversarial autoencoder in order to promote the performance of hyperspectral unmixing. Specifically, firstly, in order to preserve local manifold structure, we add a discriminator to the autoencoder which uses the covariance matrices of a superpixel as real samples while covariance matrices of the abundance as fake samples; secondly, we add a regularization term of Laplacian eigenmap at the loss of autoencoder to in-depth abbreviate autoencoder solution space; thirdly, Fast Fourier Convolution modules are used to enhance multi-scale information fusion. At last, comparative experiments are conducted on three popular datasets, including Jasper, Urban4 and Samson, to validate the effectiveness of the proposed method.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"177 ","pages":"Article 113176"},"PeriodicalIF":7.2000,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625004879","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Hyperspectral unmixing aims to decompose each subpixel into their pure endmembers and the corresponding proportions. But existing deep autoencoder-based hyperspectral unmixing methods often suffer from obstacles like endmember variability, local respective fields and insufficient use of inner structure. In the manuscript, we build a manifold-based Fourier adversarial autoencoder which regards generative adversarial mechanism as a utilization of prior information. This method combines manifold learning with adversarial autoencoder in order to promote the performance of hyperspectral unmixing. Specifically, firstly, in order to preserve local manifold structure, we add a discriminator to the autoencoder which uses the covariance matrices of a superpixel as real samples while covariance matrices of the abundance as fake samples; secondly, we add a regularization term of Laplacian eigenmap at the loss of autoencoder to in-depth abbreviate autoencoder solution space; thirdly, Fast Fourier Convolution modules are used to enhance multi-scale information fusion. At last, comparative experiments are conducted on three popular datasets, including Jasper, Urban4 and Samson, to validate the effectiveness of the proposed method.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.