Determining the number of endmembers of hyperspectral images using clustering

José Prades, A. Salazar, G. Safont, L. Vergara
{"title":"Determining the number of endmembers of hyperspectral images using clustering","authors":"José Prades, A. Salazar, G. Safont, L. Vergara","doi":"10.1109/CSCI51800.2020.00306","DOIUrl":null,"url":null,"abstract":"Some applications require knowing how many materials are present in the scene represented by a hyperspectral Image. In a previous paper, we presented an algorithm that estimated the number of materials in the scene using clustering principles. The proposed algorithm obtains a hierarchy of image partitions and selects a partition using a validation Index; the estimated number of materials is set to the number of dusters of the selected partition. In this algorithm, the user must provide the Image and the maximum number of materials that can be estimated (P). In this paper, we have extended our algorithm so that It does not require P as input parameter. The proposed method Iteratively performs the estimation for several increasing values of P and stops the process when a certain condition is met. The results obtained with five hyperspectral Images show that our algorithm approximately estimates the number of materials in that images.","PeriodicalId":336929,"journal":{"name":"2020 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Computational Science and Computational Intelligence (CSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCI51800.2020.00306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Some applications require knowing how many materials are present in the scene represented by a hyperspectral Image. In a previous paper, we presented an algorithm that estimated the number of materials in the scene using clustering principles. The proposed algorithm obtains a hierarchy of image partitions and selects a partition using a validation Index; the estimated number of materials is set to the number of dusters of the selected partition. In this algorithm, the user must provide the Image and the maximum number of materials that can be estimated (P). In this paper, we have extended our algorithm so that It does not require P as input parameter. The proposed method Iteratively performs the estimation for several increasing values of P and stops the process when a certain condition is met. The results obtained with five hyperspectral Images show that our algorithm approximately estimates the number of materials in that images.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用聚类方法确定高光谱图像的端元数
一些应用程序需要知道高光谱图像所代表的场景中存在多少材料。在之前的一篇论文中,我们提出了一种使用聚类原理估计场景中材料数量的算法。该算法获得图像分区的层次结构,并使用验证索引选择分区;预估的物料数量设置为所选分区的除尘器数量。在该算法中,用户必须提供图像和可以估计的最大材料数量(P)。在本文中,我们扩展了我们的算法,使其不需要P作为输入参数。该方法对P的几个递增值进行迭代估计,当满足一定条件时停止估计。对5张高光谱图像的实验结果表明,我们的算法可以近似地估计出图像中物质的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
First Success of Cancer Gene Data Analysis of 169 Microarrays for Medical Diagnosis Artificial Intelligence in Computerized Adaptive Testing Evidence for Monitoring the User and Computing the User’s trust Transfer of Hierarchical Reinforcement Learning Structures for Robotic Manipulation Tasks An open-source application built with R programming language for clinical laboratories to innovate process of excellence and overcome the uncertain outlook during the global healthcare crisis
×
引用
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