关联矩阵法在独立基线及独立双差模糊度选择中的应用

在介绍两类共4种独立基线搜索算法的基础上,提出了关联矩阵法。结合算例对比了各算法解决独立基线搜索的最优性及优缺点,进一步研究了关联矩阵法应用于独立双差模糊度选择的优势。最后,将该算法推广到解决高维空间的独立性问题。

Application of Vertex Incidence Matrix Algorithm to Independent Baselines Search and Independent Double-Difference Ambiguity Selection

To solve the problem of independent baselines search,we introduced four classical algorithms generalized into two categories.We proposed a new algorithm based on vertex incidence matrix.And we analyzed the optimality and relative merits of these five methods.The simulation results verify the effectiveness and advantages of the proposed algorithm.Moreover,we studied the application of the new method to independent double-difference ambiguity selection.The study has demonstrated that the proposed algorithm outperforms the existing methods and can be extended to a higher dimensional space.Besides,we mertioned a new concept of vector weight.