The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this prob...The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this problem,we propose a new affine registration algorithm based on correntropy which works well in the affine registration of point sets with outliers.Firstly,we substitute the traditional measure of least squares with a maximum correntropy criterion to build a new registration model,which can avoid the influence of outliers.To maximize the objective function,we then propose a robust affine ICP algorithm.At each iteration of this new algorithm,we set up the index mapping of two point sets according to the known transformation,and then compute the closed-form solution of the new transformation according to the known index mapping.Similar to the traditional ICP algorithm,our algorithm converges to a local maximum monotonously for any given initial value.Finally,the robustness and high efficiency of affine ICP algorithm based on correntropy are demonstrated by 2D and 3D point set registration experiments.展开更多
Background There are many regularly shaped objects in artificial environments.It is difficult to distinguish the poses of these objects when only geometric information is used.With the development of sensor technologi...Background There are many regularly shaped objects in artificial environments.It is difficult to distinguish the poses of these objects when only geometric information is used.With the development of sensor technologies,inclusion of other information can be used to solve this problem.Methods We propose an algorithm to register point clouds by integrating color information.The key idea of the algorithm is to jointly optimize the dense and edge terms.The dense term was built in a manner similar to that of the iterative closest point algorithm.To build the edge term,we extracted the edges of the images obtained by projecting point clouds.The edge term prevents the point clouds from sliding during registration.We used this loosely coupled method to fuse geometric and color information.Results The results of the experiments showed that the edge image approach improves precision,and the algorithm is robust.展开更多
Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information belo...Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information below the forest canopy due to the occlusion of trees in natural forests.In contrast,TLS is unable to gather fi ne structure information about the upper canopy.To address the problem of incomplete acquisition of natural forest point cloud data by ALS and TLS on a single platform,this study proposes data registration without control points.The ALS and TLS original data were cropped according to sample plot size,and the ALS point cloud data was converted into relative coordinates with the center of the cropped data as the origin.The same feature point pairs of the ALS and TLS point cloud data were then selected to register the point cloud data.The initial registered point cloud data was fi nely and optimally registered via the iterative closest point(ICP)algorithm.The results show that the proposed method achieved highprecision registration of ALS and TLS point cloud data from two natural forest plots of Pinus yunnanensis Franch.and Picea asperata Mast.which included diff erent species and environments.An average registration accuracy of 0.06 m and 0.09 m were obtained for P.yunnanensis and P.asperata,respectively.展开更多
For reverse engineering a CAD model, it is necessary to integrate measured points from several views of an object into a common reference frame. Given a rough initial alignment of point cloud in different views with p...For reverse engineering a CAD model, it is necessary to integrate measured points from several views of an object into a common reference frame. Given a rough initial alignment of point cloud in different views with point-normal method, further refinement is achieved by using an improved iterative closest point (ICP) algorithm. Compared with other methods used for mult-view registration, this approach is automatic because no geometric feature, such as line, plane or sphere needs to be extracted from the original point cloud manually. A good initial alignment can be acquired automatically and the registration accuracy and efficiency is proven better than the normal point-point ICP algorithm both experimentally and theoretically.展开更多
基于点云的空间非合作目标位姿估计,常受到噪声影响.提出截断最小二乘估计与半定松弛(truncated least squares estimation and semidefinite relaxation,TEASER)与迭代最近点(iterative closest point,ICP)的结合算法,提升空间非合作...基于点云的空间非合作目标位姿估计,常受到噪声影响.提出截断最小二乘估计与半定松弛(truncated least squares estimation and semidefinite relaxation,TEASER)与迭代最近点(iterative closest point,ICP)的结合算法,提升空间非合作目标位姿估计精度与鲁棒性.该方法包括粗配准与精配准两个环节:在粗配准环节中,基于局部点云与模型点云的方向直方图特征(signature of histogram of orientation,SHOT)确定匹配对,利用TEASER算法求解初始位姿;在精配准环节中,可结合ICP算法优化位姿估计结果.北斗卫星仿真实验表明:在连续帧位姿估计中,噪声标准差为3倍点云分辨率时,基于TEASER的周期关键帧配准方法的平移误差小于3.33 cm,旋转误差小于2.18°;与传统ICP方法相比,平均平移误差与平均旋转误差均有所降低.这表明所提出的空间非合作目标位姿估计方法具有良好的精度和鲁棒性.展开更多
针对点云配准过程中点云数据冗余、易出现误匹配点对和配准精度低的问题,提出了一种融合超体素及几何特征的点云配准方法。首先使用超体素与法向量信息相结合的方法提取特征点;其次,在粗配准中,通过使用快速特征点直方图(Fast Point Fea...针对点云配准过程中点云数据冗余、易出现误匹配点对和配准精度低的问题,提出了一种融合超体素及几何特征的点云配准方法。首先使用超体素与法向量信息相结合的方法提取特征点;其次,在粗配准中,通过使用快速特征点直方图(Fast Point Feature Histograms,FPFH)进行特征描述,采用双向最近邻比获取初始特征点对应关系,基于法向量夹角策略和随机采样一致性(Random Sample Consensus,RANSAC)算法进行对应关系的优化,获取良好的初始位姿;最后,在精配准中,基于初始位姿与改进的迭代最近点算法(Iterative Closest Point,ICP)算法完成点云配准。通过在斯坦福数据集中进行配准实验,验证了所提算法具有更好的鲁棒性,能高效且精准的完成点云配准。展开更多
Multi-view laser radar (ladar) data registration in obscure environments is an important research field of obscured target detection from air to ground. There are few overlap regions of the observational data in dif...Multi-view laser radar (ladar) data registration in obscure environments is an important research field of obscured target detection from air to ground. There are few overlap regions of the observational data in different views because of the occluder, so the multi-view data registration is rather difficult. Through indepth analyses of the typical methods and problems, it is obtained that the sequence registration is more appropriate, but needs to improve the registration accuracy. On this basis, a multi-view data registration algorithm based on aggregating the adjacent frames, which are already registered, is proposed. It increases the overlap region between the pending registration frames by aggregation and further improves the registration accuracy. The experiment results show that the proposed algorithm can effectively register the multi-view ladar data in the obscure environment, and it also has a greater robustness and a higher registration accuracy compared with the sequence registration under the condition of equivalent operating efficiency.展开更多
A novel multi-view 3D face registration method based on principal axis analysis and labeled regions orientation called local orientation registration is proposed.The pre-registration is achieved by transforming the mu...A novel multi-view 3D face registration method based on principal axis analysis and labeled regions orientation called local orientation registration is proposed.The pre-registration is achieved by transforming the multi-pose models to the standard frontal model's reference frame using the principal axis analysis algorithm.Some significant feature regions, such as inner and outer canthus, nose tip vertices, are then located by using geometrical distribution characteristics.These regions are subsequently employed to compute the conversion parameters using the improved iterative closest point algorithm, and the optimal parameters are applied to complete the final registration.Experimental results implemented on the proper database demonstrate that the proposed method significantly outperforms others by achieving 1.249 and 1.910 mean root-mean-square measure with slight and large view variation models, respectively.展开更多
In order to obtain and master the surface thermal deformation of paraboloid antennas,a fast iterative closest point( FICP) algorithm based on design coordinate guidance is proposed,which can satisfy the demands of rap...In order to obtain and master the surface thermal deformation of paraboloid antennas,a fast iterative closest point( FICP) algorithm based on design coordinate guidance is proposed,which can satisfy the demands of rapid detection for surface thermal deformation. Firstly,the basic principle of the ICP algorithm for registration of a free surface is given,and the shortcomings of the ICP algorithm in the registration of surface are analysed,such as its complex computation,long calculation time,low efficiency,and relatively strict initial registration position. Then an improved FICP algorithm based on design coordinate guidance is proposed. Finally,the FICP algorithm is applied to the fast registration test for the surface thermal deformation of a paraboloid antenna. Results indicate that the approach offers better performance with regard to fast surface registration and the algorithm is more simple,efficient,and easily realized in practical engineering application.展开更多
基金supported in part by the National Natural Science Foundation of China(61627811,61573274,61673126,U1701261)
文摘The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this problem,we propose a new affine registration algorithm based on correntropy which works well in the affine registration of point sets with outliers.Firstly,we substitute the traditional measure of least squares with a maximum correntropy criterion to build a new registration model,which can avoid the influence of outliers.To maximize the objective function,we then propose a robust affine ICP algorithm.At each iteration of this new algorithm,we set up the index mapping of two point sets according to the known transformation,and then compute the closed-form solution of the new transformation according to the known index mapping.Similar to the traditional ICP algorithm,our algorithm converges to a local maximum monotonously for any given initial value.Finally,the robustness and high efficiency of affine ICP algorithm based on correntropy are demonstrated by 2D and 3D point set registration experiments.
文摘Background There are many regularly shaped objects in artificial environments.It is difficult to distinguish the poses of these objects when only geometric information is used.With the development of sensor technologies,inclusion of other information can be used to solve this problem.Methods We propose an algorithm to register point clouds by integrating color information.The key idea of the algorithm is to jointly optimize the dense and edge terms.The dense term was built in a manner similar to that of the iterative closest point algorithm.To build the edge term,we extracted the edges of the images obtained by projecting point clouds.The edge term prevents the point clouds from sliding during registration.We used this loosely coupled method to fuse geometric and color information.Results The results of the experiments showed that the edge image approach improves precision,and the algorithm is robust.
基金supported by the National Natural Science Foundation of China,Grant Number 41961060by the Program for Innovative Research Team (in Science and Technology) in the University of Yunnan Province,Grant Number IRTSTYN+1 种基金by the Scientific Research Fund Project of the Education Department of Yunnan Province,Grant Numbers 2020J0256 and 2021J0438by the Postgraduate Scientific Research and Innovation Fund Project of Yunnan Normal University,Grant Number YJSJJ21-A08
文摘Airborne laser scanning(ALS)and terrestrial laser scanning(TLS)has attracted attention due to their forest parameter investigation and research applications.ALS is limited to obtaining fi ne structure information below the forest canopy due to the occlusion of trees in natural forests.In contrast,TLS is unable to gather fi ne structure information about the upper canopy.To address the problem of incomplete acquisition of natural forest point cloud data by ALS and TLS on a single platform,this study proposes data registration without control points.The ALS and TLS original data were cropped according to sample plot size,and the ALS point cloud data was converted into relative coordinates with the center of the cropped data as the origin.The same feature point pairs of the ALS and TLS point cloud data were then selected to register the point cloud data.The initial registered point cloud data was fi nely and optimally registered via the iterative closest point(ICP)algorithm.The results show that the proposed method achieved highprecision registration of ALS and TLS point cloud data from two natural forest plots of Pinus yunnanensis Franch.and Picea asperata Mast.which included diff erent species and environments.An average registration accuracy of 0.06 m and 0.09 m were obtained for P.yunnanensis and P.asperata,respectively.
基金the National Natural Science Foundation of China (59990470) and the NationalOutstanding Young Scientist Foundation of China (
文摘For reverse engineering a CAD model, it is necessary to integrate measured points from several views of an object into a common reference frame. Given a rough initial alignment of point cloud in different views with point-normal method, further refinement is achieved by using an improved iterative closest point (ICP) algorithm. Compared with other methods used for mult-view registration, this approach is automatic because no geometric feature, such as line, plane or sphere needs to be extracted from the original point cloud manually. A good initial alignment can be acquired automatically and the registration accuracy and efficiency is proven better than the normal point-point ICP algorithm both experimentally and theoretically.
文摘基于点云的空间非合作目标位姿估计,常受到噪声影响.提出截断最小二乘估计与半定松弛(truncated least squares estimation and semidefinite relaxation,TEASER)与迭代最近点(iterative closest point,ICP)的结合算法,提升空间非合作目标位姿估计精度与鲁棒性.该方法包括粗配准与精配准两个环节:在粗配准环节中,基于局部点云与模型点云的方向直方图特征(signature of histogram of orientation,SHOT)确定匹配对,利用TEASER算法求解初始位姿;在精配准环节中,可结合ICP算法优化位姿估计结果.北斗卫星仿真实验表明:在连续帧位姿估计中,噪声标准差为3倍点云分辨率时,基于TEASER的周期关键帧配准方法的平移误差小于3.33 cm,旋转误差小于2.18°;与传统ICP方法相比,平均平移误差与平均旋转误差均有所降低.这表明所提出的空间非合作目标位姿估计方法具有良好的精度和鲁棒性.
文摘Multi-view laser radar (ladar) data registration in obscure environments is an important research field of obscured target detection from air to ground. There are few overlap regions of the observational data in different views because of the occluder, so the multi-view data registration is rather difficult. Through indepth analyses of the typical methods and problems, it is obtained that the sequence registration is more appropriate, but needs to improve the registration accuracy. On this basis, a multi-view data registration algorithm based on aggregating the adjacent frames, which are already registered, is proposed. It increases the overlap region between the pending registration frames by aggregation and further improves the registration accuracy. The experiment results show that the proposed algorithm can effectively register the multi-view ladar data in the obscure environment, and it also has a greater robustness and a higher registration accuracy compared with the sequence registration under the condition of equivalent operating efficiency.
基金supported by the New Century Excellent Talents of China (NCET-05-0866)
文摘A novel multi-view 3D face registration method based on principal axis analysis and labeled regions orientation called local orientation registration is proposed.The pre-registration is achieved by transforming the multi-pose models to the standard frontal model's reference frame using the principal axis analysis algorithm.Some significant feature regions, such as inner and outer canthus, nose tip vertices, are then located by using geometrical distribution characteristics.These regions are subsequently employed to compute the conversion parameters using the improved iterative closest point algorithm, and the optimal parameters are applied to complete the final registration.Experimental results implemented on the proper database demonstrate that the proposed method significantly outperforms others by achieving 1.249 and 1.910 mean root-mean-square measure with slight and large view variation models, respectively.
基金Supported by the National Natural Science Foundation of China(No.51474217,41501562)the Open Fund Program of Henan Engineering Laboratory of Pollution Control and Coal Chemical Resources Comprehensive Utilization(No.502002-B07,502002-A04)
文摘In order to obtain and master the surface thermal deformation of paraboloid antennas,a fast iterative closest point( FICP) algorithm based on design coordinate guidance is proposed,which can satisfy the demands of rapid detection for surface thermal deformation. Firstly,the basic principle of the ICP algorithm for registration of a free surface is given,and the shortcomings of the ICP algorithm in the registration of surface are analysed,such as its complex computation,long calculation time,low efficiency,and relatively strict initial registration position. Then an improved FICP algorithm based on design coordinate guidance is proposed. Finally,the FICP algorithm is applied to the fast registration test for the surface thermal deformation of a paraboloid antenna. Results indicate that the approach offers better performance with regard to fast surface registration and the algorithm is more simple,efficient,and easily realized in practical engineering application.