%0 Journal Article
%T Clustering Successive POCS for Fast Point Matching<br>用于快速特征点配准的聚类凸集投影算法
%A LIAN Wei
%A LIANG Yan
%A CHENG Yong-mei
%A PAN Quan
%A ZHANG Hong-cai
%A <br>连玮
%A 梁彦
%A 程咏梅
%A 潘泉
%A 张洪才
%J 中国图象图形学报
%D 2007
%I 
%X A clustering successive projection onto convex sets algorithm is presented for fast point matching.Via feature point clustering,the problem of matching two point sets is converted to that of matching corresponding clusters,which is then solved by a tailored successive projection onto covex sets(SPOCS) algorithm.The resulting algorithm can be viewed as an extention of SPOCS by combining with clustering.Its precision and computational complexity are decided by the clustering radius.Under the condition that the point sets' density is high,by choosing a proper radius,the computational burden can be reduced with only negligible deterioration of precision.Experimental results demonstrate the effectiveness of the algorithm.
%K clustering
%K registration
%K projection onto convex sets<br>聚类
%K 配准
%K 凸集投影
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D06194629680C940ACE75262F54B9D85&aid=3F56DD6CDC5CFF38&yid=A732AF04DDA03BB3&vid=59906B3B2830C2C5&iid=38B194292C032A66&sid=42D7028D961473F8&eid=25467A5A28500A25&journal_id=1006-8961&journal_name=中国图象图形学报&referenced_num=0&reference_num=11