Component adaptive sparse representation for hyperspectral image classification

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Amos Bortiew, Swarnajyoti Patra, Lorenzo Bruzzone
{"title":"Component adaptive sparse representation for hyperspectral image classification","authors":"Amos Bortiew, Swarnajyoti Patra, Lorenzo Bruzzone","doi":"10.1007/s00500-024-09951-1","DOIUrl":null,"url":null,"abstract":"<p>Techniques that exploit spectral-spatial information have proven to be very effective in hyperspectral image classification. Joint sparse representation classification (JSRC) is one such technique which has been extensively used for this purpose. However, the use of a single fixed-sized window has limited its ability to incorporate spatial information. Several techniques such as multiscale superpixels based sparse representation classification (MSSRC), multiscale adaptive sparse representation classification (MASRC) and Discriminant Subdictionary Learning (DSDL) have tried to overcome this drawback by fusing information from different scales. However, their inability to simultaneously consider the correlated information at different scales and appropriate spatial neighbourhoods limits their performance. In order to better model contextual information, in this paper, we propose a modified max-tree and modified min-tree to represent the connected components of the image. Then, by exploiting these connected components, adaptive multiscale windows are defined. The potentiality of the proposed technique is validated by performing a comparative analysis with four state-of-the-art sparse representation methods using three real hyperspectral datasets. For a fixed training and test sets of University of Pavia and Indian Pines dataset, our proposed technique provides at least 3% and 2%, respectively higher classification results than the best state-of-the-art method.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"44 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00500-024-09951-1","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Techniques that exploit spectral-spatial information have proven to be very effective in hyperspectral image classification. Joint sparse representation classification (JSRC) is one such technique which has been extensively used for this purpose. However, the use of a single fixed-sized window has limited its ability to incorporate spatial information. Several techniques such as multiscale superpixels based sparse representation classification (MSSRC), multiscale adaptive sparse representation classification (MASRC) and Discriminant Subdictionary Learning (DSDL) have tried to overcome this drawback by fusing information from different scales. However, their inability to simultaneously consider the correlated information at different scales and appropriate spatial neighbourhoods limits their performance. In order to better model contextual information, in this paper, we propose a modified max-tree and modified min-tree to represent the connected components of the image. Then, by exploiting these connected components, adaptive multiscale windows are defined. The potentiality of the proposed technique is validated by performing a comparative analysis with four state-of-the-art sparse representation methods using three real hyperspectral datasets. For a fixed training and test sets of University of Pavia and Indian Pines dataset, our proposed technique provides at least 3% and 2%, respectively higher classification results than the best state-of-the-art method.

Abstract Image

用于高光谱图像分类的分量自适应稀疏表示法
事实证明,利用光谱空间信息的技术在高光谱图像分类中非常有效。联合稀疏表示分类(JSRC)就是这样一种技术,已被广泛用于此目的。然而,使用单一固定大小的窗口限制了其纳入空间信息的能力。基于多尺度超像素的稀疏表示分类(MSSRC)、多尺度自适应稀疏表示分类(MASRC)和判别子字典学习(DSDL)等几种技术试图通过融合不同尺度的信息来克服这一缺点。然而,它们无法同时考虑不同尺度的相关信息和适当的空间邻域,这限制了它们的性能。为了更好地模拟上下文信息,我们在本文中提出了修正的最大树和修正的最小树来表示图像的连接成分。然后,通过利用这些连接成分,定义了自适应多尺度窗口。通过使用三个真实的高光谱数据集与四种最先进的稀疏表示方法进行比较分析,验证了所提技术的潜力。对于帕维亚大学数据集和印度松树数据集的固定训练集和测试集,我们提出的技术比最先进的最佳方法的分类结果分别高出至少 3% 和 2%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Soft Computing
Soft Computing 工程技术-计算机:跨学科应用
CiteScore
8.10
自引率
9.80%
发文量
927
审稿时长
7.3 months
期刊介绍: Soft Computing is dedicated to system solutions based on soft computing techniques. It provides rapid dissemination of important results in soft computing technologies, a fusion of research in evolutionary algorithms and genetic programming, neural science and neural net systems, fuzzy set theory and fuzzy systems, and chaos theory and chaotic systems. Soft Computing encourages the integration of soft computing techniques and tools into both everyday and advanced applications. By linking the ideas and techniques of soft computing with other disciplines, the journal serves as a unifying platform that fosters comparisons, extensions, and new applications. As a result, the journal is an international forum for all scientists and engineers engaged in research and development in this fast growing field.
×
引用
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学术官方微信