含各向异性尺度形变数据集匹配问题的Lie群方法  

Lie Group Method for Data Set Registration Problem with Anisotropic Scale Deformation

作　　者：应时辉[1] 彭济根[2] 郑开杰[2,3] 乔红[4] 

机构地区：[1]上海大学理学院数学系,上海200444 [2]西安交通大学理学院信息与系统科学研究所,西安710049 [3]福建师范大学数学与计算机科学学院,福州350007 [4]中国科学院自动化研究所,北京100190

出　　处：《自动化学报》2009年第7期867-874,共8页Acta Automatica Sinica

基　　金：国家重点基础研究发展计划(973计划)(2007CB311002)资助~~

摘　　要：通过分析含各向异性尺度形变的数据集匹配问题,将尺度约束引入模型,再结合迭代最近点(Iterative closest point,ICP)方法的一般过程,将含各向异性尺度形变的数据集匹配问题描述为Lie群约束优化问题.通过Lie群的局部参数化和局部线性化方法,将带尺度上下界约束的Lie群约束优化问题转化为一系列的二次规划问题,最终形成了一个完整的匹配迭代算.该方法不仅具有传统ICP方法的快速准确的特点,而且还能够处理存在大尺度形变的数据集匹配问题.由于对尺度参数进行约束,因此比传统方法有更好的鲁棒性.最后,为确保匹配的全局性,给出了一套初始变换的选择方案.By analyzing the data set registration problem with anisotropic scale deformation, we introduced the con- straints to the model. Combining with the procedure of traditional iterative closest point （ICP） method, the registration problem was described as a constrained optimization problem. Using parameterized method by Lie group and quadric approximation to the objective function, the registration problem was translated into a series of quadratic programming problems. Then, a novel scale-registration algorithm was proposed. The numerical simulations showed that such method not only was rapid and accurate as the traditional ICP method, but also could deal with the registration problem with large scale deformation. By introducing the constraints to the scale parameters, the algorithm was more robust. A way for choosing the initial transformations was proposed to assume the global registration.

关 键 词：数据集匹配 各向异性尺度形变 LIE群 二次规划 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]