For motion correspondence problem of highly similar multi-objects, the paper proposes a novel heuristic criterion with a relaxation algorithm to obtain its optimal solution.

• 摘要针对高相似度密集移动的多目标对位问题，提出了一种新的启发式对位条件，并给出了求取其优化解的松驰迭代算法;