基于单像素特征的浅层分类模型:面向超光谱成像的AI赋能卫星边缘计算
AI-enabled Satellite Edge Computing: A Single-Pixel Feature based Shallow Classification Model for Hyperspectral Imaging
AI总结:
本文提出了一种基于单像素特征的浅层分类模型,用于超光谱成像的AI赋能卫星边缘计算,解决卫星资源限制和图像质量下降问题。
摘要:
作为地球观测系统的重要组成部分,超光谱成像卫星凭借强大的光谱测量能力,为相关政策的制定提供了高保真和丰富的信息。然而,卫星下行链路的传输速度在某些应用中已成为主要瓶颈,例如灾害监测和应急制图,这些应用要求快速响应能力。我们提出了一种高效的AI赋能卫星边缘计算范式,用于超光谱图像分类,使卫星能够实现自主决策。为适应卫星平台的资源限制,所提出的方法采用了一种轻量级、非深度学习框架,并结合了少量样本学习策略。此外,卫星上的处理可能面临传感器故障和扫描模式误差,导致图像质量下降,出现坏像素或错位像素和混合噪声。为解决这些挑战,我们开发了一种新颖的两阶段像素级标签传播方案,该方案仅利用单像素级别的内在光谱特征,而无需考虑深度神经网络所要求的空间结构信息。在第一阶段,通过构造的锚点-像素亲和矩阵传播选定的锚点标签以获得初始像素标签。随后,通过直接计算像素级相似性生成一个top-k修剪的稀疏图。在第二阶段,通过从稀疏图中导出的闭式解来替代迭代计算。此外,我们还开发了一种基于排名约束的图聚类算法来确定锚点标签。
英文摘要:
As the important component of the Earth observation system, hyperspectral imaging satellites provide high-fidelity and enriched information for the formulation of related policies due to the powerful spectral measurement capabilities. However, the transmission speed of the satellite downlink has become a major bottleneck in certain applications, such as disaster monitoring and emergency mapping, which demand a fast response ability. We propose an efficient AI-enabled Satellite Edge Computing paradigm for hyperspectral image classification, facilitating the satellites to attain autonomous decision-making. To accommodate the resource constraints of satellite platforms, the proposed method adopts a lightweight, non-deep learning framework integrated with a few-shot learning strategy. Moreover, onboard processing on satellites could be faced with sensor failure and scan pattern errors, which result in degraded image quality with bad/misaligned pixels and mixed noise. To address these challenges, we develop a novel two-stage pixel-wise label propagation scheme that utilizes only intrinsic spectral features at the single pixel level without the necessity to consider spatial structural information as requested by deep neural networks. In the first stage, initial pixel labels are obtained by propagating selected anchor labels through the constructed anchor-pixel affinity matrix. Subsequently, a top-k pruned sparse graph is generated by directly computing pixel-level similarities. In the second stage, a closed-form solution derived from the sparse graph is employed to replace iterative computations. Furthermore, we developed a rank constraint-based graph clustering algorithm to determine the anchor labels.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。