检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李彩林[1] 王志勇[1] 俞路路 郭宝云[1] LI Cailin;WANG Zhiyong;YU Lulu;GUO Baoyun(School of Civil and Architectural Engineering, Shandong University of Technology, Zibo 255000, China)
机构地区:[1]山东理工大学建筑工程学院,山东淄博255000
出 处:《测绘学报》2020年第8期1014-1022,共9页Acta Geodaetica et Cartographica Sinica
基 金:国家自然科学基金(41601496,41701525);山东省重点研发计划项目(2018GGX106002);山东省自然科学基金资助项目(ZR2017LD002);山东省艺术科学重点课题(201806353);山东理工大学齐文化研究专项(2017QWH032)。
摘 要:提出一种以最邻近曲面为约束的近景光学影像与地面激光点云高精度配准方法。根据光学影像生成三维稀疏点云,以影像三维稀疏点邻近的激光点拟合的曲面为约束,结合共线条件方程建立影像三维稀疏点云与三维激光点云间变换模型,通过平差迭代解算实现光学影像与激光点云的高精度几何配准。该方法只需提供初始配准参数,无需对激光点云数据进行特征提取和分割,并且基于曲面约束有效地解决了两个点集之间难以精确确定同名点的问题。通过实际数据试验表明该方法能获得很好的配准精度。In this paper,a high-precision registration method based on the nearest surface for close-range optical image and terrestrial laser point cloud is proposed.Three-dimensional sparse point cloud is generated from optical images.Constrained by the local surface fitted by the laser points adjacent to the 3D sparse point of the image,a transformation model between the three-dimensional sparse point cloud and the three-dimensional laser point cloud is constructed by using collinear conditional equation.The high precision geometric registration of optical images and the laser point cloud is completed by iterative calculation.The method only needs initial registration parameter and does not need to perform feature extraction and segmentation on the laser point cloud data.In addition,the problem that it is difficult to accurately determine the correspondence points between two sets of points is solved effectively based on the surface constraint.The results of two sets of experimental data show that this method can effectively improve the accuracy of rigid registration algorithm,and can achieve higher registration accuracy.
分 类 号:P227[天文地球—大地测量学与测量工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15