旋转体三维重建方法研究

提出了一种新的旋转体三维重建方法。在该方法的实现过程中，首先利用旋转平台获取了旋转体的影像，然后基于物方的空间圆重建方法精确测量旋转体的上口，从而得到旋转体的旋转轴，再根据影像的方位元素对影像进行纠正，使得旋转体的轮廓线在影像上的成像左右对称。最后直接用纠正后的影像精确计算旋转体的形状。在理论上讲，利用一张影像就可以实现旋转体的三维重建，但在本文中使用了多张照片，主要是为了获取整个旋转体的纹理。对实际的旋转体进行三维重建，结果证明该方法是有效的。     

利用三视匹配元进行多视影像批处理重建

无序多视影像的三维重建对噪声非常敏感,错误的匹配关系会影响重建的精度,甚至直接导致重建失败。提出了一种稳健的批处理重建算法,首先利用回路闭合约束剔除可能存在误匹配的三视匹配元,然后以三视匹配元中的三焦张量约束代替传统算法的核线约束来计算所有影像旋转矩阵和相机中心位置的全局最优解。重建过程中引入高效的并查集算法来提取多视匹配点,并利用迭代线性三角形算法计算空间点的三维坐标。实验结果表明,所提算法在重建效率和计算精度方面都能取得较好的结果。     

动态空间正图像透视投影正反解

卫星图像都是在动态情形下获取的。瞬间曝光获取的图像投影性质符合透视投影。本文针对卫星动态获取的正图像,建立其平面透视投影,利用矢量解法研究其正反解变换和星下点坐标计算方法,最后给出了算例。     

高精度矢量数据的路面三维自动建模方法

为了解决路面手工三维建模速度慢、工作量大等问题,本文面向规范化处理的高精度矢量数据,对不同路口进行精细化设计,自动生成路面三维模型。首先使用道路高精度三维信息采集软件,在获取的点云数据中半自动化提取准确的道路边线、道路标识线等矢量信息;然后针对不同路口进行精细化线形设计,提出连续四边形重建方法、弯道平滑处理方法、交叉口重建方法及路面标识线投射重建方法;最后对提取的高精度矢量数据进行规范化处理,在满足路面线形设计要求后,借助MAXScript脚本实现路面三维自动化建模。以车载移动测量系统获取的某段道路点云数据进行试验,验证了该方法的可行性和有效性。     

利用横向切片进行地物三维重建

提出了一种基于横向切片的地物可量测性三维重构方法,利用平面单应变换和未标定的多视图完成三维重建。通过对重构物体成像进行轮廓约束及场景约束,假设一组平行平面切割重构地物,通过单应变换得到切片的轮廓线构成物体的形状,进而恢复各层轮廓线的三维值,并加入参考高度,求得重构物体的高度。实验证明了此方法对规则与不规则物体的重建均有效,使得整个三维的求解过程具有可测量性。     

基于三维狄洛尼三角网的曲面重建算法

随着三维激光扫描技术应用领域的不断拓展,对点云数据三维建模的需求越来越迫切。曲面重建技术作为三维建模的核心技术之一,在逆向工程、计算机视觉、计算机制图以及虚拟现实等技术领域都有着非常广泛的应用前景。本文提出一种基于三维狄洛尼三角网的曲面重建算法,其本质是一种结合了曲面生长算法思想的贪心算法,即在一定约束条件下,按照最优三角形选择标准,算法从预先构建好的三维狄洛尼三角网中,逐个筛选出最优三角形添加到生长曲面上,最终输出由一系列显式三角形所组成的流形曲面。这种方法对比目前主流的隐式曲面重建算法具有参数依赖性较小、不需要计算法线等优点,并且能够重建地形扫描、建筑物扫描和精细化扫描的点云模型。利用此算法对多种点云模型进行曲面重建试验,结果表明该算法生成曲面质量好、重建效率高、实用性强,能够很好地应用于三维建模领域。     

地形建模中不规则三角网构建的优化算法研究

对利用数字线划图（DLG）重建地形三维模型进行了研究，提出了基于三角形拓扑关系的自动联结三角网算法，并构造了复杂地形的三维数据模型。基于此模型，设计实现了构网优化算法，实现了复杂地形的自动三维重建。试验证明，本文提出的构网优化算法是稳健、高效的。     

一种融合多源特征的建筑物三维模型重建方法

以激光点云数据和倾斜多视影像为研究对象,提出了一种结合机载点云、地面点云及倾斜多视纹理的融合多源特征的建筑物三维模型重建方法。该方法结合点云面元以及影像边界特征,利用倾斜影像的线特征对顶面及立面模型进行边界规则约束,实现了面元自动拓扑重建;通过交互编辑完成不同复杂程度的建筑模型重建,并对模型进行纹理映射。实验结果表明,该方法能够有效提升城市建筑物三维模型重建的效率和边界精度,为利用多源数据的空地联合建筑物三维精细重建提供了一套切实可行的解决方案。     

城市街区和签到数据结合的个性化城市兴趣区域推荐方法

利用社交媒体用户的历史签到数据分析用户空间活动偏好实现用户兴趣区域推荐,在城市商业规划中起着重要作用,也为了解人们的城市生活和需求提供帮助。已有方法获得的ROI具有模糊性和多样性,无法给ROI赋予准确的地理描述信息,对用户来说可解释性不强。因此,本文提出了一种结合城市街区和签到数据的个性化兴趣区域推荐方法(CBCD),引入城市街区概念解决ROI边界模糊问题。首先,通过城市道路网生成城市街区,并将大规模签到数据映射到城市街区转换为区域签到;然后,基于区域签到对用户空间活动偏好和类别偏好分别进行个性化建模;最后,融合空间和类别活动偏好,向用户推荐其可能感兴趣的区域。在真实的数据集上进行试验,结果表明该方法具有较高的推荐精度,对用户感兴趣城市街区的挖掘和推荐具有一定的价值。     

DSM数据中多层次、多直角房屋的三维重建

根据房屋的层次结构特点,采用附加约束条件的最小二乘平差精化房屋几何模型,使得重建房屋满足现实世界中多数房屋邻接墙面直角相交的要求.对于非平顶房屋,采用法向量统计分析的方法与模型库中的房屋类型匹配,然后按匹配类型重建房顶.实验表明,本方法对于从DSM数据中重建多层次、多直角房屋和人字型屋顶等类型的房屋是行之有效的.     

一种复杂轮廓线的真三维TIN算法

针对多层轮廓线三维重构问题，研究了真三维复杂轮廓线的空间分布特征，通过引入参考基准面概念，提出了一种顾及局部平展特性的真三维TIN生成算法。该方法在递增生成表面过程中，利用了加权最小三角化方法，动态建立参考基准面，将三角面片自身形态和局部邻接轮廓点的相对空间关系有机地结合起来，避免了面片的遮掩重叠和自相交，使得重建表面和原始表面的拓扑差异最小。选取三维地震量测的多层反射波剖面数据进行了实验，并对不同算法得到的实验结果进行了分析比较，得出实验结论：本文算法快速可靠，重建出来的三维表面过渡光滑、自然，更接近实际的表面形态。该方法对于石油、地质勘探三维地质构造形态辅助解译具有现实的应用意义。     

3D range scan enhancement using image-based methods

This paper addresses the problem of 3D surface scan refinement, which is desirable due to noise, outliers, and missing measurements being present in the 3D surfaces obtained with a laser scanner. We present a novel algorithm for the fusion of absolute laser scanner depth profiles and photometrically estimated surface normal data, which yields a noise-reduced and highly detailed depth profile with large scale shape robustness. In contrast to other approaches published in the literature, the presented algorithm (1) regards non-Lambertian surfaces, (2) simultaneously computes surface reflectance (i.e. BRDF) parameters required for 3D reconstruction, (3) models pixelwise incident light and viewing directions, and (4) accounts for interreflections. The algorithm as such relies on the minimization of a three-component error term, which penalizes intensity deviations, integrability deviations, and deviations from the known large-scale surface shape. The solution of the error minimization is obtained iteratively based on a calculus of variations. BRDF parameters are estimated by initially reducing and then iteratively refining the optical resolution, which provides the required robust data basis. The 3D reconstruction of concave surface regions affected by interreflections is improved by compensating global illumination in the image data. The algorithm is evaluated based on eight objects with varying albedos and reflectance behaviors (diffuse, specular, metallic). The qualitative evaluation shows a removal of outliers and a strong reduction of noise, while the large scale shape is preserved. Fine surface details Which are previously not contained in the surface scans, are incorporated through using image data. The algorithm is evaluated with respect to its absolute accuracy using two caliper objects of known shape, and based on synthetically generated data. The beneficial effect of interreflection compensation on the reconstruction accuracy is evaluated quantitatively in a Photometric Stereo framework.     

多视密集匹配并行传播GPU-PatchMatch算法

针对多视密集匹配的效率较低的问题,提出了GPU-PatchMatch多视密集匹配算法。该算法使用GPU提高PatchMatch的计算效率;同时充分利用稀疏场景信息,对深度信息进行规则初始化;为提高传播效率,使用了金字塔红黑板并行传播深度信息。最后在DTU、Strecha和Vaihigen数据集上进行了试验,并与常用的多视密集匹配算法进行对比。试验结果表明,本文算法在重建效率上有较大提高,与CPU算法(PMVS、MVE、OpenMVS)相比有7倍以上提升,与GPU算法相比也有2.5倍以上提升,表明本文算法的有效性。     

3D information extraction from laser point clouds covering complex road junctions

An automated method for 3D modelling of complex highway interchanges is presented. Laser data and 2D topographic map data have been combined in an innovative 3D reconstruction procedure. Complex situations as shown in this paper demand knowledge to guide the automatic reconstruction. This knowledge has been used in the fusion procedure to constrain the topological and geometrical properties of the reconstructed 3D model. These additions are needed to take care of the lack of data in occluded areas. Laser data has been segmented and filtered before it is fused with map data. In the surface-growing algorithm combining map and laser points, the laser data is assigned to the corresponding road element. Although results are shown using two specific data sources, the algorithm is designed to be capable of dealing with any polygon-based topographic map and any aerial laser scanner data-set.     

三维建筑的三角重剖分算法

三维建筑是三维地物的主体,是三维城市和三维G IS的重要组成部分。三角面是三维图形可视化的基础,三角面的数量决定了三维建筑的渲染速度。针对三维建筑物建模及综合过程中存在冗余三角面的问题,本文提出了一种主要应用于三维综合的三角剖分算法。该算法包括两部分:基于邻面搜索的轮廓构造算法和任意多边形的剖分算法。实验证明此算法可实现大部分三维建筑的重剖分,其应用也可延伸到其他领域。     

Application of inertia ellipse in code marker matching

In close-range photogrammetry, 3D information acquisition is based on image matching. The application of code marker helps to improve the level of automatic matching and the matching accuracy. This paper investigates the application of inertia ellipse algorithm to code marker matching. We can calculate the inertia ellipse of a target with a certain boundary. First, the method is applied to a single code marker; the angle and scaling are valid. Then, the paper introduces the multi code markers matching method by the inertia ellipse. Rotation and scaling changes of homonymy images can be calculated by inertia ellipse algorithm. These parameters can be used for code marker matching in arbitrary attitude close-range photogrammetry.     

Application of inertia ellipse in code marker matching

In close-range photogrammetry, 3D information acquisition is based on image matching. The application of code marker helps to improve the level of automatic matching and the matching accuracy. This paper investigates the application of inertia ellipse algorithm to code marker matching. We can calculate the inertia ellipse of a target with a certain boundary. First, the method is applied to a single code marker; the angle and scaling are valid. Then, the paper introduces the multi code markers matching method by the inertia ellipse. Rotation and scaling changes of homonymy images can be calculated by inertia ellipse algorithm. These parameters can be used for code marker matching in arbitrary attitude close-range photogrammetry.     

A method for assessing generalized data accuracy with linear object resolution verification

The article is composed of two sections. In the first section, the authors describe the application of minimum line dimensions which are dependent on line shape, width and the operational scale of the map. The proposed solutions are based on the Euclidean metric space, for which the minimum dimensions of Saliszczew’s elementary triangle (Elementary triangle – is the term pertaining to model, standard triangle of least dimensions securing recognizability of a line. Its dimensions depend on scale of the map and width of the line representing it. The use of a triangle in the simplification process is as follows: triangles with sides (sections) on an arbitrary line and bases (completing the sides) are compared with lengths of the shorter side and the base of the elementary triangle.) were adapted. The second part of the article describes an application of minimum line dimensions for verifying and assessing generalized data. The authors also propose a method for determining drawing line resolution to evaluate the accuracy of algorithm simplification. Taking advantage of the proposed method, well-known simplification algorithms were compared on the basis of qualitative and quantitative evaluation. Moreover, corresponding with the methods of simplified data accuracy assessment the authors have extended these solutions with the rejected data. This procedure has allowed the identification of map areas where graphic conflicts occurred.     

3D road marking reconstruction from street-level calibrated stereo pairs

This paper presents an automatic approach to road marking reconstruction using stereo pairs acquired by a mobile mapping system in a dense urban area. Two types of road markings were studied: zebra crossings (crosswalks) and dashed lines. These two types of road markings consist of strips having known shape and size. These geometric specifications are used to constrain the recognition of strips. In both cases (i.e. zebra crossings and dashed lines), the reconstruction method consists of three main steps. The first step extracts edge points from the left and right images of a stereo pair and computes 3D linked edges using a matching process. The second step comprises a filtering process that uses the known geometric specifications of road marking objects. The goal is to preserve linked edges that can plausibly belong to road markings and to filter others out. The final step uses the remaining linked edges to fit a theoretical model to the data. The method developed has been used for processing a large number of images. Road markings are successfully and precisely reconstructed in dense urban areas under real traffic conditions.     

Multi-view dense matching supported by triangular meshes

We present a new procedure to compute dense 3D point clouds from a sequential set of images. This procedure is considered as a second step of a three-step algorithm for 3D reconstruction from image sequences, whose first step consists of image orientation and the last step is shape reconstruction. We assume that the camera matrices as well as a sparse set of 3D points are available and we strive for obtaining a dense and reliable 3D point cloud. Three novel ideas are presented: (1) for sparse tracking and triangulation, the search space for correspondences is reduced to a line segment by means of known camera matrices and disparity ranges are provided by triangular meshes from the already available points; (2) triangular meshes from extended sets of points are used for dense matching, because these meshes help to reconstruct points in weakly textured areas and present a natural way to obtain subpixel accuracy; (3) two non-local optimization methods, namely, 1D dynamic programming along horizontal lines and semi-global optimization were employed for refinement of local results obtained from an arbitrary number of images. All methods were extensively tested on a benchmark data set and an infrared video sequence. Both visual and quantitative results demonstrate the effectiveness of our algorithm.