摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法,并证明了算法是一个多项式时间算法。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
该方法在基于控制点的多项式粗配准的基础上,利用分类图像相关实现了基于仿射变换模型的精配准。
A feature matching (algorithm based) on classification is proposed, which uses the correlation of the classified images to realize a precise registration after a coarse (registration).
应用推荐