用几何分区方法,从语义分割直接推导高光谱解混结果。
Polyhedral Unmixing: Bridging Semantic Segmentation with Hyperspectral Unmixing via Polyhedral-Cone Partitioning
- 基于线性混合模型,将分类结果映射为光谱空间中的多面锥区域。
- 无需预先知道端元,仅通过分割标签即可实现盲解混,准确率提升显著。
- 适合希望控制解混过程的用户,尤其适用于遥感图像分析。
语义分割与高光谱解混是光谱图像分析中的两个核心问题:前者为每个像素分配离散材料类别标签,后者估计纯物质光谱(端元)及各像素的物质丰度。尽管两者互补,但通常独立处理。本文首次在线性混合模型下证明,按主导材料分类像素会诱导光谱空间中多面锥区域。据此提出直接的分割到解混管道:利用标注像素构建最佳拟合的多面锥分区,计算像素到区域的带符号距离,经基变换后投影到概率单纯形,获得初始丰度估计;再通过矩阵伪逆提取端元并恢复最终丰度。由于可自由选择分割方法,用户能显式控制解混流程,其余部分确定且轻量。三个真实数据集实验表明,结合合适聚类算法时,本方法持续优于近期深度与非深度最优方法。代码已开源。
原文摘要 · Abstract (English)
Semantic segmentation and hyperspectral unmixing are two central problems in spectral image analysis. The former assigns each pixel a discrete label corresponding to its material class, whereas the latter estimates pure material spectra, called endmembers, and, for each pixel, a vector representing material abundances in the observed scene. Despite their complementarity, these two problems are usually addressed independently. This paper aims to bridge these two lines of work by formally showing that, under the linear mixing model, pixel classification by dominant materials induces polyhedral-cone regions in the spectral space. We leverage this fundamental property to propose a direct segmentation-to-unmixing pipeline that performs blind hyperspectral unmixing from any semantic segmentation by constructing a polyhedral-cone partition of the space that best fits the labeled pixels. Signed distances from pixels to the estimated regions are then computed, linearly transformed via a change of basis in the distance space, and projected onto the probability simplex, yielding an initial abundance estimate. This estimate is used to extract endmembers and recover final abundances via matrix pseudo-inversion. Because the segmentation method can be freely chosen, the user gains explicit control over the unmixing process, while the rest of the pipeline remains essentially deterministic and lightweight. Beyond improving interpretability, experiments on three real datasets demonstrate the effectiveness of the proposed approach when associated with appropriate clustering algorithms, and show consistent improvements over recent deep and non-deep state-of-the-art methods. The code is available at: https://github.com/antoine-bottenmuller/polyhedral-unmixing
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。