检索结果-内蒙古大学图书馆

Angle historgam model of directional relationship in 3D based on Double-projection and Rounded-subdivision

Journal of Information and Computational Science 2014年第18期11卷 6471-6478页

作者： Kong, Dehan Liu, Yongshan Ma, Junlei Department of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China Data Industry Research Lab Qinhuangdao China

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.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Point cloud coarse registration based on 3DSIFT keypoint detection

引用

Journal of Computational Information systems 2014年第23期10卷 10121-10128页

作者： Gu, Xiaoying Liu, Yongshan Department of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Yanshan University Qinhuangdao China Data Industry Research Lab Qinhuangdao China

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.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

An efficient Subspace Clustering Algorithm based on Attribute Relativity and DBSCAN

引用

ICIC Express Letters 2014年第6期8卷 1677-1682页

作者： Zeng, Qiang Bai, Yunyue He, Haitao Ren, Jiadong College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

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 Clustering Algorithm based on Attribute Relativity and DBSCAN. Active attribute is defined to reduce the dimension of data, and a subspace search tree which is constructed by attribute correlation matrix is defined to generate subspaces. Firstly, this method uses DBSCAN with the technique of weighted threshold to cluster on every active attribution. Secondly, the correlation matrix is constructed by computing the covariance of attributes. And the subspace search tree is constructed by the matrix which is used to measure the relativity of attributions. The set of nodes in each root branch of the tree is the interesting subspaces that the algorithm discovers. Finally, the subspace clusters are obtained through merging every cluster of active dimension with the usage of similarity of cluster. Evaluation with synthetic and real-world datasets demonstrates that AReSUBCLU has a good clustering quality, and capability of discovering subspace clusters of arbitrary shapes. © 2014 ISSN 1881-803X.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on a denoising smoothing algorithm for 3D scattered point cloud

引用

ICIC Express Letters 2014年第9期8卷 2403-2409页

作者： Gu, Xiaoying Liu, Yongshan Wu, Qiong Department of Information Science and Engineering China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China Data Industry Research Lab Qinhuangdao 066004 China

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 is accomplished by rejecting outliers, correcting the normal direction and moving noise points along the modified normal direction within local adaptive neighborhoods. First, the outliers are removed by the method of mathematical statistics, on this basis, estimating normal direction and curvature of point cloud by covariance analysis method. Then, correct the normal direction by combining trilateral filter weighting factor with adaptive optimal neighborhood function. Finally, calculate position offset of data points in the direction of normal amendment by trilateral filter weighting factor in order to smooth the point cloud. Experimental results show that the proposed method is simple and effective, successfully removing noise from point cloud while preserving inherent geometric features. © 2014 ISSN 1881-803X.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of foam and sprays based on the Weber number

引用

Journal of Computational Information systems 2014年第7期10卷 2829-2836页

作者： Zhang, Lihui Zhang, Chao Li, Ying Lv, Mengya Tang, Yong The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province The College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Department of Information Engineering Environmental Management College of China Qinhuangdao 066004 China

In this paper, we propose a method based on the Weber number to uniformly model and simulate the foam and sprays generated by the fluid motion. We use the SPH to construct the fluid and calculate the Weber number of each particle. The fluid particles are divided into foam particles, transition particles and water particles by comparing their Weber number with a given critical value. These particles are rendered independently. For the solid-liquid interaction in fluid, we use SPH particles to mark the solid shape, and correct the changed solid particle position using a rotating equation. Finally, a more precise fluid surface illumination model is proposed, and the Fresnel reflection coefficient of this model can be gotten by the Snell law. Experiment results show that our method achieve real-time performance and the visual effect is desirable. © 2014 Binary Information Press.

关键词： Hydrodynamics

来源：评论

学校读者我要写书评

暂无评论

Collosion detection research based on capsule bounding volume

引用

Journal of Computational Information systems 2014年第7期10卷 2743-2750页

作者： Kong, Dehan Liu, Yongshan Cui, Na Department of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China The Data Industry Research Lab. Qinhuangdao 066004 China

A collision detection algorithm based on capsule bounding volume (CBV for short) is presented improve the efficiency of Collision detection in three-dimensional scene. This algorithm use CBV to encircle roles and achieve collision detection between the virtual characters and static objects and dynamic objects in the scene. It includes collision detection between CBV and AABB, triangular and capsule. Theoretical analysis and experimental results show that this algorithm can improve real time for collision detection. © 2014 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Fast Smallest Lowest Common Ancestor Computation Based on Stable Match

引用

Journal of computer Science & technology 2013年第2期28卷 366-381页

作者：周军锋蓝国翔陈子阳汤显 School of Information Science and Engineering Yanshan University Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University School of Economics and Management Yanshan University

In this paper, we focus on efficient processing of XML keyword queries based on smallest lowest common ancestor （SLCA） semantics. For a given query Q with m keywords, we propose to use stable matches as the basis for SLCA computation, where each stable match M consists of m nodes that belong to the m distinct keyword inverted lists of Q. M satisfies that no other lowest common ancestor （LCA） node of Q can be found to be located after the first node of M and be a descendant of the LCA of M, based on which the operation of locating a stable match can skip more useless nodes. We propose two stable match based algorithms for SLCA computation, i.e., BSLCA and HSLCA. BSLCA processes two keyword inverted lists each time from the shortest to the longest, while HSLCA processes all keyword inverted lists in a holistic way to avoid the problem of redundant computation invoked by BSLCA. Our extensive experimental results verify the performance advantages of our methods according to various evaluation metrics.

关键词： XML keyword search smallest lowest common ancestor

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for detecting community structure based on node similarity

引用

Journal of Computational Information systems 2014年第9期10卷 3805-3813页

作者： Guo, Jingfeng Wei, Aiying Lv, Jiaguo Liu, Zhen College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China College of Information Science and Engineering Zaozhuang University Zaozhuang 277100 China

Detecting community structure based on node similarity cost lower time complexity, but they ignore the indirect relationships of nodes. We proposed an improved algorithm for detecting community structure based on node similarity (AINS). The algorithm presents a neighbor subgraph model based on akincore node pair, considering the direct and indirect relations between nodes. It introduced node indirect similarity to solve the problem which only pay attention to direct relationships, ensuring that the results meet the common definition of community structure (the number of edges between community is greater than that within community). The experimental results show that the AINS algorithm can obtain better community classification result effectively. © 2014 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Adaptive multilevel meshes for cloth simulation

引用

Journal of Information and Computational Science 2014年第11期11卷 3865-3872页

作者： Zhao, Jing Pei, Shanshan Lv, Mengya Li, Ying Tang, Yong Yang, Meiling Zhang, Mingmin Pan, Zhigeng The College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao China The College of Computer Science and Technology Zhejiang University Hangzhou China Institute of Service Engineering Hangzhou Normal University Hangzhou China

A novel method based on multilevel meshes is proposed to simulate the cloth draping process rapidly on a complex model. Considering of the difficulty of computing the realtime collision between cloth and complex models by normally methods, the draping process of cloth is divided into several phases and at each phase the mesh size is smaller than its previous one. The optimized 1-to-4 split is used to drive the rapid changes in the grid hierarchy and to simplify the calculations. We choose the widely used ellipsoid as the bounding cell to enclose the complex models in the environment. The ellipsoid avoids the complex structure of hierarchical bounding box and eliminates the impossible collision model area rapidly. Experiments demonstrate that this method can accelerate the draping process of cloth and decrease the number of iterations and the calculation of collision detection. Further mesh refinement improves the reality of cloth when it reaches the final position and ensures the realism of the simulation in real time. ©2014 Binary Information Press

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

A load balancing algorithm for multi-root ONS

引用

Journal of Computational Information systems 2014年第7期10卷 2735-2742页

作者： Hao, Fengzhai Liu, Yongshan Chen, Wei College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China Data Industry Research Lab. Qinhuangdao 066004 China

In order to solve the overload problem of root ONS in the EPC network, a load balancing algorithm based on multi-root ONS is proposed. Based on the proposed load balancing ONS (LB ONS) architecture, the ONS Root is defined to have two states, idle or busy. According to CPU utilization and memory utilization of the ONS Root and in combination with threshold controlling to periodically update the ONS Root states, which makes the requests coming from client applications be transferred to an ONS Root which is idle. Experiment results show that the algorithm can reduce query hops and query delays effectively and offer lookup service efficiently. © 2014 Binary Information Press.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：