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

<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

引用

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

来源：评论

学校读者我要写书评

暂无评论

FWLBP: A scale invariant descriptor for texture classification

arXiv

引用

arXiv 2018年

作者： Roy, Swalpa Kumar Bhattacharya, Nilavra Chanda, Bhabatosh Chaudhuri, Bidyut B. Ghosh, Dipak Kumar Optical Character Recognition Laboratory Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata700108 India School of Information University of Texas AustinTX78712 United States Image Processing Laboratory Electronics and Communication Sciences Unit Indian Statistical Institute Kolkata700108 India Department of Electronics and Communication Engineering National Institute of Technology Rourkela Rourkela769008 India

In this paper we propose a novel texture descriptor called Fractal Weighted Local Binary pattern (FWLBP). The fractal dimension (FD) measure is relatively invariant to scale-changes, and presents a good correlation with human viewpoint of surface roughness. We have utilized this property to construct a scale-invariant descriptor. Here, the input image is sampled using an augmented form of the local binary pattern (LBP) over three different radii, and then used an indexing operation to assign FD weights to the collected samples. The final histogram of the descriptor has its features calculated using LBP, and its weights computed from the FD image. The proposed descriptor is scale invariant, and is also robust in rotation or reflection, and partially tolerant to noise and illumination changes. In addition, the local fractal dimension is relatively insensitive to the bi-Lipschitz transformations, whereas its extension is adequate to precisely discriminate the fundamental of texture primitives. Experiment results carried out on standard texture databases show that the proposed descriptor achieved better classification rates compared to the state-of-the-art descriptors. Copyright © 2018, The Authors. All rights reserved.

关键词： Fractal dimension

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cross-media analysis and reasoning: advances and directions

引用

Frontiers of information Technology & Electronic Engineering 2017年第1期18卷 44-57页

作者： Yu-xin PENG Wen-wu ZHU Yao ZHAO Chang-sheng XU Qing-ming HUANG Han-qing LU Qing-hua ZHENG Tie-jun HUANG Wen GAO Institute of Computer Science and Technology Peking University Department of Computer Science and Technology Tsinghua University Institute of Information Science Beijing Jiaotong University National Laboratory of Pattern Recognition Institute of AutomationChinese Academy of Sciences Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences Department of Computer Science and Technology Xi'an Jiaotong University School of Electronics Engineering and Computer Science Peking University

Cross-media analysis and reasoning is an active research area in computer science, and a promising direction for artificial intelligence. However, to the best of our knowledge, no existing work has summarized the state-of-the-art methods for cross-media analysis and reasoning or presented advances, challenges, and future directions for the field. To address these issues, we provide an overview as follows：（1） theory and model for cross-media uniform representation; （2） cross-media correlation understanding and deep mining; （3） cross-media knowledge graph construction and learning methodologies; （4） cross-media knowledge evolution and reasoning; （5） cross-media description and generation; （6） cross-media intelligent engines; and （7） cross-media intelligent applications. By presenting approaches, advances, and future directions in cross-media analysis and reasoning, our goal is not only to draw more attention to the state-of-the-art advances in the field, but also to provide technical insights by discussing the challenges and research directions in these areas.

关键词： Cross-media analysis Cross-media reasoning Cross-media applications

来源：评论

学校读者我要写书评

暂无评论

SOUND CLASSIFICATION BASED ON SPECTROGRAM FOR SURVEILLANCE APPLICATIONS 5

SOUND CLASSIFICATION BASED ON SPECTROGRAM FOR SURVEILLANCE A...

引用

2016 5th IEEE International Conference on Network Infrastructure and Digital Content(IC-NIDC 2016)

作者： Yingjie Li Gang Liu Pattern Recognition and Intelligent System Laboratory School of Information and Communication EngineeringBeijing University of Posts and Telecommunications

ISBN: (纸本)9781509012473

This paper presents an audio event classification algorithm which automatically classifies an audio event as footstep,glass breaking,gunshot or scream mainly for surveillance ***,the Gabor feature of the audio spectrogram is extracted,there are two kinds of Gabor features,namely global Gabor feature and local Gabor *** we use Principal Components Analysis(PCA) and Linear Discriminant Analysis(LDA) to compress the feature dimension,finally the K nearest neighbor classifier(KNN) is used to recognize audio *** carried out extensive experiments on the clean and noisy audio *** results demonstrate that the algorithm is able to guarantee a recall of 96.1%on clean sets and is proved to be more effective than traditional methods.

关键词： Spectrogram Global Gabor feature Local Gabor feature PCA LDA

来源：评论

学校读者我要写书评

暂无评论

HUMMING FEATURE EXTRACTION BASED ON LOCALITY STATISTICAL ANALYSIS 5

HUMMING FEATURE EXTRACTION BASED ON LOCALITY STATISTICAL ANA...

引用

2016 5th IEEE International Conference on Network Infrastructure and Digital Content(IC-NIDC 2016)

作者： Gang Liu Yanyao Bian Yanqiu Wang Pattern Recognition and Intelligent System Laboratory School of Information and Communication EngineeringBeijing University of Posts and Telecommunications

ISBN: (纸本)9781509012473

This paper presents a novel humming feature extraction algorithm based on locality statistical analysis to tackle the problem of the instability of humming features in the query by humming（QBH） *** carrying out statistics to humming notes sequences in both longitudinal vocal range distribution and horizontal temporal variation distribution,we can obtain the locality statistical humming *** we concatenate several features using the idea of N-gram to improve feature *** the framework of QBH based on Locality Sensitive Hashing（LSH）,the proposed method has achieves 86%top-1 rate and 92%top-5 rate in the experiment,indicating the effectiveness of the method.

关键词： query by humming feature extraction locality statistics note distribution temporal distribution

来源：评论

学校读者我要写书评

暂无评论

Understanding metric-related pitfalls in image analysis validation

arXiv

引用

arXiv 2023年

作者： Reinke, Annika Tizabi, Minu D. Baumgartner, Michael Eisenmann, Matthias Heckmann-Nötzel, Doreen Kavur, A. Emre Rädsch, Tim Sudre, Carole H. Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Benis, Arriel Blaschko, Matthew B. Buettner, Florian Cardoso, M. Jorge Cheplygina, Veronika Chen, Jianxu Christodoulou, Evangelia Cimini, Beth A. Collins, Gary S. Farahani, Keyvan Ferrer, Luciana Galdran, Adrian van Ginneken, Bram Glocker, Ben Godau, Patrick Haase, Robert Hashimoto, Daniel A. Hoffman, Michael M. Huisman, Merel Isensee, Fabian Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kenngott, Hannes Kleesiek, Jens Kofler, Florian Kooi, Thijs Kopp-Schneider, Annette Kozubek, Michal Kreshuk, Anna Kurc, Tahsin Landman, Bennett A. Litjens, Geert Madani, Amin Maier-Hein, Klaus Martel, Anne L. Mattson, Peter Meijering, Erik Menze, Bjoern Moons, Karel G.M. Müller, Henning Nichyporuk, Brennan Nickel, Felix Petersen, Jens Rafelski, Susanne M. Rajpoot, Nasir Reyes, Mauricio Riegler, Michael A. Rieke, Nicola Saez-Rodriguez, Julio Sánchez, Clara I. Shetty, Shravya Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. van Calster, Ben Varoquaux, Gaël Yaniv, Ziv R. Jäger, Paul F. Maier-Hein, Lena Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Division of Intelligent Medical Systems Germany NCT Heidelberg A Partnership Between DKFZ University Medical Center Heidelberg Germany Heidelberg Division of Medical Image Computing Germany Heidelberg Division of Intelligent Medical Systems Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London London United Kingdom Instituto de Cálculo CONICET – Universidad de Buenos Aires Buenos Aires Argentina Centre for Medical Image Computing University College London London United Kingdom McGill University Montreal Canada Division of Computational Pathology Dept of Pathology & Laboratory Medicine Indiana University School of Medicine IU Health Information and Translational Sciences Building Indianapolis United States University of Pennsylvania Richards Medical Research Laboratories FL7 PhiladelphiaPA United States Department of Digital Medical Technologies Holon Institute of Technology Holon Israel European Federation for Medical Informatics Le Mont-sur-Lausanne Switzerland Center for Processing Speech and Images Department of Electrical Engineering KU Leuven Leuven Belgium partner site Frankfurt/Mainz a partnership between DKFZ and UCT Frankfurt Marburg Germany Heidelberg Germany Goethe University Frankfurt Department of Medicine Germany Goethe University Frankfurt Department of Informatics Germany and Frankfurt Cancer Insititute Germany Department of Computer Science IT University of Copenhagen Copenhagen Denmark Leibniz-Institut für Analytische Wissenschaften – ISAS – e.V. Dortmund Germany Imaging Platform Broad Institute of MIT and Harvard CambridgeMA United States Centre for Statistics in Medicine University of Oxford Oxford United Kingdom Center for Biomedical In

Validation metrics are key for tracking scientific progress and bridging the current chasm between artificial intelligence (AI) research and its translation into practice. However, increasing evidence shows that particularly in image analysis, metrics are often chosen inadequately. While taking into account the individual strengths, weaknesses, and limitations of validation metrics is a critical prerequisite to making educated choices, the relevant knowledge is currently scattered and poorly accessible to individual researchers. Based on a multi-stage Delphi process conducted by a multidisciplinary expert consortium as well as extensive community feedback, the present work provides the first reliable and comprehensive common point of access to information on pitfalls related to validation metrics in image analysis. While focused on biomedical image analysis, the addressed pitfalls generalize across application domains and are categorized according to a newly created, domain-agnostic taxonomy. The work serves to enhance global comprehension of a key topic in image analysis validation. © 2023, CC BY.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：