The corner detection algorithm, avoidance of the degeneration problem and the fundamental matrix iterative optimization algorithm based on rank-2 constraint were introduced.
给出了角点检测算法、退化问题的避免措施以及基于秩2约束的基础矩阵迭代优化求解的方法。
The stationary condition and stationary queue length distribution are given in terms of matrix iterative solution. Block probability and block time probability distribution are given.
给出了排队平稳条件以及用矩阵迭代法得到了平稳队长分布和受阻概率分布。
Basied on the iterative method in this paper, a calculating formula of matrix iteration was derived.
本文在迭代法基础上推导出矩阵迭代法的计算公式。
应用推荐