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

International Joint Conference on Neural Networks

作者： Nengwen Zhao Lefei Zhang Bo Du Liangpei Zhang Dacheng Tao Jane You State Key Laboratory of Software Engineering School of Computer Wuhan University Department of Computing The Hong Kong Polytechnic University State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Centre for Quantum Computation & Intelligent Systems and the Faculty of Engineering and Information Technology University of Technology

ISBN: (纸本)9781509006212

Gait recognition is a rising biometric technology which aims to distinguish people purely through the analysis of the way they walk, while the problem is that the dimensionality of the gait data is too high, so it is necessary to carry on dimensionality reduction task. Up to date, in the area of computer vision and pattern recognition, various dimensionality reduction algorithms have been employed for gait data, including the conventional vector representation based methods principal components analysis (PCA) and, locality preserving projection (LPP), and the recently proposed multi-linear subspace learning based approaches such as multilinear principal component analysis (MPCA). In this paper, inspired by the advantages of the tensor representation and manifold learning, we propose a novel sparse tensor discriminative locality alignment for human gait feature representation and dimensionality reduction algorithm, and sub-sequently apply the refined feature for gait recognition by a lazy classifier of the KNN. The proposed method adopts sparse multi-way projection based on the high-order version of discriminative locality alignment, by which the class separability is enhanced and the potential model overfitting is simultaneously avoided. Extensive experiments on the University of South Florida (USF) HumanID Gait Database show that the proposed method achieves better recognition rate compared with some existing classical dimensionality reduction algorithms.

关键词： Gait recognition dimensionality reduction images computer vision Tensor Locomotion Gait principal components analysis vector representation Alignment

来源：评论

学校读者我要写书评

暂无评论

Quantum state and process tomography via adaptive measurements

引用

Science China(Physics,Mechanics & Astronomy) 2016年第10期59卷 25-32页

作者： HengYan Wang WenQiang Zheng NengKun Yu KeRen Li DaWei Lu Tao Xin Carson Li ZhengFeng Ji David Kribs Bei Zeng XinHua Peng JiangFeng Du Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics University of Science and Technology of ChinaHefei 230026China Department of Applied Physics Zhejiang University of TechnologyHangzhou 310023China Institute for Quantum Computing University of WaterlooWaterloo N2L 3G1Canada 4Department of Mathematics&Statistics University of GuelphGuelph N1G 2W1Canada Centre for Quantum Computation&Intelligent Systems Faculty of Engineering and Information TechnologyUniversity of Technology SydneySydney NSW 2007Australia State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua UniversityBeijing 100084China Department of Physics University of GuelphGuelph N1G 2W1Canada State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China Canadian Institute for Advanced Research Toronto M5G 1Z8Canada

We investigate quantum state tomography(QST) for pure states and quantum process tomography(QPT) for unitary channels via adaptive measurements. For a quantum system with a d-dimensional Hilbert space, we first propose an adaptive protocol where only 2d. 1 measurement outcomes are used to accomplish the QST for all pure states. This idea is then extended to study QPT for unitary channels, where an adaptive unitary process tomography(AUPT) protocol of d2+d.1measurement outcomes is constructed for any unitary channel. We experimentally implement the AUPT protocol in a 2-qubit nuclear magnetic resonance system. We examine the performance of the AUPT protocol when applied to Hadamard gate, T gate(/8 phase gate), and controlled-NOT gate,respectively, as these gates form the universal gate set for quantum information processing purpose. As a comparison, standard QPT is also implemented for each gate. Our experimental results show that the AUPT protocol that reconstructing unitary channels via adaptive measurements significantly reduce the number of experiments required by standard QPT without considerable loss of fidelity.

关键词： quantum tomography state reconstruction nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

Exploiting structural similarity of log files in fault diagnosis for Web service composition

引用

CAAI Transactions on Intelligence technology 2016年第1期1卷 61-71页

作者： Xu Han Binyang Li Kam-Fai Wong Zhongzhi Shi Beijing Key Laboratory of Electronic System Reliability Technology Capital Normal University Beijing China University of International Relations Beijing China Department of Systems Engineering & Engineering Management The Chinese University of Hong Kong Hong Kong China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

With increasing deployment of Web services, the research on the dependability and availability of Web service composition becomes more and more active. Since unexpected faults of Web service composition may occur in different levels at runtime, log analysis as a typical data- driven approach for fault diagnosis is more applicable and scalable in various architectures. Considering the trend that more and more service logs are represented using XML or JSON format which has good flexibility and interoperability, fault classification problem of semi-structured logs is considered as a challenging issue in this area. However, most existing approaches focus on the log content analysis but ignore the structural information and lead to poor performance. To improve the accuracy of fault classification, we exploit structural similarity of log files and propose a similarity based Bayesian learning approach for semi-structured logs in this paper. Our solution estimates degrees of similarity among structural elements from heterogeneous log data, constructs combined Bayesian network （CBN）, uses similarity based learning algorithm to compute probabilities in CBN, and classifies test log data into most probable fault categories based on the generated CBN. Experimental results show that our approach outperforms other learning approaches on structural log datasets.

关键词： Web services composition Fault diagnosis Combined Bayesian network （CBN） Similarity Probability

来源：评论

学校读者我要写书评

暂无评论

3D Ear Shape Matching Using Joint -Entropy

引用

Journal of Computer Science & technology 2015年第3期30卷 565-577页

作者：孙晓鹏李思慧韩枫魏小鹏 Institute of Computer Systems School of Computer and Information Technology Liaoning Normal University Dalian 116029 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing 100876 China School of Mechanical and Engineering Dalian University of Technology Dalian 116024 China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Dalian 116622 China

In this article, we investigate the use of joint a-entropy for 3D ear matching by incorporating the local shape feature of 3D ears into the joint a-entropy. First, we extract a sut^cient number of key points from the 3D ear point cloud, and fit the neighborhood of each key point to a single-value quadric surface on product parameter regions. Second, we define the local shape feature vector of each key point as the sampling depth set on the parametric node of the quadric surface. Third, for every pair of gallery ear and probe ear, we construct the minimum spanning tree （MST） on their matched key points. Finally, we minimize the total edge weight of MST to estimate its joint a-entropy the smaller the entropy is, the more similar the ear pair is. We present several examples to demonstrate the advantages of our algorithm, including low time complexity, high recognition rate, and high robustness. To the best of our knowledge, it is the first time that, in computer graphics, the classical information theory of joint a-entropy is used to deal with 3D ear shape recognition.

关键词： joint a-entropy minimum spanning tree local shape feature ear matching ear recognition

来源：评论

学校读者我要写书评

暂无评论

Casict-dcu participation in wmt2015 metrics task 10

Casict-dcu participation in wmt2015 metrics task

引用

10th Workshop on Statistical Machine Translation, WMT 2015 at the 2015 Conference on Empirical Methods in Natural Language Processing, EMNLP 2015

作者： Yu, Hui Ma, Qingsong Wu, Xiaofeng Liu, Qun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Adapt Centre School of Computing Dublin City University

ISBN: (纸本)9781941643327

Human-designed sub-structures are required by most of the syntax-based machine translation evaluation metrics. In this paper, we propose a novel evaluation metric based on dependency parsing model, which does not need this human involvement. Experimental results show that the new single metric gets better correlation than METEOR on system level and is comparable with it on sentence level. To introduce more information, we combine the new metric with many other metrics. The combined metric obtains state-of-theart performance on both system level evaluation and sentence level evaluation on WMT 2014. © EMNLP 2015. All rights reserved.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Simulate Human Saccadic Scan-Paths in Target Searching

引用

International Journal of Intelligence Science 2016年第1期6卷 1-9页

作者： Lijuan Duan Jun Miao David M. W. Powers Jili Gu Laiyun Qing Beijing Key Laboratory of Trusted Computing Beijing Key Laboratory on Integration and Analysis of Large-Scale Stream Data College of Computer Science and Technology Beijing University of Technology Beijing China National Engineering Laboratory for Critical Technologies of Information Security Classified Protection Beijing China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing Technology CAS Beijing China School of Computer Science Engineering & Maths Flinders University of South Australia Adelaide South Australia Beijing Samsung Telecom R&D Center Beijing China University of Chinese Academy of Sciences Beijing China

Human saccade is a dynamic process of information pursuit. There are many methods using either global context or local context cues to model human saccadic scan-paths. In contrast to them, this paper introduces a model for gaze movement control using both global and local cues. To test the performance of this model, an experiment is done to collect human eye movement data by using an SMI iVIEW X Hi-Speed eye tracker with a sampling rate of 1250 Hz. The experiment used a two-by-four mixed design with the location of the targets and the four initial positions. We compare the saccadic scan-paths generated by the proposed model against human eye movement data on a face benchmark dataset. Experimental results demonstrate that the simulated scan-paths by the proposed model are similar to human saccades in term of the fixation order, Hausdorff distance, and prediction accuracy for both static fixation locations and dynamic scan-paths.

关键词： Saccadic Scan-Paths Eye Movement Fixation Locations Dynamic Scan-Paths

来源：评论

学校读者我要写书评

暂无评论

The process of 3D-printed skull models for the anatomy education

arXiv

引用

arXiv 2017年

作者： Shen, Zhen Yao, Yong Xie, Yi Guo, Chao Shang, Xiuqin Dong, Xisong Li, Yuqing Pan, Zhouxian Chen, Shi Pan, Hui Xiong, Gang Beijing100190 China Beijing100730 China School of Electrical & Electronic Engineering University of Manchester ManchesterM13 9PL United Kingdom Qingdao Academy of Intelligent Industries Qingdao266109 China College of Information Science and Technology Beijing University of Chemical Technology Beijing100029 China Eight-year Program of Clinical Medicine PUMCH CAMS & PUMC Beijing100730 China Department of Endocrinology Endocrine Key Laboratory of Ministry of Health PUMCH CAMS & PUMC Beijing100730 China National Virtual Simulation Laboratory Education Center of Medical Sciences PUMCH CAMS & PUMC Beijing100730 China Department of Education PUMCH CAMS & PUMC Beijing100730 China Cloud Computing Center Chinese Academy of Sciences Dongguan523808 China

Objective The 3D printed medical models can come from virtual digital resources, like CT scanning. Nevertheless, the accuracy of CT scanning technology is limited, which is 1mm. In this situation, the collected data is not exactly the same as the real structure and there might be some errors causing the print to fail. This study presents a common and practical way to process the skull data to make the structures correctly. And then we make a skull model through 3D printing technology, which is useful for medical students to understand the complex structure of skull. Materials and Methods The skull data is collected by the CT scan. To get a corrected medical model, the computer-assisted image processing goes with the combination of five 3D manipulation tools: Mimics, 3ds Max, Geomagic, Mudbox and Meshmixer, to reconstruct the digital model and repair it. Subsequently, we utilize a low-cost desktop 3D printer, Ultimaker2, with polylactide filament (PLA) material to print the model and paint it based on the atlas. Result After the restoration and repairing, we eliminate the errors and repair the model by adding the missing parts of the uploaded data within 6 hours. Then we print it and compare the model with the cadaveric skull from frontal, left, right and anterior views respectively. The printed model can show the same structures and also the details of the skull clearly and is a good alternative of the cadaveric skull. Conclusion We present an available and cost-effective way to obtain a printed skull model from the original CT data, which has a considerable economic and social benefit for the medical education. The steps of the data processing can be performed easily. The cost for the 3D printed model is also low. The manipulation procedure presented in this study can be applied widely in processing skull data. Copyright © 2017, The Authors. All rights reserved.

关键词： 3D printers

来源：评论

学校读者我要写书评

暂无评论

Mt tuning on red: A dependency-based evaluation metric 10

Mt tuning on red: A dependency-based evaluation metric

引用

10th Workshop on Statistical Machine Translation, WMT 2015 at the 2015 Conference on Empirical Methods in Natural Language Processing, EMNLP 2015

作者： Li, Liangyou Yu, Hui Liu, Qun Adapt Centre School of Computing Dublin City University Ireland Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781941643327

In this paper, we describe our submission to WMT 2015 Tuning Task. We integrate a dependency-based MT evaluation metric, RED, to Moses and compare it with BLEU and METEOR in conjunction with two tuning methods: MERT and MIRA. Experiments are conducted using hierarchical phrase-based models on Czech-English and English-Czech tasks. Our results show that MIRA performs better than MERT in most cases. Using RED performs similarly to METEOR when tuning is performed using MIRA. We submit our system tuned by MIRA towards RED to WMT 2015. In human evaluations, we achieve the 1st rank in all 7 systems on the English-Czech task and 6/9 on the Czech-English task. © EMNLP 2015. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Encoding-Aware Data Placement for Efficient Degraded Reads in XOR-Coded Storage Systems

Encoding-Aware Data Placement for Efficient Degraded Reads i...

引用

Reliable Distributed Systems

作者： Zhirong Shen Patrick P.C. Lee Jiwu Shu Wenzhong Guo College of Mathematics and Computer Science Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Department of Computer Science and Engineering The Chinese University of Hong Kong Department of Computer Science and Technology Tsinghua University Key Laboratory of Spatial Data Mining and Information Sharing Minstry of Education Fuzhou China

ISBN: (纸本)9781509035144

Erasure coding has been increasingly used by distributed storage systems to maintain fault tolerance with low storage redundancy. However, how to enhance the performance of degraded reads in erasure-coded storage has been a critical issue. We revisit this problem from two different perspectives that are neglected by existing studies: data placement and encoding rules. To this end, we propose an encoding-aware data placement (EDP) approach that aims to reduce the number of I/Os in degraded reads during a single failure for general XOR-based erasure codes. EDP carefully places sequential data based on the encoding rules of the given erasure code. Trace-driven evaluation results show that compared to two baseline data placement methods, EDP reduces up to 37.4% of read data on the most loaded disk and shortens up to 15.4% of read time.

关键词： Encoding Distributed databases Layout Fault tolerant systems Redundancy Computer science

来源：评论

学校读者我要写书评

暂无评论

An improved reference point sampling method on Pareto optimal front

An improved reference point sampling method on Pareto optima...

引用

Congress on Evolutionary Computation

作者： Cheng He Linqiang Pan Hang Xu Ye Tian Xingyi Zhang Laboratory of Image Information Processing and Intelligent Control Huazhong University of Science and Technology Wuhan Hubei China Huazhong University of Science and Technology Wuhan Hubei CN Department of Computer Science Xiamen University Xiamen Fujian China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei Anhui China

ISBN: (纸本)9781509006243

In this paper, we propose a sampling approach of reference points used for performance metrics of multi-objective evolutionary algorithms. Traditional reference point sampling methods, such as the Das and Dennis method, usually sample the reference points via a set of uniformly distributed weight vectors generated on an ideal hyper-plane in objective space, which however often ignore the geometric shape of a specific Pareto front. Therefore, we propose a novel reference point sampling approach by taking the specific shape of the Pareto optimal front to be tackled into account for measuring the performance of multi-objective evolutionary algorithms. The performance of the proposed reference point sampling method against the other two state-of-the-art sampling methods is tested on six test instances in various conditions, which clearly demonstrate the effectiveness and superiority of the proposed sampling method.

关键词： Sampling methods Shape Convergence Evolutionary computation Optimization Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：