工件四特征点的粗配准方法研究

工件自动配准在柔性生产装配中至关重要,其中装配工件CAD模型数据和实测点云数据的配准是关键技术之一。针对装配工件和CAD模型的配准问题,提出了一种基于工件四特征点的粗配准算法。获得配准物体CAD模型数据和实测点云数据后,该方法包含四步:点云数据取样,特征四点集提取,特征一致四点集寻找,计算变换一致性矩阵。以正方体为模型的仿真实验结果显示该配准方法正确可行,以维纳斯石膏像作为实验对象进行配准实验,当点云数据为80000点时,点到点的误差均值为0.0622mm。该算法稳定,配准结果可以作为精确配准算法ICP(Iterative Closest Point)等的叠代初值。     

旋转台多视场扫描点云的自动配准方法

三维扫描需要将不同视角下获取的点云数据进行配准,并统一到全局坐标系。针对旋转台扫描得到的点云数据提出了一种自动配准方法,其基本思路是先用NDT算法作粗配准,将待配准的两片点云旋转平移到较好的初始位置,接着用ICP算法作精配准。经实验证明:该方法配准速度快、精度高。     

基于分层块状全局搜索的三维点云自动配准

提出了一种分层块状全局搜索到临近点局部搜索的改进迭代最近点(ICP)算法,用于进一步提高ICP算法的配准速度并消除点云缺失对点云配准的影响。该配准方法在粗略配准之后,以点云块为分层单元对模型点集进行选取,并对选取的少量模型点进行全局搜索获取其对应最近点;然后,以这些模型点对应的最近点作为搜索中心,在场景点集中进行局部搜索,获取这些模型点的大量临近点的对应最近点;最后,剔除错误对应最近点对,并求取坐标变换。与基于KD-Tree的ICP算法和基于LS+HS(Logarithmic Search Combined with Hierarchical Model Point Selection )的ICP算法相比,该配准算法对Happy bunny扫描数据的配准速度分别提高了78%和24%;对Dragon扫描数据的配准速度分别提高了73%和30%。这些结果表明该算法可以快速、精确地实现三维点云间的配准。     

余量约束下的毛坯测量数据与CAD模型配准技术研究

为在加工前剔除变形的不合格毛坯或在加工时避免由于定位不够精确而出现余量不足,需在余量约束要求下将毛坯测量数据与CAD模型进行配准.针对此配准问题,提出“二步法”求解:第一步暂不考虑余量约束,用ICP算法进行配准,检查结果是否满足余量要求,满足则退出计算,否则,进行第二步,即考虑余量约束对ICP结果作进一步配准.实验结果表明,该方法能够有效实现毛坯测量数据与CAD模型在余量约束下的配准.     

基于分支限界的三维曲面全局配准方法

在三维测量中常需要将测量点云数据与已知曲面模型进行配准。采用隐式函数建立点云数据到曲面模型的距离场,进而进行非线性优化求解可以有效提升配准效率。然而由于点到曲面的近似距离及刚性变换的约束,其误差函数呈现非凸性而导致迭代极易陷入局部最优。为实现全局配准,提出了一种利用分支限界算法搜索点到曲面近似距离平方和误差函数最小化变换参数的方法。通过确定刚体变换参数空间中误差函数的上下界限加快搜索,并结合一种等效距离公式的LevenbergMarquardt算法优化的局部配准方法加速收敛并保证配准精度。三维模型的配准实验与分析验证了本文全局配准方法的有效性。     

层次优化的颅骨点云配准

颅骨配准是颅面复原的重要步骤之一,其配准精度和效率对复原结果有着重要的影响。为了提高颅骨点云模型的配准精度和效率,本文提出了一种层次优化的颅骨点云配准方法。将颅骨配准分为粗配准和细配准两个过程。首先对颅骨点云模型进行去噪、简化和归一化等预处理;然后对颅骨点云模型提取特征点并计算其特征序列,根据特征序列进行约束寻找初始对应点对,并采用k-means算法剔除误匹配点,实现颅骨粗配准;最后通过加入几何特征约束的改进迭代最近点(ICP)算法实现颅骨细配准,从而达到颅骨精确配准的目的。本文分别对粗配准、细配准和先粗再细完整配准过程进行实验,结果表明:粗配准过程,与未优化的粗配准算法相比,本文优化后的粗配准算法的配准精度提高了约35%,算法耗时增加了约6%;细配准过程,与ICP算法相比,本文改进ICP算法的配准精度和收敛速度分别提高了约20%和43%,算法耗时减少了约47%;先粗再细的完整配准过程,本文算法的配准精度和收敛速度都要优于其他两种方法。证明了本文方法是一种有效的颅骨点云配准算法,可以实现颅骨点云的精确配准。     

精铸涡轮叶片的误差分析技术

针对精铸涡轮叶片的检测和模具型腔设计中存在的精度控制问题,运用配准技术来进行误差分析,分别以形心、收缩中心、中心轴线点为特征点,运用CAD模型引导的最临近点迭代ICP(iterative closet point)配准方法,将叶片实际测量数据和CAD模型进行配准。对比配准结果,得到了精铸过程中误差分布,并通过分析叶片的变形情况,得出以形心为特征点时,型面重合度最大,配准效果最好,为叶片精铸模具的型腔设计提供了量化的参考依据。     

复杂曲面测量数据的位姿配准方法

针对三维测量数据和自由曲面模型之间的位姿配准问题,研究了先粗后精的两步配准方法。在初始配准的基础上,融合最小二乘法和最小条件原则构造目标函数,应用微分进化算法对目标函数寻优,找出三维测量数据与理论曲面的最佳匹配矩阵以实现最优配准。实验结果表明,该方法与遗传算法相比具有运算速度快和精度高等特点,能较好的解决复杂曲面类零件测量数据的位姿配准问题,并且可用于逆向工程中曲面误差的分析及修正。     

基于扩展高斯球的点云数据与CAD模型配准

针对点云数据和三维CAD模型坐标配准过程中初始对应位置无法定量确定及最临近点计算效率问题,提出基于扩展高斯球的快速模板匹配算法,通过点云数据扩展高斯球空间与笛卡尔空间的相互转换,使外特征配准算法中测量点云与三维CAD模型初始位置的确定得到定量解决.为提高配准算法中点云数据与三维CAD模型最临近点的计算效率,采用三维CAD模型引导点云对测量数据与三维CAD模型进行桥接,从而将测量点与自由曲面的数值迭代计算问题转化为三维空间中最临近点的空间搜索,使算法的效率得到提升,实例验证了算法的有效性.     

基于球面特征的点云配准方法研究

针对多视点云的配准问题,提出了基于球面特征的自动配准方法。在测量的零件周围固定标准球,把零件和标准球作为一个整体进行点云测量。用球面拟合的方法求解标准球的球心坐标,并在待配准点云的球心坐标中搜索对应点,从而计算粗配准中的旋转矩阵和平移矩阵,实现点云的粗配准,采用融入球心坐标信息的改进的ICP算法(迭代最近点法)实现点云的精配准。这种方法大大缩少了粗配准中对应点的搜索范围,并实现了自动配准,提高了配准效率,改进的ICP算法增强了配准算法的鲁棒性,实例证明该方法有效。     

Automated feature-based registration for reverse engineering of human models

In order to reconstruct a full 3D human model in reverse engineering (RE), a 3D scanner needs to be placed arbitrarily around the target model to capture all part of the scanned surface. Then, acquired multiple scans must be registered and merged since each scanned data set taken from different position is just given in its own local co-ordinate system. The goal of the registration is to create a single model by aligning all individual scans. It usually consists of two sub-steps: rough and fine registration. The fine registration process can only be performed after an initial position is approximated through the rough registration. Hence an automated rough registration process is crucial to realize a completely automatic RE system. In this paper an automated rough registration method for aligning multiple scans of complex human face is presented. The proposed method automatically aligns the meshes of different scans with the information of features that are extracted from the estimated principal curvatures of triangular meshes of the human face. Then the roughly aligned scanned data sets are further precisely enhanced with a fine registration step with the recently popular Iterative Closest Point (ICP) algorithm. Some typical examples are presented and discussed to validate the proposed system.     

叶片机器人砂带磨抛点云匹配算法优化

为解决机器人磨抛路径中工件坐标系难以计算的问题及校正工件装夹误差,将三维点云配准技术应用到叶片机器人砂带磨抛系统中。由三维激光扫描仪扫描工件型面获得工件点云,采用基于主成分分析(PCA)的全局配准算法和改进的迭代最近点(ICP)算法完成了扫描点云和工件模型离散点云间以及不同工件扫描点云间的匹配,以获取工件坐标系和校正工件装夹误差。相关仿真和试验结果表明,优化后的算法在匹配速度与精度上有了长足改进,且加工后产品精度和质量都能满足实际加工要求。     

AIWIN—a fast and jigless inspection technique for machined parts

Precision inspection of manufactured components having multiple complex surfaces and variable tolerance definition is an involved, complex and time-consuming function. In routine practice, a jig is used to present the part in a known reference frame to carry out the inspection process. Jigs involve both time and cost in their development, manufacture and use. This paper describes ‘as is where is inspection’ (AIWIN), a new automated inspection technique that accelerates the inspection process by carrying out a fast registration procedure and establishing a quick correspondence between the part to inspect and its CAD geometry. The main challenge in doing away with a jig is that the inspection reference frame could be far removed from the CAD frame. Traditional techniques based on iterative closest point (ICP) or Newton methods require either a large number of iterations for convergence or fail in such a situation. A two-step coarse registration process is proposed to provide a good initial guess for a modified ICP algorithm developed earlier (Ravishankar et al., Int J Adv Manuf Technol 46(1–4):227–236, 2010). The first step uses a calibrated sphere for local hard registration and fixing the translation error. This transformation locates the centre for the sphere in the CAD frame. In the second step, the inverse transformation (involving pure rotation about multiple axes) required to align the inspection points measured on the manufactured part with the CAD point dataset of the model is determined and enforced. This completes the coarse registration enabling fast convergence of the modified ICP algorithm. The new technique has been implemented on complex freeform machined components and the inspection results clearly show that the process is precise and reliable with rapid convergence.     

Repeated surface registration for on-line use

We consider the problem of matching sets of 3D points from a measured surface to the surface of a corresponding computer-aided design (CAD) object. The problem arises in the production line where the shape of the produced items is to be compared on-line with its pre-described shape. The involved registration problem is solved using the iterative closest point (ICP) method. In order to make it suitable for on-line use, i.e., make it fast, we pre-process the surface representation of the CAD object. A data structure for this purpose is proposed and named Distance Varying Grid tree. It is based on a regular grid that encloses points sampled from the CAD surfaces. Additional finer grids are added to the vertices in the grid that are close to the sampled points. The structure is efficient since it utilizes that the sampled points are distributed on surfaces, and it provides fast identification of the sampled point that is closest to a measured point. A local linear approximation of the surface is used for improving the accuracy. Experiments are done on items produced for the body of a car. The experiments show that it is possible to reach good accuracy in the registration and decreasing the computational time by a factor 700 compared with using the common kd-tree structure.     

应用改进迭代最近点方法的三维心脏点云配准

在医学多图谱配准中,为了改善因初始位置差异较大、形状复杂和局部残缺导致的配准效率低和精度差的问题,本文采用了先粗配准再精配准的处理策略,在主成分分析法(PCA)实现粗配准的基础上,提出了基于双向距离比例的迭代最近点(ICP)的精配准算法。精配准算法中,首先采用KD-tree进行最近邻搜索以提高对应点对的搜索速度,然后为每个点提出了双向匹配方法并计算其双向距离和比值,为进一步提高配准精度,引入了一个指数函数判断点对正确匹配概率,最后运用奇异值分解法(SVD)计算最终变换矩阵。为了验证算法的可行性和有效性,分别设计了不同缺损程度的斯坦福点云数据实验和两组CT心脏点云数据配准实验,结果表明本文方法较经典ICP算法的平均误差减少约21%,较TrICP算法减少约13%,在心脏点云数据配准实验中,本文方法较TrICP算法的15.5 s加快到1.77 s。因此本文方法在解决三维心脏点云数据的配准问题中具有良好的效率、精度和稳定性。     

曲面零件的数字化检测

介绍了已有CAD模型以及基于该模型生产出来的样件,通过对样件进行数据采集,利用采集的点云数据与已有CAD模型之间的相对特征来对二者进行粗定位,进而用ICP算法对二者进行精确定位,最后用点到曲面的最小距离的算法来对样件和CAD模型进行误差分析,以此解决曲面类零件因其形状不规则而难以对其制造误差进行检测的问题。     

基于激光扫描和SFM的非同步点云三维重构方法

室外场景具有测量数据量大、扫描数据易重叠及建筑物表面信息复杂等特点,单靠激光扫描方法能够获得场景精确的深度信息,但缺乏颜色和纹理信息,利用从运动中恢复结构(SFM)方法可获得丰富的彩色信息,但重构精度不高,若将两种设备固定进行在线实时同步测量,易受到测量环境和系统制约不易实现。针对此问题,提出了一种基于激光扫描和SFM结合的非同步点云数据融合的三维重构方法。首先,提出利用手动选择控制点进行7自由度初始配准,再利用迭代最近点(ICP)算法对初始配准结果进行精确配准,最后利用最近点搜索算法将分布在经基于面片的多视图立体视觉(PMVS)算法优化后的SFM数据中的颜色信息与激光扫描的点云坐标进行融合。实验结果和数据分析显示,本文的方法能有效地将激光扫描与SFM点云数据进行融合,实现了室外大场景的三维彩色重构。     

基于继承与优化算法的无序点云拼接技术的研究

摘要：点云拼接技术的核心是建立两个待拼接点云之间的对应关系。提出继承与优化算法进行点云精确拼接,阐述了算法原理,通过建模获取拼接过程中的旋转和平移参数,提出并分析了拼接的实现过程。采用光栅投射式三维扫描仪获取某型号汽车防雨板的6组点云数据,使用提出的算法进行点云拼接,采用多分辨率层次精度分析法对拼接结果进行误差分析,与最临近点迭代法在拼接精度、收敛速度和耗时上进行了比较。实验结果表明：继承与优化算法可实现海量无序点云的精确拼接,拼接的标准偏差小于0.10mm,两点云对拼接时间小于2秒,相比最临近点迭代法,所需迭代次数减少5次以上。