基于Dykstra交替投影的快速光谱分解
Fast Spectral Unmixing based on Dykstra's Alternating Projection
摘要:
提出了一种基于Dykstra交替投影的快速混合光谱分解算法。所提出的算法制定的完全约束的最小二乘优化问题与光谱分解任务作为一个无约束的回归问题,然后投影到几个封闭的凸集的交集。这种投影是通过迭代地投影到每个凸集上来实现的,遵循Dyktra的方案。由此获得的序列保证收敛到所寻求的投影。由于初步的矩阵分解和变量替换,投影本质上是在子空间中实现的,子空间的维数通常远低于频带的数量。该策略的益处在于,每个投影的计算复杂性的阶从二次时间降低到线性时间。考虑不同光谱解混场景的数值实验提供了证据,表明所提出的算法与最先进的算法竞争,即当端元数量相对较少时,这是在实际高光谱应用中经常观察到的情况。
英文摘要:
This paper presents a fast spectral unmixing algorithm based on Dykstra's alternating projection. The proposed algorithm formulates the fully constrained least squares optimization problem associated with the spectral unmixing task as an unconstrained regression problem followed by a projection onto the intersection of several closed convex sets. This projection is achieved by iteratively projecting onto each of the convex sets individually, following Dyktra's scheme. The sequence thus obtained is guaranteed to converge to the sought projection. Thanks to the preliminary matrix decomposition and variable substitution, the projection is implemented intrinsically in a subspace, whose dimension is very often much lower than the number of bands. A benefit of this strategy is that the order of the computational complexity for each projection is decreased from quadratic to linear time. Numerical experiments considering diverse spectral unmixing scenarios provide evidence that the proposed algorithm competes with the state-of-the-art, namely when the number of endmembers is relatively small, a circumstance often observed in real hyperspectral applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。