海洋标量数据多维多模式动态可视化系统设计实现

本文设计了基于地球直角坐标系和三维UTM坐标系的多维可视化系统。实现了两种坐标系的映射,并基于两种坐标系实现了海洋标量数据场的点过程、线过程、面过程同步可视化分析;通过内存映射技术实现了海量海洋标量数据的多维动态可视化。实验表明,系统能直观地表达海洋标量数据场在空间上的分布及在时间序列上的变化,可承载较大的数据量,满足实时性与交互性要求。     

结构光视觉三维点云逐层三角网格化算法

针对结构光视觉恢复的大规模三维点云的可投影特点,提出一种基于投影网格的底边驱动逐层网格化曲面重建算法。该算法首先将点云投影到一个二维平面上;然后基于点云投影区域建立规则投影网格,并将投影点映射到规则二维投影网格上,建立二维网格点与三维点云间的映射关系;接着对投影网格进行底边驱动的逐层网格化,建立二维三角网格;最后根据二维投影点与三维点的对应关系及二维三角网格拓扑关系获得最终的三维网格曲面。实验结果表明,算法曲面重建速度快,可较好地保持曲面细节特征。     

基于区块特征融合的点云语义分割方法

为降低室外大规模点云场景中多类三维目标语义分割的计算复杂度,提出一种融合区块特征的语义分割方法。采用方形网格分割方法对三维点云进行区块划分、采样以及组合,求取简化的点云组合区块集,将其输入至区块特征提取和融合网络中从而获得每个区块的特征修正向量。设计点云区块全局特征修正网络,以残差的方式融合特征修正向量与原始点云全局特征,修正因分割造成的错误特征。在此基础上,将方形网格分割尺寸作为神经网络的参数引入反向传播过程中进行优化,从而建立高效的点云语义分割网络。实验结果表明,反向传播算法可以优化分割尺寸至最佳值附近,所提网络中的全局特征修正方法能够提高语义分割精度,该方法在Semantic3D数据集上的语义分割精度达到78.7%,较RandLA-Net方法提升1.3%,且在保证分割精度的前提下其点云预处理计算复杂度和网络计算时间明显降低,在处理点数为10万~100万的大规模点云时,点云语义分割速度较SPG、KPConv等方法提升2~4倍。     

Probabilistic voxel mapping using an adaptive confidence measure of stereo matching

In this paper, we describe a probabilistic voxel mapping algorithm using an adaptive confidence measure of stereo matching. Most of the 3D mapping algorithms based on stereo matching usually generate a map formed by point cloud. There are many reconstruction errors. The reconstruction errors are due to stereo reconstruction error factors such as calibration errors, stereo matching errors, and triangulation errors. A point cloud map with reconstruction errors cannot accurately represent structures of environments and needs large memory capacity. To solve these problems, we focused on the confidence of stereo matching and probabilistic representation. For evaluation of stereo matching, we propose an adaptive confidence measure that is suitable for outdoor environments. The confidence of stereo matching can be reflected in the probability of restoring structures. For probabilistic representation, we propose a probabilistic voxel mapping algorithm. The proposed probabilistic voxel map is a more reliable representation of environments than the commonly used voxel map that just contains the occupancy information. We test the proposed confidence measure and probabilistic voxel mapping algorithm in outdoor environments.     

基于结构化粒子模型的云可视化应用

云数据的三维可视化模拟一直是计算机图形学和气象科学领域的研究热点。提出了基于WRF模式数据的建模与渲染技术,以实现真实云数据三维可视化模拟。针对粒子系统建模复杂、实时性差的问题,首先通过计算云粒子之间的相互关系建立结构化粒子模型,实现WRF云数据的建模;然后利用光照模型和公告牌技术对建模粒子进行光照渲染和三维模拟,同时结合Imposter技术提高纹理绘制速度和效果。实验仿真结果验证了该方法在提高云数据的建模与渲染速度,提高云三维可视化的逼真度方面的有效性。     

Gaussian processes autonomous mapping and exploration for range-sensing mobile robots

Most of the existing robotic exploration schemes use occupancy grid representations and geometric targets known as frontiers. The occupancy grid representation relies on the assumption of independence between grid cells and ignores structural correlations present in the environment. We develop a Gaussian processes (GPs) occupancy mapping technique that is computationally tractable for online map building due to its incremental formulation and provides a continuous model of uncertainty over the map spatial coordinates. The standard way to represent geometric frontiers extracted from occupancy maps is to assign binary values to each grid cell. We extend this notion to novel probabilistic frontier maps computed efficiently using the gradient of the GP occupancy map. We also propose a mutual information-based greedy exploration technique built on that representation that takes into account all possible future observations. A major advantage of high-dimensional map inference is the fact that such techniques require fewer observations, leading to a faster map entropy reduction during exploration for map building scenarios. Evaluations using the publicly available datasets show the effectiveness of the proposed framework for robotic mapping and exploration tasks.     

基于GPU并行的点云数据简化的改进算法

受环境因素影响,卤水下矿床表面地势平缓,采集的矿床点云冗余点较多,为了提高对矿床进行三维建模的效率,设计了一种基于GPU并行的点云简化的改进算法。对每个小栅格内的点进行最小二乘的平面拟合,根据各个点到拟合平面的距离精简了大部分冗余点,并通过剩余点的曲率进行了第二次精简。将整个处理过程限定在每个小栅格内,在降低计算量的同时避免了因过度简化而出现的空洞现象。另外,对点云的简化过程进行了基于GPU的多线程并行处理,极大地提高了整个处理过程的效率。实验表明,算法改进后达到原算法效果的同时提高了算法效率,利用GPU加速后,大大缩短了算法的执行时间。     

Alignment of continuous video onto 3D point clouds

We propose a general framework for aligning continuous (oblique) video onto 3D sensor data. We align a point cloud computed from the video onto the point cloud directly obtained from a 3D sensor. This is in contrast to existing techniques where the 2D images are aligned to a 3D model derived from the 3D sensor data. Using point clouds enables the alignment for scenes full of objects that are difficult to model; for example, trees. To compute 3D point clouds from video, motion stereo is used along with a state-of-the-art algorithm for camera pose estimation. Our experiments with real data demonstrate the advantages of the proposed registration algorithm for texturing models in large-scale semi-urban environments. The capability to align video before a 3D model is built from the 3D sensor data offers new practical opportunities for 3D modeling. We introduce a novel modeling-through-registration approach that fuses 3D information from both the 3D sensor and the video. Initial experiments with real data illustrate the potential of the proposed approach.     

3D点云形状特征的二维主流形描述

首先,对空间分布不均匀且无序的三维点云构造其二维主流形,并以与球面同胚的封闭曲面网格形式给出其二维主流形的二次优化逼近,以主流形网格有序均匀的结点分布表示三维点云空间分布无序且不均匀的形状特征,降低了三维形状描述的难度;然后,以基本几何变换作为快速粗对齐、以迭代最近法向点(ICNP)方法作为精准对齐,确定两个主曲面网格之间最佳刚性变换,ICNP方法在寻找最近点时考虑法向夹角,利用了更多的几何信息,实现快速精准的刚性对齐,兼顾计算精度和速度;最后,以对齐误差作为两个3D点云之间形状差异测度.实验结果表明:所提出的基于主流形二次曲面网格优化逼近的三维点云模型形状描述方法对三维点云的分辨率和噪声等干扰因素具有较高的健壮性,可以用于三维检索的形状描述.     

可变半径Alpha Shapes提取机载LiDAR点云建筑物轮廓

目的 机载激光雷达（light detection and ranging,LiDAR）能够快速获取建筑物表面的3维点云,为提取建筑物轮廓提供重要的数据支撑,但由于激光脚点的随机性和点云自身的离散性,常规固定半径Alpha Shapes（A-Shapes）算法难以兼顾轮廓提取的精细度和完整度,且在点数量较大情况下计算效率较低。因此,提出一种基于网格的可变半径Alpha Shapes方法用于提取机载LiDAR点云建筑物轮廓。方法 对3维点云进行投影降维,对投影后2维离散点的范围构建规则格网,接着根据网格内点云填充情况筛选出边界网格,计算边界网格的平滑度并加权不同的滚动圆半径,再以边界网格为中心生成3×3邻域网格检测窗口,利用滚动圆原理提取窗口内点集的边界点,迭代检测直到所有边界网格遍历完成,最后获取点云的完整轮廓。结果 在精度评价实验中,与固定半径A-Shapes方法和可变半径Alpha Shapes（variable radius Alpha Shapes,VA-Shapes）方法相比,若建筑物以直线特征为主且边缘点云参差不齐,则本文方法的提取效果不理想;若建筑物含有较多拐角特征,则本文方法的提取效果较好。在效率评价实验中,与A-Shapes方法、VA-Shapse方法以及包裹圆方法相比,若点云数据量较小,则4种方法的耗时差距不大;若数据量较大,则本文方法和包裹圆方法的耗时远小于固定半径A-Shapes方法。实验结果表明,本文提出的轮廓提取方法适用于多种形状的建筑物点云。从轮廓完整性、几何精度以及计算效率等几方面综合考虑,本文方法提取建筑物点云轮廓效果较好。结论 本文提出的基于网格的可变半径Alpha Shapes建筑物点云轮廓提取方法结合了网格划分和滚动圆检测的优点,能够有效提取机载LiDAR建筑物点云顶部轮廓,具有较高的提取效率和良好的鲁棒性,提取的轮廓精度较高。     

3D shape acquisition and integral compact representation using optical scanning and enhanced shape parameterization

An efficient computational methodology for shape acquisition, processing and representation is developed. It includes 3D computer vision by applying triangulation and stereo-photogrammetry for high-accuracy 3D shape acquisition. Resulting huge 3D point clouds are successively parameterized into mathematical surfaces to provide for compact data-set representation, yet capturing local details sufficiently. B-spline surfaces are employed as parametric entities in fitting to point clouds resulting from optical 3D scanning. Beyond the linear best-fitting algorithm with control points as fitting variables, an enhanced non-linear procedure is developed. The set of best fitting variables in minimizing the approximation error norm between the parametric surface and the 3D cloud includes the control points coordinates. However, they are augmented by the set of position parameter values which identify the respectively closest matching points on the surface for the points in the cloud. The developed algorithm is demonstrated to be efficient on demanding test cases which encompass sharp edges and slope discontinuities originating from physical damage of the 3D objects or shape complexity.     

OctoMap: an efficient probabilistic 3D mapping framework based on octrees

Three-dimensional models provide a volumetric representation of space which is important for a variety of robotic applications including flying robots and robots that are equipped with manipulators. In this paper, we present an open-source framework to generate volumetric 3D environment models. Our mapping approach is based on octrees and uses probabilistic occupancy estimation. It explicitly represents not only occupied space, but also free and unknown areas. Furthermore, we propose an octree map compression method that keeps the 3D models compact. Our framework is available as an open-source C++ library and has already been successfully applied in several robotics projects. We present a series of experimental results carried out with real robots and on publicly available real-world datasets. The results demonstrate that our approach is able to update the representation efficiently and models the data consistently while keeping the memory requirement at a minimum.     

3D scattered data interpolation and approximation with multilevel compactly supported RBFs

In this paper, we propose a hierarchical approach to 3D scattered data interpolation and approximation with compactly supported radial basis functions. Our numerical experiments suggest that the approach integrates the best aspects of scattered data fitting with locally and globally supported basis functions. Employing locally supported functions leads to an efficient computational procedure, while a coarse-to-fine hierarchy makes our method insensitive to the density of scattered data and allows us to restore large parts of missed data. Given a point cloud distributed over a surface, we first use spatial down sampling to construct a coarse-to-fine hierarchy of point sets. Then we interpolate (approximate) the sets starting from the coarsest level. We interpolate (approximate) a point set of the hierarchy, as an offsetting of the interpolating function computed at the previous level. The resulting fitting procedure is fast, memory efficient, and easy to implement.     

自动驾驶汽车虚拟测试中的树木点云生成方法

自动驾驶汽车虚拟测试已成为自动驾驶或车路协同测试评价的一个重要手段,三维激光雷达数据模拟生成是自动驾驶汽车虚拟测试中的重要任务之一,目前多采用基于飞行时间原理的几何模型方法生成激光雷达三维点云数据,该方法生成点云实时性较差。布告牌是虚拟场景中常采用的树木建模方法,由于布告牌仅由两个矩形面片即八个三角形面片组成,直接采用布告牌方法生成的三维点云数据难以反映树木的真实空间信息。针对上述问题,提出了一种基于布告牌空间变换的快速树木三维点云生成方法。以布告牌的纹理图像为依据,根据纹理透明度获取树木二维平面点云分布,经二维树木点云的轮廓提取,结合树木结构的先验知识进行旋转、随机偏移和尺度变换,以更少的三角形面片数和更小的计算代价获得树木的三维点云数据。提出了一种空间直方图三维点云相似度评价方法,将三维点云空间量化为若干个子空间,获得三维点云的投影空间直方图,采用巴氏系数计算投影空间直方图相似度,以投影空间直方图加权相似度作为点云相似度评价值。实验结果表明,基于布告牌空间变换方法和几何模型方法生成的云杉等三种树木的三维点云数据的平均相似度在90%以上,且该方法生成树木点云的时间仅是几何模型法的1%,因此布告牌空间变换树木三维点云生成方法快速且准确,可以满足自动驾驶汽车虚拟测试的性能要求。     

Using occupancy grids for mobile robot perception and navigation

An approach to robot perception and world modeling that uses a probabilistic tesselated representation of spatial information called the occupancy grid is reviewed. The occupancy grid is a multidimensional random field that maintains stochastic estimates of the occupancy state of the cells in a spatial lattice. To construct a sensor-derived map of the robot's world, the cell state estimates are obtained by interpreting the incoming range readings using probabilistic sensor models. Bayesian estimation procedures allow the incremental updating of the occupancy grid, using readings taken from several sensors over multiple points of view. The use of occupancy grids from mapping and for navigation is examined. Operations on occupancy grids and extensions of the occupancy grid framework are briefly considered     

实时形状匹配变形体动画

给出了一个仿真变形体的方法。物体被几何方法推动变形,操纵基于点的物体并且不需要连接信息,这是一个不需要任何预处理,计算简单,并提供无条件稳定的动态仿真方法。主要思想是通过几何约束替换能量和通过当前位置到目标位置的距离替换力。这些目标位置通过一个通用的无变形的静止状态和点云的当前变形状态之间的形状匹配来决定,因为点总是在定义好的位置被绘制,显式积分方法的过度不稳定问题被消除。相关物体表现方法的灵活性能被控制,相关内存和计算是有效的,动态仿真上的无条件稳定性让这个方法特别适合游戏开发。     

Image super resolution using distributed locality sensitive hashing for manifold learning

In this paper we propose a distributed locality sensitive hashing based framework for image super resolution exploiting computational and storage efficiency of cloud. Now days huge multimedia data is available on the cloud which can be utilized using store anywhere and excess anywhere model. It may be noted that super resolution is required for consumer electronics display devices due to various reasons. The propose framework exploits the image correlation for image super resolution using locality sensitive hashing (LSH) for manifold learning. In our work we have exploited the benefits of manifold learning for image super resolution, which in-turn is a highly time complex operation. The time complexity is involved due to finding the approximate nearest neighbors from trillion of image patches for locally linear embedding (LLE) operation. In our approach it is mitigated by using a distributed framework which internally uses hash tables for mapping of patches in the target image from a database of internet picture collection. The proposed framework for super resolution provides promising results in comparison to existing approaches.

     

结构化环境下基于结构单元软编码的3维激光雷达点云描述子

在同时定位与地图构建（SLAM）系统中,基于3维激光雷达点云数据的闭环检测由于描述子计算困难而极具挑战．为此,本文提出一种结构化环境下可用于闭环检测的基于结构单元软编码的新型3维激光雷达点云描述子．针对3维激光雷达点云的稀疏性和独立性导致的3维空间线段提取困难的问题,首先通过几何滤波的方法提取3维空间中垂直于地面的线段,用于保留3维空间的结构信息;然后,基于线段的空间几何关系构建结构单元集合,并通过软编码技术计算特征向量,作为3维激光雷达点云的描述子;最后,通过两帧点云描述子的匹配实现闭环检测．在KITTI公开数据集和自采数据集上的对比实验,验证了本文方法在时效性和鲁棒性等方面均优于主流的3维激光闭环检测方法．