Sparse Hyperspectral Unmixing With Preference-Based Evolutionary Multiobjective Multitasking Optimization

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Emerging Topics in Computational Intelligence Pub Date : 2024-02-12 DOI:10.1109/TETCI.2024.3359070
Hao Li;Dezhong Li;Maoguo Gong;Jianzhao Li;A. K. Qin;Lining Xing;Fei Xie
{"title":"Sparse Hyperspectral Unmixing With Preference-Based Evolutionary Multiobjective Multitasking Optimization","authors":"Hao Li;Dezhong Li;Maoguo Gong;Jianzhao Li;A. K. Qin;Lining Xing;Fei Xie","doi":"10.1109/TETCI.2024.3359070","DOIUrl":null,"url":null,"abstract":"The traditional sparse unmixing methods based on multiobjective evolutionary algorithms (MOEAs) only deal with a single mixed pixel, without considering the spatial structure relationship between different mixed pixels. In addition, these methods suffer from the curse of dimensionality caused by the large number of pixels in hyperspectral image and spectra in library. In this paper, an evolutionary multitasking unmixing based on weakly nondominated sorting (EMTU-WNS) algorithm is proposed to alleviate these existing issues. First, a hyperspectral image is classified into multiple homogeneous regions, and the unmixing of pixels in the same region is constructed as a multiobjective optimization task. Then all the tasks are optimized simultaneously by using a population in the design of genetic transfer of intra-task and inter-task. In comparison with the original unmixing task with all pixels, these tasks in multiple homogeneous regions are relatively simple in term of dimensionality. Furthermore, it is inefficient for individuals to explore the whole search space. Therefore sparsity-constrained genetic operators are designed to evolve individuals towards the preference sparsity region. Finally, a preference-based weakly nondominated sorting is proposed to increase the number of nondominated solutions and maintain the diversity. The experimental results on three hyperspectral data sets demonstrate the effectiveness of EMTU-WNS with better convergence characteristics and unmixing accuracy.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":null,"pages":null},"PeriodicalIF":5.3000,"publicationDate":"2024-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10432946/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The traditional sparse unmixing methods based on multiobjective evolutionary algorithms (MOEAs) only deal with a single mixed pixel, without considering the spatial structure relationship between different mixed pixels. In addition, these methods suffer from the curse of dimensionality caused by the large number of pixels in hyperspectral image and spectra in library. In this paper, an evolutionary multitasking unmixing based on weakly nondominated sorting (EMTU-WNS) algorithm is proposed to alleviate these existing issues. First, a hyperspectral image is classified into multiple homogeneous regions, and the unmixing of pixels in the same region is constructed as a multiobjective optimization task. Then all the tasks are optimized simultaneously by using a population in the design of genetic transfer of intra-task and inter-task. In comparison with the original unmixing task with all pixels, these tasks in multiple homogeneous regions are relatively simple in term of dimensionality. Furthermore, it is inefficient for individuals to explore the whole search space. Therefore sparsity-constrained genetic operators are designed to evolve individuals towards the preference sparsity region. Finally, a preference-based weakly nondominated sorting is proposed to increase the number of nondominated solutions and maintain the diversity. The experimental results on three hyperspectral data sets demonstrate the effectiveness of EMTU-WNS with better convergence characteristics and unmixing accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于偏好的多目标进化多任务优化的稀疏高光谱解混技术
传统的基于多目标进化算法(MOEAs)的稀疏解混合方法只处理单个混合像素,而不考虑不同混合像素之间的空间结构关系。此外,这些方法还受到高光谱图像中大量像素和库中光谱所带来的维度诅咒的困扰。本文提出了一种基于弱非支配排序的进化多任务解混合算法(EMTU-WNS)来缓解这些现有问题。首先,将高光谱图像划分为多个同质区域,并将同一区域内像素的解混合构建为多目标优化任务。然后,通过设计任务内和任务间遗传转移的种群,同时优化所有任务。与原始的所有像素的解混合任务相比,多个同质区域的这些任务在维度上相对简单。此外,个体探索整个搜索空间的效率很低。因此,设计了稀疏性约束遗传算子,使个体向偏好稀疏性区域进化。最后,提出了一种基于偏好的弱非支配排序法,以增加非支配解的数量并保持多样性。在三个高光谱数据集上的实验结果表明,EMTU-WNS 具有更好的收敛特性和解混合精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
期刊最新文献
Table of Contents IEEE Computational Intelligence Society Information IEEE Transactions on Emerging Topics in Computational Intelligence Information for Authors IEEE Transactions on Emerging Topics in Computational Intelligence Publication Information A Novel Multi-Source Information Fusion Method Based on Dependency Interval
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1