多亲密混合物的同时聚类和嵌入

A. Saranathan, M. Parente
{"title":"多亲密混合物的同时聚类和嵌入","authors":"A. Saranathan, M. Parente","doi":"10.1109/IGARSS.2015.7326292","DOIUrl":null,"url":null,"abstract":"Classical unmixing algorithms focus primarily on scenarios with a single mixture. These techniques are easily extensible in the case of images with multiple discrete mixtures (i.e. no shared endmembers). Unmixing in scenarios with multiple mixtures with shared or common endmembers is significantly harder. Manifold clustering and embedding seem tailor-made for such a scenario, but generally these algorithms focus on intersecting manifolds (i.e. manifolds that pass through each other) rather than adjoining manifolds (i.e. manifolds that share a boundary) as is the case with mixtures. In this paper we propose a NNMF based technique for simultaneous manifold clustering and embedding of adjoining manifolds. The algorithm is based on including a clustering term in the objective for finding an appropriate reconstruction matrix. The performance of the new algorithm is tested on a toy dataset made of a couple of simulated manifolds which share a boundary and a simulated dataset made up of two ternary Hapke mixtures with two shared endmembers. The algorithm shows improvements on the state-of-the-art manifold clustering algorithms in terms of both clustering and embedding.","PeriodicalId":125717,"journal":{"name":"2015 IEEE International Geoscience and Remote Sensing Symposium (IGARSS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Simultaneous clustering and embedding for multiple intimate mixtures\",\"authors\":\"A. Saranathan, M. Parente\",\"doi\":\"10.1109/IGARSS.2015.7326292\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Classical unmixing algorithms focus primarily on scenarios with a single mixture. These techniques are easily extensible in the case of images with multiple discrete mixtures (i.e. no shared endmembers). Unmixing in scenarios with multiple mixtures with shared or common endmembers is significantly harder. Manifold clustering and embedding seem tailor-made for such a scenario, but generally these algorithms focus on intersecting manifolds (i.e. manifolds that pass through each other) rather than adjoining manifolds (i.e. manifolds that share a boundary) as is the case with mixtures. In this paper we propose a NNMF based technique for simultaneous manifold clustering and embedding of adjoining manifolds. The algorithm is based on including a clustering term in the objective for finding an appropriate reconstruction matrix. The performance of the new algorithm is tested on a toy dataset made of a couple of simulated manifolds which share a boundary and a simulated dataset made up of two ternary Hapke mixtures with two shared endmembers. The algorithm shows improvements on the state-of-the-art manifold clustering algorithms in terms of both clustering and embedding.\",\"PeriodicalId\":125717,\"journal\":{\"name\":\"2015 IEEE International Geoscience and Remote Sensing Symposium (IGARSS)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Geoscience and Remote Sensing Symposium (IGARSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IGARSS.2015.7326292\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Geoscience and Remote Sensing Symposium (IGARSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IGARSS.2015.7326292","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

经典的解混算法主要关注单一混合的场景。这些技术在具有多个离散混合(即没有共享端元)的图像的情况下易于扩展。在具有共享或共同端元的多种混合物的情况下,分离要困难得多。流形聚类和嵌入似乎是为这种场景量身定制的,但通常这些算法关注相交流形(即相互穿过的流形),而不是像混合流形那样关注相邻流形(即共享边界的流形)。本文提出了一种基于NNMF的流形聚类和相邻流形嵌入同时进行的技术。该算法是基于在目标中加入聚类项来寻找合适的重构矩阵。在一个由两个共享边界的模拟流形组成的玩具数据集和一个由两个共享端元的三元hake混合物组成的模拟数据集上测试了新算法的性能。该算法在聚类和嵌入两方面都对当前最先进的流形聚类算法进行了改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Simultaneous clustering and embedding for multiple intimate mixtures
Classical unmixing algorithms focus primarily on scenarios with a single mixture. These techniques are easily extensible in the case of images with multiple discrete mixtures (i.e. no shared endmembers). Unmixing in scenarios with multiple mixtures with shared or common endmembers is significantly harder. Manifold clustering and embedding seem tailor-made for such a scenario, but generally these algorithms focus on intersecting manifolds (i.e. manifolds that pass through each other) rather than adjoining manifolds (i.e. manifolds that share a boundary) as is the case with mixtures. In this paper we propose a NNMF based technique for simultaneous manifold clustering and embedding of adjoining manifolds. The algorithm is based on including a clustering term in the objective for finding an appropriate reconstruction matrix. The performance of the new algorithm is tested on a toy dataset made of a couple of simulated manifolds which share a boundary and a simulated dataset made up of two ternary Hapke mixtures with two shared endmembers. The algorithm shows improvements on the state-of-the-art manifold clustering algorithms in terms of both clustering and embedding.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信