arXiv:2601.18560cs.CV2026-01

轻量级单像素特征分类模型,助力卫星实时高光谱图像分析

AI-enabled Satellite Edge Computing: A Single-Pixel Feature based Shallow Classification Model for Hyperspectral Imaging

  • 基于单像素谱特征的非深度浅层模型,免于空间结构依赖
  • 两阶段标签传播机制,支持故障与错位像素下的鲁棒分类
  • 闭式解替代迭代计算,适合资源受限的卫星边缘部署

高光谱成像卫星作为地球观测系统的关键组成部分,凭借强大的光谱测量能力,为政策制定提供高保真、丰富信息。然而,在灾害监测与应急制图等需快速响应的应用中,星上下行链路传输速度已成为主要瓶颈。本文提出一种高效AI赋能的卫星边缘计算范式,实现高光谱图像的自主分类决策。针对卫星平台资源受限问题,采用轻量级非深度学习框架,并结合少量样本学习策略。同时,星上处理常受传感器故障和扫描模式误差影响,导致图像质量下降、像素错位或混合噪声。为此,提出一种新型两阶段逐像素标签传播方案,仅利用单像素内在光谱特征,无需深度网络依赖的空间结构信息。第一阶段通过构建锚点-像素相似性矩阵,传播选定锚点标签获取初始标签;第二阶段直接计算像素级相似性,生成top-k稀疏图,再采用闭式解替代迭代优化。此外,设计基于秩约束的图聚类算法自动确定锚点标签。

原文摘要 · Abstract (English)

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.

高光谱图像边缘计算单像素特征轻量化模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。