A CLUSTERING SUCCESSIVE POCS ALGORITHM FOR FAST POINT MATCHING

摘要：

This paper proposes a clustering successive projections onto convex sets (CSPOCS) algorithm for enforcing two way constraints originated from point matching. Via point clustering, the problem of projection onto convex set (POCS)where the convex set is described by point correspondences constraints is converted to the POCS problem where the convex set is described by cluster correspondences constraints.Then the successive POCS (SPOCS) technique is employed to solve the POCS problem. The resulting algorithm can be viewed as a generalization of SPOCS by combining with clustering. Its precision and computational load are decided by the average radius of clusters. Experimental results demonstrate the effectiveness of the algorithm.

关键词： Clustering Point matching POCS

作者: WEI LIAN YAN LIANG QUAN PAN YONG-MEI CHEN HONG-CAI ZHANG

作者单位: Department of Control and Information Engineering, College of Automation,Northwestern Polytechnical University, Xian,China

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 3903-3908

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）