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.