Based on a new feature that macro network structure and micro game have mutual inuence on the formation of the community, to mining communities in signed network, a novel algorithm SNCGHC is proposed. Firstly, accordi...
详细信息
Identifying influential nodes is an important issue in understanding the process of information diffusion in complex software networks. Researchers generally define functions as nodes, and relationship of function cal...
详细信息
Software’s control flow graph can be treated as a complex software network, and a tiny fraction of key function nodes has considerable influence on the stability, reliability and robustness of the network. Identifyin...
详细信息
There are two critical questions in the Wu-Huberman algorithm: one is picking two poles and the other is setting the threshold. By further studying the two questions, we present a method that makes the discovery of co...
详细信息
The formal model of spatial directional relations is one of the most important parts in spatial relation research. The most of models are based on Minimum Bounding Rectangle (MBR), and they are not compliant with the ...
详细信息
The formal model of spatial directional relations is one of the most important parts in spatial relation research. The most of models are based on Minimum Bounding Rectangle (MBR), and they are not compliant with the regular pattern of human cognition. In order to get a closer conclusion to human cognition on directional relationship, Angle Histogram model based on Double-projection and Rounded-subdivision (AHDPRS) is proposed in this paper. The model uses the maximum inscribed circles to find out the maximum parts of the object, and calculates the directional relationship between the centers of the circles. This model ignores the inessential details to ensure the result which will be closer to human cognition. The experiments show that this model is feasible.
In the grid environment, there are a large number of grid resources scheduling algorithms. According to the existing Min-Min scheduling algorithm in uneven load, and low resource utilization rate, we put forward LoBa-...
详细信息
In the high-dimensional data traditional clustering algorithms tend to break down because of the curse of dimensionality, high cost of time, etc. This paper proposes a novel algorithm AReSUBCLU, an Effective Subspace ...
详细信息
Since the SIFT feature point extraction algorithm with scale changes, rotation transformation invariance, is widely used in image registration. In this paper, the SIFT algorithm is applied to three-dimensional point c...
详细信息
Since the SIFT feature point extraction algorithm with scale changes, rotation transformation invariance, is widely used in image registration. In this paper, the SIFT algorithm is applied to three-dimensional point cloud coarse registration, the proposed 3DSIFT extraction algorithm is suitable for three-dimensional point cloud data, then point coordinates, curvature, the nearest neighbor distance mean and other information compose fourteen-dimensional vector to conduct correspondence match, use the interior point rate of Ransac to obtain optimal transformation, and finally transform the coordinates for source point clouds using the optimal transform, complete the point cloud data coarse registration. Experimental results show that our coarse registration algorithm can effectively extract feature points, and it is robust for the point cloud with noisy point, it can provide accurate and effective initial value for the precise registration such as ICP.
In order to effectively eliminate outliers and noise points in 3D scattered point cloud, a denoising smoothing algorithm which is the combination of removing outliers algorithm and trilateral filter is proposed. This ...
详细信息
Knowledge Graphs have been practical tools to represent and integrate plentiful structural and semantic information in mainstream industrial scenarios. While promising, the heterogeneity and complexity of KGs pose a f...
详细信息
暂无评论