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

CB-HVTNet: A channel-boosted hybrid vision transformer network for lymphocyte assessment in histopathological images

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ali, Momina Liaqat Rauf, Zunaira Khan, Asifullah Sohail, Anabia Ullah, Rafi Gwak, Jeonghwan Pattern Recognition Lab Department of Computer & Information Sciences Pakistan Institute of Engineering & Applied Sciences Nilore Islamabad45650 Pakistan Pakistan Institute of Engineering & Applied Sciences Nilore Islamabad45650 Pakistan Center for Mathematical Sciences Pakistan Institute of Engineering & Applied Sciences Nilore Islamabad45650 Pakistan Department of Computer Science Faculty of Computing and Artificial Intelligence Air University IslamabadE-9 Pakistan Perak31750 Malaysia Department of Software Korea National University of Transportation Chungju27469 Korea Republic of

Transformers, due to their ability to learn long-range dependencies, have overcome the shortcomings of convolutional neural networks (CNNs) for global perspective learning. However, their multi-head attention module only captures global-level feature representations, which is insufficient for medical images. To address this issue, we propose a Channel Boosted Hybrid Vision Transformer (CB-HVT) that uses transfer learning to generate boosted channels and employs both transformers and CNNs to analyse lymphocytes in histopathological images. The proposed CB-HVT comprises five modules to effectively identify lymphocytes. Its (i) channel generation module, uses the idea of channel boosting through transfer learning to extract diverse channels from different auxiliary learners. These boosted channels are first concatenated and ranked using an attention mechanism in the (ii) channel exploitation module. A fusion block is then utilized in the (iii) channel merging module for a gradual and systematic merging of the diverse boosted channels to improve the network’s learning representations. The CB-HVT also employs a proposal network in its (iv) region aware module followed by its (v) detection and segmentation head to accurately identify and distinguish objects, even in the regions with crowded presence and artifacts. We evaluated the proposed CB-HVT on two publicly available datasets for lymphocyte assessment in histopathological images. The results demonstrate that CB-HVT has a good generalization on unseen data therefore, it can serve as a valuable tool for pathologists. Copyright © 2023, The Authors. All rights reserved.

关键词： Lymphocytes

Graph Masked Autoencoders with Transformers

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhang, Sixiao Chen, Hongxu Yang, Haoran Sun, Xiangguo Yu, Philip S. Xu, Guandong Data Science and Machine Intelligence Lab Faculty of Engineering and Information Technology University of Technology Sydney SydneyNSW2007 Australia The Chinese University of Hong Kong Hong Kong Department of Computer Science University of Illinois at Chicago ChicagoIL60637 United States

Recently, transformers have shown promising performance in learning graph representations. However, there are still some challenges when applying transformers to real-world scenarios due to the fact that deep transformers are hard to train from scratch and the quadratic memory consumption w.r.t. the number of nodes. In this paper, we propose Graph Masked Autoencoders (GMAEs), a self-supervised transformer-based model for learning graph representations. To address the above two challenges, we adopt the masking mechanism and the asymmetric encoder-decoder design. Specifically, GMAE takes partially masked graphs as input, and reconstructs the features of the masked nodes. The encoder and decoder are asymmetric, where the encoder is a deep transformer and the decoder is a shallow transformer. The masking mechanism and the asymmetric design make GMAE a memory-efficient model compared with conventional transformers. We show that, when serving as a conventional self-supervised graph representation model, GMAE achieves state-of-the-art performance on both the graph classification task and the node classification task under common downstream evaluation protocols. We also show that, compared with training in an end-to-end manner from scratch, we can achieve comparable performance after pre-training and fine-tuning using GMAE while simplifying the training process. Copyright © 2022, The Authors. All rights reserved.

关键词： data mining

TradeFL: A Trading Mechanism for Cross-Silo Federated Learning

学校读者我要写书评

暂无评论

TradeFL: A Trading Mechanism for Cross-Silo Federated Learni...

International Conference on Distributed Computing Systems

作者： Shijing Yuan Hongtao Lv Hongze Liu Chentao Wu Song Guo Zhi Liu Hongyang Chen Jie Li Department of Computer Science and Engineering Shanghai Jiao Tong University China School of Software & Joint SDU-NTU Centre for Artificial Intelligence Research (C-FAIR) Shandong University Department of Computing The Hong Kong Polytechnic University Hong Kong The University of Electro-Communications Tokyo Japan Zhejiang Lab Research Center for Graph Computing China MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Yancheng Blockchain Research Institute China

Cross-silo federated learning (CFL) is a distributed learning paradigm that allows organizations (e.g., financial or medical entities) to train a global model on siloed data. Recent studies on mechanisms designed for CFL, however, rarely jointly consider the potential inter-organizational competition and the lack of credibility between organizations, which may discourage organizational participation. In this paper, we investigate the problem of inter-organizational competition and credibility assurance. We propose a distributed trading mechanism, called $TradeFL$ , to incentivize organizations to contribute data and computational resources through mutual trading among organizations. Technically, TradeFL characterizes the competition among organizations and compensates for their damage incurred by competition. TradeFL runs on distributed organizations and provides credibility guarantees for compensation through a customized smart contract 1 1 Illustration of the prototype: https://***/user10963.. We prove that the interaction among organizations that contribute resources to maximize personal payoffs is a weighted potential game. Then, we propose a centralized algorithm and a distributed algorithm to determine the optimal resource contribution. Simulation results and evaluations based on real-world datasets demonstrate that our scheme achieves higher social welfare, increases the amount of contributed data by up to 64%, and improves the accuracy of the global model by at most 23.2%.

关键词：

A Survey on Temporal Knowledge Graph Completion: Taxonomy, Progress, and Prospects

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Jiapu Wang, Boyue Qiu, Meikang Pan, Shirui Xiong, Bo Liu, Heng Luo, Linhao Liu, Tengfei Hu, Yongli Yin, Baocai Gao, Wen Beijing Municipal Key Lab of Multimedia and Intelligent Software Technology Beijing Artificial Intelligence Institute Faculty of Information Technology Beijing University of Technology Beijing100124 China The Beacom College of Computer and Cyber Sciences Dakota State University MadisonSD United States Griffith University QLD Australia The Department of Computer Science University of Stuttgart Stuttgart70569 Germany The Department of Data Science and AI Monash University Melbourne Australia The Institute of Digital Media Peking University Beijing100871 China The School of Electronic and Computer Engineering Peking University Shenzhen Graduate School Shenzhen518055 China

Temporal characteristics are prominently evident in a substantial volume of knowledge, which underscores the pivotal role of Temporal Knowledge Graphs (TKGs) in both academia and industry. However, TKGs often suffer from incompleteness for three main reasons: the continuous emergence of new knowledge, the weakness of the algorithm for extracting structured information from unstructured data, and the lack of information in the source dataset. Thus, the task of Temporal Knowledge Graph Completion (TKGC) has attracted increasing attention, aiming to predict missing items based on the available information. In this paper, we provide a comprehensive review of TKGC methods and their details. Specifically, this paper mainly consists of three components, namely, 1) Background, which covers the preliminaries of TKGC methods, loss functions required for training, as well as the dataset and evaluation protocol;2) Interpolation, that estimates and predicts the missing elements or set of elements through the relevant available information. It further categorizes related TKGC methods based on how to process temporal information;3) Extrapolation, which typically focuses on continuous TKGs and predicts future events, and then classifies all extrapolation methods based on the algorithms they utilize. We further pinpoint the challenges and discuss future research directions of TKGC. Copyright © 2023, The Authors. All rights reserved.

关键词： Interpolation

Cross Prompting Consistency with Segment Anything Model for Semi-supervised Medical Image Segmentation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Miao, Juzheng Chen, Cheng Zhang, Keli Chuai, Jie Li, Quanzheng Heng, Pheng-Ann Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Center for Advanced Medical Computing and Analysis Massachusetts General Hospital Harvard Medical School BostonMA United States Huawei Noah’s Ark Lab. Shenzhen China Data Science Office Massachusetts General Brigham BostonMA United States Institute of Medical Intelligence and XR The Chinese University of Hong Kong Hong Kong

Semi-supervised learning (SSL) has achieved notable progress in medical image segmentation. To achieve effective SSL, a model needs to be able to efficiently learn from limited labeled data and effectively exploit knowledge from abundant unlabeled data. Recent developments in visual foundation models, such as the Segment Anything Model (SAM), have demonstrated remarkable adaptability with improved sample efficiency. To harness the power of foundation models for application in SSL, we propose a cross prompting consistency method with segment anything model (CPC-SAM) for semi-supervised medical image segmentation. Our method employs SAM’s unique prompt design and innovates a cross-prompting strategy within a dual-branch framework to automatically generate prompts and supervisions across two decoder branches, enabling effectively learning from both scarce labeled and valuable unlabeled data. We further design a novel prompt consistency regularization, to reduce the prompt position sensitivity and to enhance the output invariance under different prompts. We validate our method on two medical image segmentation tasks. The extensive experiments with different labeled-data ratios and modalities demonstrate the superiority of our proposed method over the state-of-the-art SSL methods, with more than 9% Dice improvement on the breast cancer segmentation task. Code is available at: https://***/JuzhengMiao/CPC-SAM. © 2024, CC BY.

关键词： Image segmentation

Application of Kronecker convolutions in deep learning technique for automated detection of kidney stones with coronal CT images

学校读者我要写书评

暂无评论

Information sciences 2023年 640卷

作者： Patro, Kiran Kumar Allam, Jaya Prakash Neelapu, Bala Chakravarthy Tadeusiewicz, Ryszard Acharya, U Rajendra Hammad, Mohamed Yildirim, Ozal Plawiak, Pawel Department of Electronics and Communication Engineering Aditya Institute of Technology and Management AP Tekkali532201 India Department of Electronics and Communication Engineering National Institute of Technology Rourkela Odisha Rourkela769008 India Department of Biotechnology and Medical Engineering National Institute of Technology Rourkela Odisha Rourkela769008 India AGH University of Science and Technology Department of Biocybernetics and Biomedical Engineering Krakow Poland School of Mathematics Physics and Computing University of Southern Queensland Springfield Australia EIAS Data Science Lab College of Computer and Information Sciences Prince Sultan University Riyadh11586 Saudi Arabia Department of Information Technology Faculty of Computers and Information Menoufia University Shibin El Kom32511 Egypt Department of Software Engineering Firat University Elazig Turkey Department of Computer Science Faculty of Computer Science and Telecommunications Cracow University of Technology Warszawska 24 Krakow31-155 Poland Institute of Theoretical and Applied Informatics Polish Academy of Sciences Baltycka 5 Gliwice44-100 Poland

Kidney stone disease is a serious public health concern that is getting worse with changes in diet, obesity, medical conditions, certain supplements etc. A kidney stone also called a renal calculus, is a hard buildup of urine minerals that form in the kidneys. Computed tomography (CT) is one of the imaging models used to identify kidney stones by clinical experts. Due to the low resolution of these images, sometimes detecting kidney stones is tedious with the naked eye, which may lead to false alarms. In this work, a computer-based diagnosis system with a deep learning technique has been developed as a practical solution to aid clinicians in their diagnosis. The traditional convolutional neural network (CNN)-based deep learning technology can detect stones in the kidney. Still, it suffers from the performance and standard implementation of the convolution operations in convolution layers. A Kronecker product-based convolution technique is incorporated in the proposed deep learning architecture to reduce the redundancy in feature maps without convolution overlapping. Our proposed method helps to make the network more effective by extracting abstract and in-depth features from the input images. The publicly available GitHub kidney stone CT scans are utilized to develop the proposed architecture. Our automated model detected kidney stones with an accuracy of 98.56% utilizing CT images. Our system is more effective than the most recent and cutting-edge techniques developed for identifying kidney stones of any size, including the smallest ones. © 2023 The Author(s)

关键词： Convolution

AutoMix: Mixup Networks for Sample Interpolation via Cooperative Barycenter Learning 16th

学校读者我要写书评

暂无评论

AutoMix: Mixup Networks for Sample Interpolation via Coopera...

16th European Conference on computer Vision, ECCV 2020

作者： Zhu, Jianchao Shi, Liangliang Yan, Junchi Zha, Hongyuan School of Software Engineering East China Normal University Shanghai China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9783030586065

This paper proposes new ways of sample mixing by thinking of the process as generation of barycenter in a metric space for data augmentation. First, we present an optimal-transport-based mixup technique to generate Wasserstein barycenter which works well on images with clean background and is empirically shown complementary to existing mixup methods. Then we generalize mixup to an AutoMix technique by using a learnable network to fit barycenter in a cooperative way between the classifier (a.k.a. discriminator) and generator networks. Experimental results on both multi-class and multi-label prediction tasks show the efficacy of our approach, which is also verified in the presence of unseen categories (open set) and noise. © 2020, Springer Nature Switzerland AG.

关键词： Image classification

Awareness requirement and performance management for adaptive systems: a survey

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Rashid, Tarik A. Hassan, Bryar A. Alsadoon, Abeer Qader, Shko Vimal, S. Chhabra, Amit Yaseen, Zaher Mundher Computer Science and Engineering Department School of Science and Engineering University of Kurdistan Hewler Kurdistan Region Erbil Iraq Department of Information Technology Kurdistan Institution for Strategic Studies and Scientifc Research KRI Sulaymaniyah46001 Iraq School of Computing and Mathematics Charles Sturt University Sydney Australia School of Computing Engineering and Mathematics Western Sydney University Sydney City Campus Sydney Australia Sydney Australia Information Technology Department Kent Institute Australia Sydney Australia Department of Information Technology University College of Goizha Kurdistan Region Sulaimani Iraq Data Analytics Lab Department of Artifcial Intelligence and Data Science Ramco Institute of Technology North Venganallur Village Virudhunagar District Tamilnadu Rajapalayam626 117 India Department of Computer Engineering and Technology Guru Nanak Dev University Amritsar India Civil and Environmental Engineering Department King Fahd University of Petroleum & Minerals Dhahran31621 Saudi Arabia Department of Computer Science College of Science Charmo University KRI Chamchamal46023 Iraq Department of Information Technology Computer Science Institute Sulaimani Polytechnic University KRI Sulaymaniyah46001 Iraq

Self-adaptive software can assess and modify its behavior when the assessment indicates that the program is not performing as intended or when improved functionality or performance is available. Since the mid-1960s, the subject of system adaptivity has been extensively researched, and during the last decade, many application areas and technologies involving self-adaptation have gained prominence. All of these efforts have in common the introduction of self-adaptability through software. Thus, it is essential to investigate systematic software engineering methods to create self-adaptive systems that may be used across different domains. The primary objective of this research is to summarize current advances in awareness requirements for adaptive strategies based on an examination of state-of-the-art methods described in the literature. This paper presents a review of self-adaptive systems in the context of requirement awareness and summarizes the most common methodologies applied. At first glance, it gives a review of the previous surveys and works about self-adaptive systems. Afterward, it classifies the current self-adaptive systems based on six criteria. Then, it presents and evaluates the most common self-adaptive approaches. Lastly, an evaluation among the self-adaptive models is conducted based on four concepts (requirements description, monitoring, relationship, dependency/impact, and tools). © 2023, CC BY-NC-ND.

关键词： Adaptive systems

Unsupervised Social Bot Detection via Structural Information Theory

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Peng, Hao Zhang, Jingyun Huang, Xiang Hao, Zhifeng Li, Angsheng Yu, Zhengtao Yu, Philip S. School of Cyber Science and Technology Beihang University No. 37 Xue Yuan Road Haidian District Beijing100191 China State Key Laboratory of Public Big Data Guizhou University No. 2708 South Section of Huaxi Avenue Huaxi District Guizhou Province Guiyang City550025 China Guangxi Key Lab of Multi-source Information Mining & Security Guangxi Normal University Guilin541004 China Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Kunming650500 China College of Science University of Shantou No. 243 University Road Shantou515063 China School of Computer Science and Engineering Beihang University No. 37 Xue Yuan Road Haidian District Beijing100191 China Faculty of Information Engineering and Automation Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Kunming650500 China Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States

Research on social bot detection plays a crucial role in maintaining the order and reliability of information dissemination while increasing trust in social interactions. The current mainstream social bot detection models rely on black-box neural network technology, e.g., Graph Neural Network, Transformer, etc., which lacks interpretability. In this work, we present UnDBot, a novel unsupervised, interpretable, yet effective and practical framework for detecting social bots. This framework is built upon structural information theory. We begin by designing three social relationship metrics that capture various aspects of social bot behaviors: Posting Type Distribution, Posting Influence, and Follow-to-follower Ratio. Three new relationships are utilized to construct a new, unified, and weighted social multi-relational graph, aiming to model the relevance of social user behaviors and discover long-distance correlations between users. Second, we introduce a novel method for optimizing heterogeneous structural entropy. This method involves the personalized aggregation of edge information from the social multi-relational graph to generate a two-dimensional encoding tree. The heterogeneous structural entropy facilitates decoding of the substantial structure of the social bots network and enables hierarchical clustering of social bots. Thirdly, a new community labeling method is presented to distinguish social bot communities by computing the user's stationary distribution, measuring user contributions to network structure, and counting the intensity of user aggregation within the community. Compared with ten representative social bot detection approaches, comprehensive experiments demonstrate the advantages of effectiveness and interpretability of UnDBot on four real social network datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Information theory