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

Research and Development of Virtual Instruments System Based on Depth Camera

Research and Development of Virtual Instruments System Based...

The Third International Conference of Pioneering Computer Scientists, Engineers and Educators,ICPCSEE 2017(originally ICYCSEE)

作者： Xiao-li Xu Ming-hui Sun Xin-yue Sun Wei-yu Zhao Xiaoying Sun College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University College of Communication Engineering Jilin University

This paper takes advantage of the depth camera of somatosensory kinect and sensors to implement gesture recognition and design a virtual instrument system. As long as the user waves his arm without the help of other equipments, our system can automatically recognize the hand gesture and make suitable sound. In order to achieve depth camera's detection of hands movement, this paper introduce the depth imaging technology Light Coding and bone tracking technology to obtain the actual position information and hand movement information of the human body. Feet movement detection uses sensor technology, different stampede strength outputs different digital number after AD conversion so that the intensity can be controlled. A series of experiments show that the system has good fluency and practicality and increased the fun of playing instruments.

关键词： Virtual instrument Kinect Sensors Depth data processing Bone tracking

来源：评论

学校读者我要写书评

暂无评论

Geometric constraint solving using PACAO

引用

Journal of computational Information Systems 2007年第2期3卷 423-428页

作者： Yuan, Hua Li, Wenhui Yi, Rongqin Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China School of Computer Science and Engineering Changchun University of Technology Changchun 130012 China

Previous methods of volume rendering are very slow and thus impractical. We present volume rendering based on marching cubes iso-surfacing and transfer function. For an iso-surface, we divide the voxels into logical cubes according to a predefined threshold value, the tangent planes and normal vectors at each voxel are calculated and the normal vectors are orientated to the outside of surface based on wide first searching (WFS), and the 3D surface model is then obtained using marching cubes. Transfer function is used to specify the optical properties for volume rendering technology. We employ a 2D function. The end-user interacts with a set of direct manipulation widgets (triangles and rectangles). Each widget precisely corresponds to a different material and widgets are blended automatically to compute an overall transfer function. Compared to traditional techniques, the overall specification process takes a fraction of the time.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

A hybrid optimization algorithm for the multi-chromosomal reversal median problem

A hybrid optimization algorithm for the multi-chromosomal re...

引用

1st International Conference on engineering and Technology Innovation, ICETI 2011

作者： Zhang, Yi Zhang, Meng Department of Computer Science Jilin Business and Technology College Changchun 130062 China Military Simulation Technology Institute Air Force Aviation University Changchun130022 China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China

ISBN: (纸本)9783037853245

In this paper, we introduce a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the multi-chromosomal reversal median problem. We convert the large-scale genome into TSP maps at first. Then we use a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the problem. In our improved algorithm, we increase the search speed by implement multi-branch parallel search of ACO. Our extensive experiments on simulated datasets show that this median solver is efficient.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A populations evolution study using the genotype frequency data of single nucleotide polymorphism from Y-chromosome

A populations evolution study using the genotype frequency d...

引用

2007 1st International Conference on Bioinformatics and Biomedical engineering, ICBBE

作者： Pei, Zhili Kong, Ying Shi, Xiaohu Lian, Zhichao Tang, Xuning Liu, Lisha Cao, Zhongbo Liang, Yanchun Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Chang'chun 130012 China College of Mathematics and Computer Science Inner Mongolia University for Nationalities Tong'liao 028043 China Department of Biochemistry and Molecular Biology Institution of Glycobiology Dalian Medical University Da'lian 116027 China

ISBN: (纸本)1424411203

This paper proposes a novel way for the population evolution research. In the paper, it constructs the phylogenies tree of four populations using the single nucleotide polymorphism (SNP) genotype frequency of human's Y-chromosome provided by the international Hapmap project firstly, then a mathematical model is proposed to calculate the distance of any two races for all SNP genotype frequency. The simulation results suggest that the theory of constructing phylogenetic tree by analyzing SNP genotype frequency is effective. The accuracy of the adopted processing method is also shown by the simulation results. About the origination of modern human being, the result of this study can support the 'out of Africa' hypothesis, and this result is same as most evidences of paleontology. © 2007 IEEE.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

A Stable Stochastic Optimization Algorithm for Triangulation of Bayesian Networks

A Stable Stochastic Optimization Algorithm for Triangulation...

引用

International Workshop on knowledge Discovery and Data Mining (WKDD)

作者： Xuchu Dong Dantong Ouyang Yuxin Ye Shasha Feng Haihong Yu Department of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun Jilin China

ISBN: (纸本)9781424453979

In this paper, we present a novel deterministic heuristic and a new genetic algorithm to solve the problem of optimal triangulation of Bayesian networks. The heuristic, named MinFillWeight, aims to select variables minimizing the multiplication of the weights on nodes of fill-in edges. The genetic algorithm, named GA-MFW, uses a new rank-reserving crossover operator and a 2-fold mutation mechanism utilizing the MinFillWeight heuristic. Experiments on representative benchmark show that the deterministic heuristic and the stochastic algorithm have good performance and stability to various problems.

关键词： Stochastic processes Bayesian methods Tree graphs Ethics Genetic algorithms Inference algorithms Genetic mutations Stability Ant colony optimization Data mining

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Judge System for Old Man Fall Down

Design and Implementation of Judge System for Old Man Fall D...

引用

2017 International Conference on Mechanical,Electronic,Control and Automation engineering(MECAE 2017)

作者： Chao Sun Jindong Zhang Jiajia Lin Rui Song Xuan Zang Xiaohan Liu College of Software Jilin University College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University

ISBN: (纸本)9781510838451

This paper taking into account the universal use of Android phones, designs and implements judgments and notices the old man falling cell phone App. By calling the phones accelerometer, gyroscope collection campaigns after processing according to human body dynamics model to determine the specific state of the elderly, and get the specific latitude and longitude via GPS;Cell phone judge after the old man falls can send text messages to bound phone number in advance and inform the GPS to obtain location coordinates, after the fall in the elderly will be able to make the necessary relief in a timely manner.

关键词： APP Fall down Dynamic models GPS

来源：评论

学校读者我要写书评

暂无评论

Detection of Glue Spray on Bottom of Vehicle Based on Machine Vision

Detection of Glue Spray on Bottom of Vehicle Based on Machin...

引用

2018 International Conference on Network, Communication, Computer engineering (NCCE 2018)

作者： Dongyang Liu Jindong Zhang Xiaofeng Zhang Xiaoyu Ma Yuxin Kou College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University College of Software Jilin University

ISBN: (纸本)9781510871076

With the continuous development of machine vision,intelligent detection of bottom spray glue has gradually become a *** this paper,we proposed an algorithm of detection the glue spray on bottom of vehicle based on machine *** sampling and detecting the spray interest area,the algorithm can obtain its features which were used for intelligent identification of the spray interest area,and then carry out the pseudo target and detect whether the detection area is complete or *** can test the vehicles on pipeline in real *** the average,each frame's processing time is less than 150 *** there is an unqualified area,it will alarm and inform the operators of the wrong *** algorithm can improve the quality of the vehicle and save human resources and identify the spray interest area with high *** research directions in the future is to accelerate the speed to meet the practical application requirements,and to solve the intelligent identification of the spray interest area which has the same color with the vehicle body.

关键词： Glue spray Machine vision intelligent detection

来源：评论

学校读者我要写书评

暂无评论

RiWalk: Fast Structural Node Embedding via Role Identification

RiWalk: Fast Structural Node Embedding via Role Identificati...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Xuewei Ma Geng Qin Zhiyang Qiu Mingxin Zheng Zhe Wang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

Nodes performing different functions in a network have different roles, and these roles can be gleaned from the structure of the network. Learning latent representations for the roles of nodes helps to understand the network and to transfer knowledge across networks. However, most existing structural embedding approaches suffer from high computation and space cost or rely on heuristic feature engineering. Here we propose RiWalk, a flexible paradigm for learning structural node representations as it decouples the structural embedding problem into a role identification procedure and a network embedding procedure. Through role identification, rooted kernels with structural dependencies kept are built to better integrate network embedding methods. To demonstrate the effectiveness of RiWalk, we develop two different role identification methods named RiWalk-SP and RiWalk-WL respectively and employ random walk based network embedding methods. Experiments on within-network classification tasks show that our proposed algorithms achieve comparable performance with other baselines while being an order of magnitude more efficient. Besides, we also conduct across-network role classification tasks. The results show potential of structural embeddings in transfer learning. RiWalk is also scalable, making it capable of capturing structural roles in massive networks.

关键词： Kernel Task analysis knowledge engineering Machine learning Bridges Proteins Network topology

来源：评论

学校读者我要写书评

暂无评论

Optimization strategy of top-down join enumeration on modern multi-core CPUs

引用

Journal of Computers 2011年第10期6卷 2004-2012页

作者： Zuo, Wanli Chen, Yongheng He, Fenglin Chen, Kerui Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China

Most contemporary database systems query optimizers exploit System-R's bottom-up dynamic programming method (DP) to find the optimal query execution plan (QEP) without evaluating redundant subplans. The distinguished exceptions are Volcano/Cascades using transforms to generate new plans according to a topdown approach. As recent research has revealed, bottom-up dynamic programming can improve performance with respect to the shape of the join graph and parallelism. However top-down join enumeration dynamic programming method can derive upper bounds for the costs of the plans it generates which is not available to typical bottom-up DP method. In this paper, we propose a comprehensive and practical framework for parallelizing top-down dynamic programming query optimization with complex non-inner join in the multi-core processor architecture, referred as PTDhyp. We have implemented such a search strategy and experimental results show that can improve optimization time effective compared to known existing algorithms. © 2011 ACADEMY PUBLISHER.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Image annotation refinement using dynamic weighted voting based on mutual information

Journal of Software

引用

Journal of Software 2011年第11 SPEC. ISSUE期6卷 2239-2246页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

Automatic image annotation is a promising solution to narrow the semantic gap between low-level content and high-level semantic concept, which has been an active research area in the fields of image retrieval, pattern recognition, and machine learning. However, even the most dedicated annotation algorithms are often unsatisfactory. Image annotation refinement has attracted much more attention recently. In this paper, a novel refinement algorithm using dynamic voting based on mutual information is proposed. Unlike the traditional refinement algorithm, the proposed algorithm adopts dynamic weighted voting to measure the dependence between the candidate annotations, which not only permits that the annotations with higher probabilities deny the annotations with lower probabilities, but also permits that the annotations with lower probabilities deny the annotations with higher probabilities. The proposed refinement algorithm adopts progressive method instead of iterative, which can significantly decrease the time cost of refining annotations. In order to further improve efficiency without sacrificing precision, we propose the block-based normalized cut algorithm to segment image. Experiments conducted on standard Washington Ground Truth Image Database demonstrate the effectiveness and efficiency of our proposed approach for refining image annotations. © 2011 ACADEMY PUBLISHER.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：