arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.07593cs.CV
收藏

高光谱数据稀疏约束分布式混合分解

Sparsity Constrained Distributed Unmixing of Hyperspectral Data

Qom University of Technology(库姆理工大学);Shiraz University(设拉子大学)

Sara Khoshsokhan, Roozbeh Rajabi, Hadi Zayyani

摘要:

光谱解混是一种对遥感高光谱图像混合像元进行特征化的技术。大多数光谱分解算法都是基于线性混合模型的。在盲问题中,非负矩阵分解(NMF)及其发展被广泛应用于端元和分数丰度矩阵的估计。NMF中加入的约束之一是稀疏性,它通过Lq范数进行正则化。本文提出了一种基于分布式优化的混合光谱分解新算法。在该算法中,一个网络,包括单节点集群。高光谱图像中的每个像素被认为是该网络中的一个节点。采用扩散最小平均p幂(LMP)策略对稀疏约束分布式解混进行优化,得到了分数丰度和特征矩阵的更新方程。然后,针对不同的LMP功率和Lq范数值,对所提出的算法进行了分析。基于定义的性能指标的仿真结果表明,与其他方法相比,该算法在高光谱数据的光谱分解中具有优势。

英文摘要:

Spectral unmixing (SU) is a technique to characterize mixed pixels in hyperspectral images measured by remote sensors. Most of the spectral unmixing algorithms are developed using the linear mixing models. To estimate endmembers and fractional abundance matrices in a blind problem, nonnegative matrix factorization (NMF) and its developments are widely used in the SU problem. One of the constraints which was added to NMF is sparsity, that was regularized by Lq norm. In this paper, a new algorithm based on distributed optimization is suggested for spectral unmixing. In the proposed algorithm, a network including single-node clusters is employed. Each pixel in the hyperspectral images is considered as a node in this network. The sparsity constrained distributed unmixing is optimized with diffusion least mean p-power (LMP) strategy, and then the update equations for fractional abundance and signature matrices are obtained. Afterwards the proposed algorithm is analyzed for different values of LMP power and Lq norms. Simulation results based on defined performance metrics illustrate the advantage of the proposed algorithm in spectral unmixing of hyperspectral data compared with other methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑