A Method of Registration Based on Skeleton for 2-D Shapes

CORC > 兰州理工大学 > 兰州理工大学 > 新能源学院

	A Method of Registration Based on Skeleton for 2-D Shapes
	Li, Ce; Luo, Xinying; Du, Shaoyi; Xiao, Limei
	2012
关键词	Iterative Closest Point (ICP) shape point sets point set registration skeleton
页码	810-813
英文摘要	The iterative closest point (ICP) algorithm is an accurate approach for the registration between two point sets on the same scale. However, number and noise of two point sets restrict good performance of ICP algorithm. This paper proposes a novel ICP algorithm based on skeleton (SKICP). The proposed algorithm is to denoise and speed up the point set matching process using skeleton of multi-scale point sets. Firstly, we extract the sparse skeletons from the lower resolution original point set, which have fewer points including its structure features. Secondly, the point set of skeletons is quickly matched in lower resolution, and an initial transformation matrix between two point sets acquired. Finally, the initial transformation matrix is used as the initial value for a more precise registration at high resolution using less iterations. Experiments demonstrate the SKICP algorithm has faster speed and better robustness on 2-D Shapes point set than the traditional ICP algorithm.
会议录	2012 5TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING (CISP)
会议录出版者	IEEE
会议录出版地	345 E 47TH ST, NEW YORK, NY 10017 USA
语种	英语
WOS研究方向	Engineering
WOS记录号	WOS:000317021100171
内容类型	会议论文
源URL	[http://119.78.100.223/handle/2XXMBERH/37221]
专题	新能源学院电气工程与信息工程学院
通讯作者	Li, Ce
作者单位	Lanzhou Univ Technol, Coll Elect & Informat Engn, Lanzhou, Peoples R China
推荐引用方式 GB/T 7714	Li, Ce,Luo, Xinying,Du, Shaoyi,et al. A Method of Registration Based on Skeleton for 2-D Shapes[C]. 见:.