为了对基于确定性退火技术的点匹配算法进行改进，提出了一种采用二次式作为阻尼项的算法。现有的此类算法为了控制匹配矩阵P的熵，通常都在目标函数中加入∑Pi,jlogpi,j形式的阻尼项，其缺点是需要用迭代逼近的方法使P满足双向的行列约束，由于这会因引起误差的积累而降低算法的整体匹配精度，为此，提出采用∑Pi,j(Pi,j-1)形式的阻尼项，这样目标函数就成为P的正定二次式，因而就可以在退火的每一步求解出使目标函数最小的Po仿真结果表明，该新算法在精确性和稳定性方面都有显著的改善。

The problem of Point-sets matching frequently arises in the domains of computer vision and medical imaging. In this paper, a new deterministic-annealing-based point-matching algorithm is presented, in which a quadratic form is used as barrier term. The existing deterministic-annealing-based algorithms usually add barrier term of the form∑pi,jlogpi,jinto their objective functions in order to control matching matrixP' s entropy. The shortcoming is thatP' s two-way constraint conditions need to be satisfied by either using Sinkhorn method or other kinds of methods. These methods are generally iterative approximate, and in practice, have the risk of lowering point-matching' s accuracy. To tackle the problem, we propose to use the form∑pi,j(pi,j-1) as barrier term. In doing so, the objective function becomesP' s positive quadrative form, and the resultingPwhich minimizes the objective function in each step of the deterministic annealing can be exactly solved for. Simulation results demonstrate the effectiveness and robustness of the algorithm.