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

arXiv 2023年

作者： Kolf, Jan Niklas Boutros, Fadi Elliesen, Jurek Theuerkauf, Markus Damer, Naser Alansari, Mohamad Hay, Oussama Abdul Alansari, Sara Javed, Sajid Werghi, Naoufel Grm, Klemen Štruc, Vitomir Alonso-Fernandez, Fernando Diaz, Kevin Hernandez Bigun, Josef George, Anjith Ecabert, Christophe Shahreza, Hatef Otroshi Kotwal, Ketan Marcel, Sébastien Medvedev, Iurii Jin, Bo Nunes, Diogo Hassanpour, Ahmad Khatiwada, Pankaj Toor, Aafan Ahmad Yang, Bian Fraunhofer Institute for Computer Graphics Research IGD Germany TU Darmstadt Germany Department of Electrical and Computer Engineering Khalifa University Abu Dhabi United Arab Emirates Laboratory for Machine Intelligence Faculty of Electrical Engineering University of Ljubljana Slovenia Halmstad University Sweden Idiap Research Institute Martigny Switzerland Lausanne Switzerland Lausanne Switzerland Institute of Systems and Robotics University of Coimbra Coimbra Portugal eHealth and Welfare Security Group Department of Information Security and Communication Technology Norwegian University of Science and Technology Norway

This paper presents the summary of the Efficient Face Recognition Competition (EFaR) held at the 2023 International Joint Conference on Biometrics (IJCB 2023). The competition received 17 submissions from 6 different teams. To drive further development of efficient face recognition models, the submitted solutions are ranked based on a weighted score of the achieved verification accuracies on a diverse set of benchmarks, as well as the deployability given by the number of floating-point operations and model size. The evaluation of submissions is extended to bias, cross-quality, and large-scale recognition benchmarks. Overall, the paper gives an overview of the achieved performance values of the submitted solutions as well as a diverse set of baselines. The submitted solutions use small, efficient network architectures to reduce the computational cost, some solutions apply model quantization. An outlook on possible techniques that are underrepresented in current solutions is given as well. © 2023, CC BY-NC-SA.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Touchstone Benchmark: Are We on the Right Way for Evaluating AI Algorithms for Medical Segmentation?

arXiv

引用

arXiv 2024年

作者： Bassi, Pedro R.A.S. Li, Wenxuan Tang, Yucheng Isensee, Fabian Wang, Zifu Chen, Jieneng Chou, Yu-Cheng Roy, Saikat Kirchhoff, Yannick Rokuss, Maximilian Huang, Ziyan Ye, Jin He, Junjun Wald, Tassilo Ulrich, Constantin Baumgartner, Michael Maier-Hein, Klaus H. Jaeger, Paul Ye, Yiwen Xie, Yutong Zhang, Jianpeng Chen, Ziyang Xia, Yong Xing, Zhaohu Zhu, Lei Sadegheih, Yousef Bozorgpour, Afshin Kumari, Pratibha Azad, Reza Merhof, Dorit Shi, Pengcheng Ma, Ting Du, Yuxin Bai, Fan Huang, Tiejun Zhao, Bo Wang, Haonan Li, Xiaomeng Gu, Hanxue Dong, Haoyu Yang, Jichen Mazurowski, Maciej A. Gupta, Saumya Wu, Linshan Zhuang, Jiaxin Chen, Hao Roth, Holger Xu, Daguang Blaschko, Matthew B. Decherchi, Sergio Cavalli, Andrea Yuille, Alan L. Zhou, Zongwei Department of Computer Science Johns Hopkins University United States Department of Pharmacy and Biotechnology University of Bologna Italy Center for Biomolecular Nanotechnologies Istituto Italiano di Tecnologia Italy NVIDIA United States Germany Germany ESAT-PSI KU Leuven Belgium Faculty of Mathematics and Computer Science Heidelberg University Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Germany Shanghai Jiao Tong University China Shanghai Artificial Intelligence Laboratory China Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Germany DKFZ Germany School of Computer Science and Engineering Northwestern Polytechnical University China Australian Institute for Machine Learning The University of Adelaide Australia College of Computer Science and Technology Zhejiang University China Hong Kong University of Science and Technology Guangzhou China Hong Kong University of Science and Technology Hong Kong Faculty of Informatics and Data Science University of Regensburg Germany Faculty of Electrical Engineering and Information Technology RWTH Aachen University Germany Fraunhofer Institute for Digital Medicine MEVIS Germany Electronic & Information Engineering School Harbin Institute of Technology Shenzhen China China The Chinese University of Hong Kong Hong Kong Peking University China Department of Electrical and Computer Engineering Duke University United States Stony Brook University United States Department of Computer Science and Engineering Department of Chemical and Biological Engineering Division of Life Science Hong Kong University of Science and Technology Hong Kong Data Science and Computation Facility Fondazione Istituto Italiano di Tecnologia Italy Ecole Polytechnique Fédérale de Lausanne Switzerland

How can we test AI performance? This question seems trivial, but it isn’t. Standard benchmarks often have problems such as in-distribution and small-size test sets, oversimplified metrics, unfair comparisons, and short-term outcome pressure. As a consequence, good performance on standard benchmarks does not guarantee success in real-world scenarios. To address these problems, we present Touchstone, a large-scale collaborative segmentation benchmark of 9 types of abdominal organs. This benchmark is based on 5,195 training CT scans from 76 hospitals around the world and 5,903 testing CT scans from 11 additional hospitals. This diverse test set enhances the statistical significance of benchmark results and rigorously evaluates AI algorithms across out-of-distribution scenarios. We invited 14 inventors of 19 AI algorithms to train their algorithms, while our team, as a third party, independently evaluated these algorithms. In addition, we also evaluated pre-existing AI frameworks—which, differing from algorithms, are more flexible and can support different algorithms—including MONAI from NVIDIA, nnU-Net from DKFZ, and numerous other open-source frameworks. We are committed to expanding this benchmark to encourage more innovation of AI algorithms for the medical domain. Copyright © 2024, The Authors. All rights reserved.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

Convolution-enhanced Evolving Attention Networks

arXiv

引用

arXiv 2022年

作者： Wang, Yujing Yang, Yaming Li, Zhuo Bai, Jiangang Zhang, Mingliang Li, Xiangtai Yu, Jing Zhang, Ce Huang, Gao Tong, Yunhai Key Laboratory of Machine Perception MOE School of Intelligence Science and Technology Peking University China Department of Computer Science & Technology Engineering Research Center of Microprocessor & System Peking University China Institute of Information Engineering Chinese Academy of Sciences China ETH Zürich Switzerland The Department of Automation Tsinghua University China

Attention-based neural networks, such as Transformers, have become ubiquitous in numerous applications, including computer vision, natural language processing, and time-series analysis. In all kinds of attention networks, the attention maps are crucial as they encode semantic dependencies between input tokens. However, most existing attention networks perform modeling or reasoning based on representations, wherein the attention maps of different layers are learned separately without explicit interactions. In this paper, we propose a novel and generic evolving attention mechanism, which directly models the evolution of inter-token relationships through a chain of residual convolutional modules. The major motivations are twofold. On the one hand, the attention maps in different layers share transferable knowledge, thus adding a residual connection can facilitate the information flow of inter-token relationships across layers. On the other hand, there is naturally an evolutionary trend among attention maps at different abstraction levels, so it is beneficial to exploit a dedicated convolution-based module to capture this process. Equipped with the proposed mechanism, the convolution-enhanced evolving attention networks achieve superior performance in various applications, including time-series representation, natural language understanding, machine translation, and image classification. Especially on time-series representation tasks, Evolving Attention-enhanced Dilated Convolutional (EA-DC-) Transformer outperforms state-of-the-art models significantly, achieving an average of 17% improvement compared to the best SOTA. To the best of our knowledge, this is the first work that explicitly models the layer-wise evolution of attention maps. Our implementation is available at https://***/pkuyym/EvolvingAttention. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Transformative Effects of ChatGPT on Modern Education: Emerging Era of AI Chatbots

arXiv

引用

arXiv 2023年

作者： Gill, Sukhpal Singh Xu, Minxian Patros, Panos Wu, Huaming Kaur, Rupinder Kaur, Kamalpreet Fuller, Stephanie Singh, Manmeet Arora, Priyansh Parlikad, Ajith Kumar Stankovski, Vlado Abraham, Ajith Ghosh, Soumya K. Lutfiyya, Hanan Kanhere, Salil S. Bahsoon, Rami Rana, Omer Dustdar, Schahram Sakellariou, Rizos Uhlig, Steve Buyya, Rajkumar School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Raygun Performance Monitoring Wellington New Zealand Center for Applied Mathematics Tianjin University Tianjin China Department of Science Kings Education London United Kingdom Cymax Group Technologies BC Canada QM Academy Queen Mary University of London London United Kingdom Jackson School of Geosciences University of Texas at Austin AustinTX United States Centre for Climate Change Research Indian Institute of Tropical Meteorology Pune India Microsoft Hyderabad India Institute for Manufacturing Department of Engineering University of Cambridge Cambridge United Kingdom Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Machine Intelligence Research Labs AuburnWA United States Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Department of Computer Science University of Western Ontario London Canada Sydney Australia School of Computer Science University of Birmingham United Kingdom School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Distributed Systems Group Vienna University of Technology Vienna Austria Department of Computer Science University of Manchester Oxford Road Manchester United Kingdom Laboratory School of Computing and Information Systems The University of Melbourne Australia

ChatGPT, an AI-based chatbot, was released to provide coherent and useful replies based on analysis of large volumes of data. In this article, leading scientists, researchers and engineers discuss the transformative effects of ChatGPT on modern education. This research seeks to improve our knowledge of ChatGPT capabilities and its use in the education sector, identifying potential concerns and challenges. Our preliminary evaluation concludes that ChatGPT performed differently in each subject area including finance, coding and maths. While ChatGPT has the ability to help educators by creating instructional content, offering suggestions and acting as an online educator to learners by answering questions and promoting group work, there are clear drawbacks in its use, such as the possibility of producing inaccurate or false data and circumventing duplicate content (plagiarism) detectors where originality is essential. The often reported "hallucinations" within Generative AI in general, and also relevant for ChatGPT, can render its use of limited benefit where accuracy is essential. What ChatGPT lacks is a stochastic measure to help provide sincere and sensitive communication with its users. Academic regulations and evaluation practices used in educational institutions need to be updated, should ChatGPT be used as a tool in education. To address the transformative effects of ChatGPT on the learning environment, educating teachers and students alike about its capabilities and limitations will be crucial. © 2023, CC0.

关键词： machine learning

来源：评论

学校读者我要写书评

暂无评论

BiAdam: Fast Adaptive Bilevel Optimization Methods

arXiv

引用

arXiv 2021年

作者： Huang, Feihu Li, Junyi Gao, Shangqian College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Miit Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing China Department of Electrical and Computer Engineering University of Pittsburgh Pittsburgh United States

Bilevel optimization recently has attracted increased interest in machine learning due to its many applications such as hyper-parameter optimization and meta learning. Although many bilevel methods recently have been proposed, these methods do not consider using adaptive learning rates. It is well known that adaptive learning rates can accelerate optimization algorithms. To fill this gap, in the paper, we propose a novel fast adaptive bilevel framework to solve stochastic bilevel optimization problems that the outer problem is possibly nonconvex and the inner problem is strongly convex. Our framework uses unified adaptive matrices including many types of adaptive learning rates, and can flexibly use the momentum and variance reduced techniques. In particular, we provide a useful convergence analysis framework for the bilevel optimization. Specifically, we propose a fast single-loop adaptive bilevel optimization (BiAdam) algorithm, which achieves a sample complexity of Õ(ϵ-4) for finding an ϵ-stationary solution. Meanwhile, we propose an accelerated version of BiAdam algorithm (VR-BiAdam), which reaches the best known sample complexity of Õ(ϵ-3). To the best of our knowledge, we first study the adaptive bilevel optimization methods with adaptive learning rates. Experimental results on data hyper-cleaning and hyper-representation learning tasks demonstrate the efficiency of our algorithms. © 2021, CC BY-NC-SA.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Medical Image Segmentation with High-Fidelity Prototypes

arXiv

引用

arXiv 2024年

作者： Tang, Song Yan, Shaxu Qi, Xiaozhi Gao, Jianxin Ye, Mao Zhang, Jianwei Zhu, Xiatian IMI Group School of Health Sciences and Engineering University of Shanghai for Science and Technology Shanghai China TAMS Group Department of Informatics Universität Hamburg Hamburg Germany School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Surrey Institute for People-Centred Artificial Intelligence Centre for Vision Speech and Signal Processing University of Surrey Guildford United Kingdom Shenzhen Key Laboratory of Minimally Invasive Surgical Robotics and System Shenzhen Institute of Advanced Technology Chinese Academy of Sciences China

Few-shot Semantic Segmentation (FSS) aims to adapt a pretrained model to new classes with as few as a single labelled training sample per class. Despite the prototype based approaches have achieved substantial success, existing models are limited to the imaging scenarios with considerably distinct objects and not highly complex background, e.g., natural images. This makes such models suboptimal for medical imaging with both conditions invalid. To address this problem, we propose a novel Detail Self-refined Prototype Network (DSPNet) to constructing high-fidelity prototypes representing the object foreground and the background more comprehensively. Specifically, to construct global semantics while maintaining the captured detail semantics, we learn the foreground prototypes by modelling the multi-modal structures with clustering and then fusing each in a channel-wise manner. Considering that the background often has no apparent semantic relation in the spatial dimensions, we integrate channel-specific structural information under sparse channel-aware regulation. Extensive experiments on three challenging medical image benchmarks show the superiority of DSPNet over previous state-of-the-art methods. The code and data are available at https://***/tntek/DSPNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

FraGNNet: A Deep Probabilistic Model for Mass Spectrum Prediction

arXiv

引用

arXiv 2024年

作者： Young, Adamo Wang, Fei Wishart, David Wang, Bo Röst, Hannes Greiner, Russ Department of Computer Science University of Toronto Toronto Canada Vector Institute for Artificial Intelligence Toronto Canada Terrence Donnelly Centre for Cellular and Biomolecular Research University of Toronto Toronto Canada Department of Computing Science University of Alberta Edmonton Canada Alberta Machine Intelligence Institute Edmonton Canada Department of Biological Sciences University of Alberta EdmontonAB Canada Department of Laboratory Medicine and Pathology University of Alberta EdmontonAB Canada Faculty of Pharmacy and Pharmaceutical Sciences University of Alberta EdmontonAB Canada Department of Laborartory Medicine and Pathobiology University of Toronto Toronto Canada Peter Munk Cardiac Centre University Health Network Toronto Canada Department of Molecular Genetics University of Toronto Toronto Canada

The process of identifying a compound from its mass spectrum is a critical step in the analysis of complex mixtures. Typical solutions for the mass spectrum to compound (MS2C) problem involve matching the unknown spectrum against a library of known spectrum-molecule pairs, an approach that is limited by incomplete library coverage. Compound to mass spectrum (C2MS) models can improve retrieval rates by augmenting real libraries with predicted spectra. Unfortunately, many existing C2MS models suffer from problems with prediction resolution, scalability, or interpretability. We develop a new probabilistic method for C2MS prediction, FraGNNet, that can efficiently and accurately predict high-resolution spectra. FraGNNet uses a structured latent space to provide insight into the underlying processes that define the spectrum. Our model achieves state-of-the-art performance in terms of prediction error, and surpasses existing C2MS models as a tool for retrieval-based MS2C. © 2024, CC BY.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Corrections to “Brain-Inspired Computing: A Systematic Survey and Future Trends”

引用

Proceedings of the IEEE 2025年第12期112卷 1850-1850页

作者： Guoqi Li Lei Deng Huajin Tang Gang Pan Yonghong Tian Kaushik Roy Wolfgang Maass Institute of Automation Chinese Academy of Sciences Beijing China Key Laboratory of Brain Cognition and Brain-inspired Intelligence Technology Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China Department of Precision Instrument Tsinghua University Beijing China State Key Laboratory of Brain-Machine Intelligence College of Computer Science and Technology MOE Frontier Science Center for Brain Science and Brain-Machine Integration Zhejiang University Hangzhou China Department of Computer Science Peking University Beijing China School of Electrical and Computer Engineering Purdue University West Lafayette IN USA School of Computer Science Graz University of Technology Graz Austria

Presents corrections to the paper, (Corrections to “Brain-Inspired Computing: A Systematic Survey and Future Trends”).

关键词： Artificial intelligence Computational modeling Brain modeling Biological system modeling Surveys computer architecture Benchmark testing Bio-inspired computing Neuromorphic engineering Sensors Neural networks Software tools

来源：评论

学校读者我要写书评

暂无评论

FDDH: Fast discriminative discrete hashing for large-scale cross-modal retrieval

arXiv

引用

arXiv 2021年

作者： Liu, Xin Wang, Xingzhi Cheung, Yiu-Ming Department of Computer Science Huaqiao University Xiamen Key Laboratory of Computer Vision and Pattern Recognition Fujian Key Laboratory of Big Data Intelligence and Security Xiamen361021 China School of Electronics and Information Technology Sun Yat-sen University Guangzhou510006 China Department of Computer Science Hong Kong Baptist University Hong Kong Hong Kong

Cross-modal hashing, favored for its effectiveness and efficiency, has received wide attention to facilitating efficient retrieval across different modalities. Nevertheless, most existing methods do not sufficiently exploit the discriminative power of semantic information when learning the hash codes, while often involving time-consuming training procedure for handling the large-scale dataset. To tackle these issues, we formulate the learning of similarity-preserving hash codes in terms of orthogonally rotating the semantic data so as to minimize the quantization loss of mapping such data to hamming space, and propose an efficient Fast Discriminative Discrete Hashing (FDDH) approach for large-scale cross-modal retrieval. More specifically, FDDH introduces an orthogonal basis to regress the targeted hash codes of training examples to their corresponding semantic labels, and utilizes ϵ-dragging technique to provide provable large semantic margins. Accordingly, the discriminative power of semantic information can be explicitly captured and maximized. Moreover, an orthogonal transformation scheme is further proposed to map the nonlinear embedding data into the semantic subspace, which can well guarantee the semantic consistency between the data feature and its semantic representation. Consequently, an efficient closedform solution is derived for discriminative hash code learning, which is very computationally efficient. In addition, an effective and stable online learning strategy is presented for optimizing modality-specific projection functions, featuring adaptivity to different training sizes and streaming data. The proposed FDDH approach theoretically approximates the bi-Lipschitz continuity, runs sufficiently fast, and also significantly improves the retrieval performance over the state-of-the-art methods. The source code is released at: https://***/starxliu/FDDH. © 2021, CC0.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

ProtoCLIP: Prototypical Contrastive Language Image Pretraining

arXiv

引用

arXiv 2022年

作者： Chen, Delong Wu, Zhao Liu, Fan Yang, Zaiquan Zheng, Shaoqiu Tan, Ying Zhou, Erjin the College of Computer and Information Hohai University Nanjing China Science and Technology on Underwater Vehicle Technology Laboratory Harbin China Hong Kong MEGVII Research Beijing China Nanjing Research Institute of Electronic Engineering China Department of Machine Intelligence School of EECS Peking University China

Contrastive Language Image Pretraining (CLIP) has received widespread attention, since its learned representations can be transferred well to various downstream tasks. During the training process of the CLIP model, the InfoNCE objective aligns positive image-text pairs and separates negative ones. We show an underlying representation grouping effect during this process: the InfoNCE objective indirectly groups semantically similar representations together via randomly emerged within-modal anchors. Based on this understanding, in this paper, Prototypical Contrastive Language Image Pretraining (ProtoCLIP) is introduced to enhance such grouping by boosting its efficiency and increasing its robustness against the modality gap. Specifically, ProtoCLIP sets up prototype-level discrimination between image and text spaces, which efficiently transfers higher-level structural knowledge. Further, Prototypical Back Translation (PBT) is proposed to decouple representation grouping from representation alignment, resulting in effective learning of meaningful representations under large modality gap. The PBT also enables us to introduce additional external teachers with richer prior language knowledge. ProtoCLIP is trained with an online episodic training strategy, which makes it can be scaled up to unlimited amounts of data. We train our ProtoCLIP on Conceptual Captions and achieved an +5.81% ImageNet linear probing improvement and an +2.01% ImageNet zero-shot classification improvement. On the larger YFCC-15M dataset, ProtoCLIP matches the performance of CLIP with 33% of training time. © 2022, CC BY.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：