The existing registration algorithms suffer from low precision and slow speed when registering a large amount of point cloud data. In this paper, we propose a point cloud registration algorithm based on feature extraction and matching; the algorithm helps alleviate problems of precision and speed. In the rough registration stage, the algorithm extracts feature points based on the judgment of retention points and bumps, which improves the speed of feature point extraction. In the registration process, FPFH features and Hausdorff distance are used to search for corresponding point pairs, and the RANSAC algorithm is used to eliminate incorrect point pairs, thereby improving the accuracy of the corresponding relationship. In the precise registration phase, the algorithm uses an improved normal distribution transformation (INDT) algorithm. Experimental results show that given a large amount of point cloud data, this algorithm has advantages in both time and precision.
As throughput-oriented accelerators, GPUs provide tremendous processing power by running a massive number of threads in parallel. However, exploiting high degrees of thread-level parallelism (TLP) does not always translate to the peak performance that GPUs can offer, leaving the GPU's resources often under-utilized. Compared to compute resources, memory resources can tolerate considerably lower levels of TLP due to hardware bottlenecks. Unfortunately, this tolerance is not effectively exploited by the Single Instruction Multiple Thread (SIMT) execution model employed by current GPU compute frameworks. Assuming an SIMT execution model, GPU applications tend to send bursts of memory requests that compete for GPU memory resources. Traditionally, hardware units, such as the wavefront scheduler, are used to manage such requests. However, the scheduler struggles when the number of computational operations are too low to effectively hide the long latency of memory operations. In this paper, we propose a Twin Kernel Multiple Thread (TKMT) execution model, a compiler-centric solution that improves hardware scheduling at compile time. TKMT better distributes the burst of memory requests in some of the wavefronts through static instruction scheduling. Our results show that TKMT can offer a 12% average improvement over the baseline SIMT implementation on a variety of benchmarks on AMD Radeon systems.
Wind turbine generators (WTGs) are usually equipped with mechanical sensors to measure wind speed and turbine shaft rotating speed for system monitoring, control, and protection. The use of these sensors increases the cost and hardware complexity and reduces the reliability of the WTG system. This paper proposes a novel real-time speed estimation algorithm for wind turbines equipped with doubly-fed induction generators (DFIGs). In the proposed algorithm, both the wind and turbine shaft speeds are estimated from the measured DFIG output electrical power. The estimated speeds are then used to determine the maximum power point of the DFIG wind turbine. A P-Q decoupled control strategy is developed to continuously regulate the DFIG at the maximum power point without the need of using any wind or turbine shaft speed sensors.
With the rapid development of intelligent transportation and geographic information system, spatial data query technology has attracted the attention of many scholars. Among them, the reverse farthest neighbor query from the data point to find the target point as its farthest adjacent data points, used to obtain target set of weak influence. Its research results have been widely applied to facility location, earthquake relief, marketing and other major areas. Thus, the research of reverse furthest neighbor query technology is of great significance. However, the existing methods only deal with a single query point, and do not consider how to obtain the optimal farthest neighbor position of group reverse when the number of query points changes from one to a group. In addition, considering it is difficult to avoid some geographical location restrictions in the real situation, the existing studies are limited to road network or Euclidean space simplely, without taking the existence of obstacles into consideration. To this end, this paper proposed the V-OGRkFN(Voronoi-Obstacle Group Reverse k Farthest Neighbor) algorithm. Firstly, the algorithm gets the minimum cover circle of query points which are considered into a whole. Secondly, we use the framework based on the filtering and refining process of query by pruning strategy based on Voronoi diagram’s properties. Then we get the candidate set using the theorem of transformation between k nearest neighbors and k farthest neighbors. Finally, the refining algorithm is given to get the final results. VOGRkFN algorithm shows great performance of reverse k farthest neighbor query through the specific comparative experimental analysis.
With the widespread application of Geographic Information System (GIS), three-dimensional spatial data, as the reflection of the real world entity, has an increasing amount of data, and the phenomenon of uneven data distribution appears. If a single spatial index structure is used to store and manage these data, there will be a waste of storage space and low query efficiency. A hybrid index structure based on 3D multi-level adaptive grid and R+ tree was proposed to solve these problems. The index structure was mainly composed of two structures, multi-level grid and R+ tree. Firstly, the data set was processed by the multi-level automatic grid algorithm based on normal distribution, and the length, width and height of the grid were obtained. Secondly, a multi-level adaptive grid structure was used to partition the data space quickly and effectively, and the advantage of zero overlap of the intermediate nodes of the R+ tree was used for efficient indexing. Finally, the maintenance and query algorithms of the index structure were given in detail, which solved the problem of low index establishment and retrieval efficiency under the condition of uneven distribution of massive data sets. In this paper, a data set subject to Gauss distribution was used to simulate the distribution of three-dimensional data. Through a large number of experimental comparison tests, it was proved that the hybrid index structure based on 3D multi-level adaptive grid-R+ tree proposed in this paper had good performance in both index structure construction and query in the case of massive data sets or uneven data distribution.
1 January 2019 in Mathematical Problems in Engineering
The existing spatial relationship composite models have defects in both cognitive habits and differentiation degree when describing the spatial relationship between the three dimensional objects. These defects can cause inaccuracy in the process of spatial reasoning. In order to solve this problem, this paper proposes a Three‐Dimensional Improved Composite Spatial Relationship Model (3D‐ICSRM). Then a high‐precision spatial relationship reasoning algorithm is presented based on this model, which combines qualitative and quantitative analyses. Finally, both the correctness and performance advantages of spatial reasoning algorithm are verified by experiments based on this proposed model.