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

Overview of the CCKS 2019 knowledge graph evaluation track: Entity, relation, event and QA

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Han, Xianpei Wang, Zhichun Zhang, Jiangtao Wen, Qinghua Li, Wenqi Tang, Buzhou Wang, Qi Feng, Zhifan Zhang, Yang Lu, Yajuan Wang, Haitao Chen, Wenliang Shao, Hao Chen, Yubo Liu, Kang Zhao, Jun Wang, Taifeng Zhang, Kezun Wang, Meng Jiang, Yinlin Qi, Guilin Zou, Lei Hu, Sen Zhang, Minhao Lin, Yinnian Chinese Information Processing Laboratory Institute of Software Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence Beijing Normal University Beijing100875 China 305 Hospital of People’s Liberation Army Beijing100017 China Department of Computer Science and Technology Tsinghua University Beijing100084 China Yidu Cloud Beijing100000 China Harbin Institute of Technology Shenzhen Guangdong518055 China Baidu Beijing100193 China School of Computer Science & Technology Soochow University Suzhou Jiangsu215006 China Gowild Suzhou Jiangsu215002 China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China Ant Financial Hangzhou Zhejiang310000 China School of Computer Science and Engineering Southeast University Nanjing Jiangsu211189 China Key Laboratory of Computer Network Information Integration Southeast University Nanjing Jiangsu211189 China Peking University Beijing100871 China

Knowledge graph models world knowledge as concepts, entities, and the relationships between them, which has been widely used in many real-world tasks. CCKS 2019 held an evaluation track with 6 tasks and attracted more than 1,600 teams. In this paper we give an overview of the knowledge graph evaluation tract at CCKS 2019. By reviewing the task definition, successful methods, useful resources, good strategies and research challenges associated with each task in CCKS 2019, this paper can provide a helpful reference for developing knowledge graph applications and conducting future knowledge graph researches. Copyright © 2020, The Authors. All rights reserved.

关键词： Knowledge graph

CNN-based invertible wavelet scattering for the investigation of diffusion properties of the in vivo human heart in diffusion tensor imaging

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Deng, Zeyu Wang, Lihui Kuai, Zixiang Chen, Qijian Cheng, Xinyu Yang, Feng Yang, Jie Zhu, Yuemin Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province College of Computer Science and Technology Guizhou University Guiyang550025 China Imaging Center Harbin Medical University Cancer Hospital Harbin150081 China School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China University Lyon INSA Lyon CNRS Inserm IRP Metislab CREATIS UMR5220 U1206 LyonF-69621 France

In vivo diffusion tensor imaging (DTI) is a promising technique to investigate noninvasively the fiber structures of the in vivo human heart. However, signal loss due to motions remains a persistent problem in in vivo cardiac DTI. We propose a novel motion-compensation method for investigating in vivo myocardium structures in DTI with free-breathing acquisitions. The method is based on an invertible Wavelet Scattering achieved by means of Convolutional Neural Network (WSCNN). It consists of first extracting translation-invariant wavelet scattering features from DW images acquired at different trigger delays and then mapping the fused scattering features into motion-compensated spatial DW images by performing an inverse wavelet scattering transform achieved using CNN. The results on both simulated and acquired in vivo cardiac DW images showed that the proposed WSCNN method effectively compensates for motion-induced signal loss and produces in vivo cardiac DW images with better quality and more coherent fiber structures with respect to existing methods, which makes it an interesting method for measuring correctly the diffusion properties of the in vivo human heart in DTI under free breathing. Copyright © 2019, The Authors. All rights reserved.

关键词： Diffusion tensor imaging

Learning data-adaptive nonparametric kernels

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Liu, Fanghui Huang, Xiaolin Gong, Chen Yang, Jie Li, Li Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Automation Tsinghua University

Kernel methods have been extensively used in a variety of machine learning tasks such as classification, clustering, and dimensionality reduction. For complicated practical tasks, the traditional kernels, e.g., Gaussian kernel and sigmoid kernel, or their combinations are often not sufficiently flexible to fit the data. In this paper, we present a Data-Adaptive Nonparametric Kernel (DANK) learning framework in a data-driven manner. To be specific, in model formulation, we impose an adaptive matrix on the kernel/Gram matrix in an entry-wise strategy. Since we do not specify the formulation of the adaptive matrix, each entry in the adaptive matrix can be directly and flexibly learned from the data. Therefore, the solution space of the learned kernel is largely expanded, which makes our DANK model flexible to capture the data with different local statistical properties. Specifically, the proposed kernel learning framework can be seamlessly embedded to support vector machines (SVM) and support vector regression (SVR), which has the capability of enlarging the margin between classes and reducing the model generalization error. Theoretically, we demonstrate that the objective function of our DANK model embedded in SVM/SVR is gradient-Lipschitz continuous. Thereby, the training process for kernel and parameter learning in SVM/SVR can be efficiently optimized in a unified framework. Further, to address the scalability issue in nonparametric kernel learning framework, we decompose the entire optimization problem in DANK into several smaller easy-to-solve problems, so that our DANK model can be efficiently approximated by this partition. The effectiveness of this approximation is demonstrated by both empirical studies and theoretical guarantees. Experimentally, the proposed DANK model embedded in SVM/SVR achieves encouraging performance on various classification and regression benchmark datasets when compared with other representative kernel learning based algorithms. Copyrig

关键词： Matrix algebra

Fast signal recovery from saturated measurements by linear loss and nonconvex penalties

学校读者我要写书评

暂无评论

arXiv 2018年

作者： He, Fan Huang, Xiaolin Liu, Yipeng Yan, Ming Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University The MOE Key Laboratory of System Control and Information Processing Shanghai200240 China School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu611731 China The Department of Computational Mathematics Science and Engineering Michigan State University MI United States

Sign information is the key to overcoming the inevitable saturation error in compressive sensing systems, which causes information loss and results in bias. For sparse signal recovery from saturation, we propose to use a linear loss to improve the effectiveness from existing methods that utilize hard constraints/hinge loss for sign consistency. Due to the use of linear loss, an analytical solution in the update progress is obtained, and some nonconvex penalties are applicable, e.g., the minimax concave penalty, the 0 norm, and the sorted 1 norm. Theoretical analysis reveals that the estimation error can still be bounded. Generally, with linear loss and nonconvex penalties, the recovery performance is significantly improved, and the computational time is largely saved, which is verified by the numerical experiments. Copyright © 2018, The Authors. All rights reserved.

关键词： Compressed sensing

<i>L</i>(2,1)-Labeling of the Brick Product Graphs

学校读者我要写书评

暂无评论

Journal of Applied Mathematics and Physics 2017年第8期5卷 1529-1536页

作者： Xiujun Zhang Hong Yang Hong Li School of Information Science and Engineering Chengdu University Chengdu China Key Laboratory of Pattern Recognition and Intelligent Information Processing Institutions of Higher Education of Sichuan Province Chengdu University Chengdu China

A k-L(2,1)-labeling for a graph G is a function such that whenever and whenever u and v are at distance two apart. The λ-number for G, denoted by λ(G), is the minimum k over all k-L(2,1)-labelings of G. In this paper, we show that for or 11, which confirms Conjecture 6.1 stated in [X. Li, V. Mak-Hau, S. Zhou, The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups, J. Comb. Optim. (2013) 25: 716-736] in the case when or 11. Moreover, we show that? if 1) either (mod 6), m is odd, r = 3, or 2) (mod 3), m is even (mod 2), r = 0.

关键词： Graph Labeling Brick Product Graph L((2 1)-Labeling Frequency Assignment Problem

A FAST RADIO BURST DISCOVERED IN FAST DRIFT SCAN SURVEY

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhu, Weiwei Li, Di Luo, Rui Miao, Chenchen Zhang, Bing Spitler, Laura Lorimer, Duncan Kramer, Michael Champion, David Yue, Youling Cameron, Andrew Cruces, Marilyn Duan, Ran Feng, Yi Han, Jun Hobbs, George Niu, Chenhui Niu, Jiarui Pan, Zhichen Qian, Lei Shi, Dai Tang, Ningyu Wang, Pei Wang, Hongfeng Yuan, Mao Zhang, Lei Zhang, Xinxin Cao, Shuyun Feng, Li Gan, Hengqian Gao, Long Gu, Xuedong Guo, Minglei Hao, Qiaoli Huang, Lin Huang, Menglin Jiang, Peng Jin, Chengjin Li, Hui Li, Qi Li, Qisheng Liu, Hongfei Pan, Gaofeng Peng, Bo Qian, Hui Shi, Xiangwei Song, Jinyuo Song, Liqiang Sun, Caihong Sun, Jinghai Wang, Hong Wang, Qiming Wang, Yi Xie, Xiaoyao Yan, Jun Yang, Li Yang, Shimo Yao, Rui Yu, Dongjun Yu, Jinglong Zhang, Chengmin Zhang, Haiyan Zhang, Shuxin Zheng, Xiaonian Zhou, Aiying Zhu, Boqin Zhu, Lichun Zhu, Ming Zhu, Wenbai Zhu, Yan CAS Key Laboratory of FAST NAOC Chinese Academy of Sciences Beijing100101 China University of Chinese Academy of Sciences Beijing100049 China CSIRO Astronomy and Space Science PO Box 76 EppingNSW1710 Australia Department of Physics and Astronomy University of Nevada Las Vegas Las VegasNV89154 United States National Astronomical Observatories Chinese Academy of Sciences Beijing100012 China Max-Planck-Institut fr Radioastronomie Auf dem Hgel 69 BonnD-53121 Germany Department of Physics and Astronomy West Virginia University P.O. Box 6315 MorgantownWV26506 United States Center for Gravitational Waves and Cosmology Chestnut Ridge Research Building MorgantownWV26505 United States Image Processing and Pattern Recognition Laboratory School of Artificial Intelligence Beijing Normal University Beijing100875 China School of Information Management Dezhou University Dezhou253023 China Institute for Astronomical Science Dezhou University Dezhou253023 China

We report the discovery of a highly dispersed fast radio burst, FRB 181123, from an analysis of ∼1500 hr of drift-scan survey data taken using the Five-hundred-meter Aperture Spherical radio Telescope (FAST). The pulse has three distinct emission components, which vary with frequency across our 1.0–1.5 GHz observing band. We measure the peak flux density to be > 0.065 Jy and the corresponding fluence > 0.2 Jy ms. Based on the observed dispersion measure of 1812 cm−3 pc, we infer a redshift of ∼ 1.9. From this, we estimate the peak luminosity and isotropic energy to be . 2 × 1043 erg s−1 and . 2 × 1040 erg, respectively. With only one FRB from the survey detected so far, our constraints on the event rate are limited. We derive a 95% confidence lower limit for the event rate of 900 FRBs per day for FRBs with fluences > 0.025 Jy ms. We performed follow-up observations of the source with FAST for four hours and have not found a repeated burst. We discuss the implications of this discovery for our understanding of the physical mechanisms of FRBs. Copyright © 2020, The Authors. All rights reserved.

关键词： Surveys

DNA Sequence Alignment Algorithm Based on k-tuple Statistics

学校读者我要写书评

暂无评论

DNA Sequence Alignment Algorithm Based on k-tuple Statistics

2017 2nd International Conference on Software, Multimedia and Communication Engineering（SMCE 2017)

作者： Jun-yan ZHANG Chen-hui YANG Hai-ying WANG College of Information Science and Engineering Chengdu UniversityChengdu 610106China Key Laboratory of Pattern Recognition and Intelligent Information Processing of Sichuan Chengdu University

DNA Sequence Alignment is one of the most basic and most important operations in *** this paper,we put forward to SDk S algorithm based on k-tuple statistic,which is a kind of probability *** positive transition probability matrix,the negative transition probability matrix,and the logarithmic ration are computed based on Markov *** obtaining converting sequence,we get the results of k-tuple ***,the similarity measurement can be gained according to above *** the minimum support is given,we can identify two DNA sequences is similarity or *** experimental results show that SDk S algorithm has better effective performance in saving computing time.

关键词： Sequence alignment k-tuple statistic Markov model Similarity measurement

Progressive Refinement Bilateral Filter

学校读者我要写书评

暂无评论

Progressive Refinement Bilateral Filter

IEEE International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)

作者： Chanyi Lu Yong Zhao Lin Wang Guiying Zhang Fujian Feng Li Zhang College of Data Science and Information Engineering Guizhou Minzu University Guiyang China School of Electronic and Computer Engineering Shenzhen Graduate School of Peking University Shenzhen China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University Guiyang China Department of Medical Information Engineering Zunyi Medical University Zunyi China

ISBN: (纸本)9781538678626;9781538678619

In this paper, a coarse-to-fine framework for image noise removal is proposed. The bilateral filter is redefined by the manner of progressive refining to effectively eliminate noise, thus forming progressive refinement bilateral filter (PRBF), which estimates the pixel values of a noisy image through the method of progressive refinement with gradual recursion and its result retains more details, infinite close to the original image. PRBF is further integrated into the denoising model for the details processing again after denoising of the major part of the image. Our algorithm is evaluated and compared on two large standardized datasets and a number of selected images. The experimental results show that our algorithm consistently outperforms other approaches for image denoising and demonstrates the effectiveness of our framework for stereo matching.

关键词： Noise reduction Image denoising Mathematical model Filtering Filtering algorithms Kernel Biomedical imaging

Correction to: Automatic identification of myopic maculopathy related imaging features in optic disc region via machine learning methods

学校读者我要写书评

暂无评论

Journal of translational medicine 2021年第1期19卷 203页

作者： Yuchen Du Qiuying Chen Ying Fan Jianfeng Zhu Jiangnan He Haidong Zou Dazhen Sun Bowen Xin David Feng Michael Fulham Xiuying Wang Lisheng Wang Xun Xu Department of Automation The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University (SJTU) 800 Dongchuan RD. Minhang District Shanghai 200240 People's Republic of China. Department of Preventative Ophthalmology Shanghai Eye Diseases Prevention and Treatment Center Shanghai Eye Hospital No. 380 Kangding Road Shanghai 200040 China. Department of Ophthalmology Shanghai Key Laboratory of Ocular Fundus Diseases Shanghai Engineering Center for Visual Science and Photo Medicine Shanghai General Hospital SJTU School of Medicine Shanghai China. National Clinical Research Center for Eye Diseases Shanghai 20080 China. Biomedical and Multimedia Information Technology Research Group School of Computer Science The University of Sydney Sydney NSW 2006 Australia. Department of Molecular Imaging Royal Prince Alfred Hospital and the University of Sydney Sydney Australia. Department of Automation The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University (SJTU) 800 Dongchuan RD. Minhang District Shanghai 200240 People's Republic of China. lswang@***. Department of Preventative Ophthalmology Shanghai Eye Diseases Prevention and Treatment Center Shanghai Eye Hospital No. 380 Kangding Road Shanghai 200040 China. drxuxun@***. Department of Ophthalmology Shanghai Key Laboratory of Ocular Fundus Diseases Shanghai Engineering Center for Visual Science and Photo Medicine Shanghai General Hospital SJTU School of Medicine Shanghai China. drxuxun@***. National Clinical Research Center for Eye Diseases Shanghai 20080 China. drxuxun@***.

An amendment to this paper has been published and can be accessed via the original article.

关键词：