Adaptive multiscale sparse unmixing for hyperspectral remote sensing image

IF 1.2 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Science and Information Systems Pub Date : 2023-01-01 DOI:10.2298/csis220828009l
Yalan Li, Qian Du, Yixuan Li, Wenwu Xie, Jing Yuan, Lin Li, Chen Qi
{"title":"Adaptive multiscale sparse unmixing for hyperspectral remote sensing image","authors":"Yalan Li, Qian Du, Yixuan Li, Wenwu Xie, Jing Yuan, Lin Li, Chen Qi","doi":"10.2298/csis220828009l","DOIUrl":null,"url":null,"abstract":"Sparse unmixing of hyperspectral images aims to separate the endmembers and estimate the abundances of mixed pixels. This approach is the essential step for many applications involving hyperspectral images. The multi scale spatial sparse hyperspectral unmixing algorithm (MUA) could achieve higher accuracy than many state-of-the-art algorithms. The regularization parameters, whose combinations markedly influence the unmixing accuracy, are determined by manually searching in the broad parameter space, leading to time consuming. To settle this issue, the adaptive multi-scale spatial sparse hyperspectral unmixing algorithm (AMUA) is proposed. Firstly, the MUA model is converted into a new version by using of a maximum a posteriori (MAP) system. Secondly, the theories indicating that andnorms are equivalent to Laplacian and multivariate Gaussian functions, respectively, are applied to explore the strong connections among the regularization parameters, estimated abundances and estimated noise variances. Finally, the connections are applied to update the regularization parameters adaptively in the optimization process of unmixing. Experimental results on both simulated data and real hyperspectral images show that the AMUA can substantially improve the unmixing efficiency at the cost of negligible accuracy. And a series of sensitive experiments were undertook to verify the robustness of the AMUA algorithm.","PeriodicalId":50636,"journal":{"name":"Computer Science and Information Systems","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science and Information Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.2298/csis220828009l","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Sparse unmixing of hyperspectral images aims to separate the endmembers and estimate the abundances of mixed pixels. This approach is the essential step for many applications involving hyperspectral images. The multi scale spatial sparse hyperspectral unmixing algorithm (MUA) could achieve higher accuracy than many state-of-the-art algorithms. The regularization parameters, whose combinations markedly influence the unmixing accuracy, are determined by manually searching in the broad parameter space, leading to time consuming. To settle this issue, the adaptive multi-scale spatial sparse hyperspectral unmixing algorithm (AMUA) is proposed. Firstly, the MUA model is converted into a new version by using of a maximum a posteriori (MAP) system. Secondly, the theories indicating that andnorms are equivalent to Laplacian and multivariate Gaussian functions, respectively, are applied to explore the strong connections among the regularization parameters, estimated abundances and estimated noise variances. Finally, the connections are applied to update the regularization parameters adaptively in the optimization process of unmixing. Experimental results on both simulated data and real hyperspectral images show that the AMUA can substantially improve the unmixing efficiency at the cost of negligible accuracy. And a series of sensitive experiments were undertook to verify the robustness of the AMUA algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高光谱遥感图像的自适应多尺度稀疏解混
高光谱图像稀疏解混的目的是分离端元并估计混合像元的丰度。这种方法对于许多涉及高光谱图像的应用来说是必不可少的一步。多尺度空间稀疏高光谱解调算法(MUA)具有比现有算法更高的解调精度。正则化参数的组合对解混精度影响较大,通常是在较宽的参数空间内人工搜索确定,耗时较长。针对这一问题,提出了自适应多尺度空间稀疏高光谱解调算法(AMUA)。首先,利用最大后验(MAP)系统将MUA模型转换为新的模型;其次,应用拉普拉斯函数和多元高斯函数等价的理论,探讨正则化参数与估计丰度和估计噪声方差之间的强联系。最后,在解混优化过程中,利用这些连接自适应更新正则化参数。在模拟数据和真实高光谱图像上的实验结果表明,AMUA可以显著提高解混效率,但精度可以忽略不计。并通过一系列灵敏实验验证了AMUA算法的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Science and Information Systems
Computer Science and Information Systems COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
2.30
自引率
21.40%
发文量
76
审稿时长
7.5 months
期刊介绍: About the journal Home page Contact information Aims and scope Indexing information Editorial policies ComSIS consortium Journal boards Managing board For authors Information for contributors Paper submission Article submission through OJS Copyright transfer form Download section For readers Forthcoming articles Current issue Archive Subscription For reviewers View and review submissions News Journal''s Facebook page Call for special issue New issue notification Aims and scope Computer Science and Information Systems (ComSIS) is an international refereed journal, published in Serbia. The objective of ComSIS is to communicate important research and development results in the areas of computer science, software engineering, and information systems.
期刊最新文献
Reviewer Acknowledgements for Computer and Information Science, Vol. 16, No. 3 Drawbacks of Traditional Environmental Monitoring Systems Improving the Classification Ability of Delegating Classifiers Using Different Supervised Machine Learning Algorithms Reinforcement learning - based adaptation and scheduling methods for multi-source DASH On the Convergence of Hypergeometric to Binomial Distributions
×
引用
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