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

Few-Shot Medical Image Segmentation with High-Fidelity Prototypes

学校读者我要写书评

暂无评论

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

Graph Representation Learning for Popularity Prediction Problem: A Survey

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chen, Tiantian Guo, Jianxiong Wu, Weili Department of Computer Science University of Texas at Dallas 800 W Campbell Rd RichardsonTX75080 United States Advanced Institute of Natural Sciences Beijing Normal University Zhuhai519087 China Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College Zhuhai519087 China

The online social platforms, like Twitter, Facebook, LinkedIn and WeChat, have grown really fast in last decade and have been one of the most effective platforms for people to communicate and share information with each other. Due to the "word-of-mouth" effects, information usually can spread rapidly on these social media platforms. Therefore, it is important to study the mechanisms driving the information diffusion and quantify the consequence of information spread. A lot of efforts have been focused on this problem to help us better understand and achieve higher performance in viral marketing and advertising. On the other hand, the development of neural networks has blossomed in the last few years, leading to a large number of graph representation learning (GRL) models. Compared with traditional models, GRL methods are often shown to be more effective. In this paper, we present a comprehensive review for recent works leveraging GRL methods for popularity prediction problem, and categorize related literatures into two big classes, according to their mainly used model and techniques: embedding-based methods and deep learning methods. Deep learning method is further classified into convolutional neural networks, graph convolutional networks, graph attention networks, graph neural networks, recurrent neural networks, and reinforcement learning. We compare the performance of these different models and discuss their strengths and limitations. Finally, we outline the challenges and future chances for popularity prediction problem. Copyright © 2022, The Authors. All rights reserved.

关键词： Recurrent neural networks

Composite Community-Aware Diversified Influence Maximization with Efficient Approximation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Guo, Jianxiong Ni, Qiufen Wu, Weili Du, Ding-Zhu The Advanced Institute of Natural Sciences Beijing Normal University Zhuhai519087 China The Guangdong Key Lab of AI and Multi-Modal Data Processing BNU-HKBU United International College Zhuhai519087 China The School of Computers Guangdong University of Technology Guangzhou510006 China The Department of Computer Science Erik Jonsson School of Engineering and Computer Science The University of Texas at Dallas RichardsonTX75080 United States

Influence Maximization (IM) is a famous topic in mobile networks and social computing, which aims at finding a small subset of users to maximize the influence spread through online information cascade. Recently, some careful researchers paid attention to diversity of information dissemination, especially community-aware diversity, and formulated the diversified IM problem. The diversity is ubiquitous in a lot of real-world applications, but they are all based on a given community structure. In social networks, we can form heterogeneous community structures for the same group of users according to different metrics. Therefore, how to quantify the diversity based on multiple community structures is an interesting question. In this paper, we propose the Composite Community-Aware Diversified IM (CC-DIM) problem, which aims at selecting a seed set to maximize the influence spread and the composite diversity over all possible community structures under consideration. To address the NP-hardness of CC-DIM problem, we adopt the technique of reverse influence sampling and design a random Generalized Reverse Reachable (G-RR) set to estimate the objective function. The composition of a random G-RR set is much more complex than the RR set used for the IM problem, which will lead to inefficiency of traditional sampling-based approximation algorithms. Because of this, we further propose a two-stage algorithm, Generalized HIST (G-HIST). It can not only return a (1 − 1/e − Ε) approximate solution with at least (1 − δ) probability, but also improve the efficiency of sampling and ease the difficulty of searching by significantly reducing the average size of G-RR sets. Finally, we evaluate our G-HIST on real datasets against existing algorithms. The experimental results show the effectiveness of our proposed algorithm and its superiority over other baseline algorithms. Copyright © 2022, The Authors. All rights reserved.

关键词： Approximation algorithms

Permutation polynomials x~(2k+1+3)+ax2k+2+bx over F_(22k) and their differential uniformity

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2020年第10期63卷 255-257页

作者： Jie PENG Lijing ZHENG Chunsheng WU Haibin KAN Mathematics and Science College Shanghai Normal University School of Mathematics and Physics University of South China Department of Mathematics Lianyungang Normal University Shanghai Key Laboratory of Intelligent Information Processing School of Computer ScienceFudan University Fudan-Zhongan Joint Laboratory of Blockchain and Information Security Shanghai Blockchain Engineering Research Center Shanghai Institute for Advanced Communication and Data Science Shanghai Institute of Intelligent Electronics & Systems

Dear editor,A polynomial f（x）∈Fq[x] is called a permutation polynomial （PP） over the finite field Fq if the associated mapping f:c （?） f（c） from Fq to itself is bijective.A PP f is called a complete permutation polynomial if f（x）+x is a *** over finite fields of even characteristic have wide applications,including cryptography,coding theory,and communication *** many block ciphers with substitution-permutation network structure,the substitution box is usually a PP over F_(22k)for some positive integer *** resist the differential attacks,the differential uniformity of this

关键词： Finite fields Permutation polynomial Binomial Trinomial Differential uniformity

Neural multi-objective combinatorial optimization with diversity enhancement 23

学校读者我要写书评

暂无评论

Neural multi-objective combinatorial optimization with diver...

Proceedings of the 37th International Conference on Neural Information processing Systems

作者： Jinbiao Chen Zizhen Zhang Zhiguang Cao Yaoxin Wu Yining Ma Te Ye Jiahai Wang School of Computer Science and Engineering Sun Yat-sen University P.R. China School of Computing and Information Systems Singapore Management University Singapore Department of Industrial Engineering & Innovation Sciences Eindhoven University of Technology Netherlands Department of Industrial Systems Engineering & Management National University of Singapore Singapore School of Computer Science and Engineering Sun Yat-sen University P.R. China and Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Sun Yat-sen University P.R. China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou P.R. China

关键词：

PWG-IDS: An intrusion detection model for solving class imbalance in IIoT networks using generative adversarial networks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhang, Lei Jiang, Shuaimin Shen, Xiajiong Gupta, Brij B. Tian, Zhihong Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng47500 China Institute of Data and Knowledge Engineering Henan University Kaifeng47500 China School of Computer and Information Engineering Henan University Kaifeng47500 China National Institute of Technology Kurukshetra India Asia University Taichung Taiwan The Department of Cyberspace Insitute of Advanced Technology GuangZhou University GuangZhou510006 China

With the continuous development of industrial IoT (IIoT) technology, network security is becoming more and more important. And intrusion detection is an important part of its security. However, since the amount of attack traffic is very small compared to normal traffic, this imbalance makes intrusion detection in it very difficult. To address this imbalance, an intrusion detection system called pretraining Wasserstein generative adversarial network intrusion detection system (PWG-IDS) is proposed in this paper. This system is divided into two main modules: 1) In this module, we introduce the pretraining mechanism in the Wasserstein generative adversarial network with gradient penalty (WGAN-GP) for the first time, firstly using the normal network traffic to train the WGAN-GP, and then inputting the imbalance data into the pre-trained WGAN-GP to retrain and generate the final required data. 2) Intrusion detection module: We use LightGBM as the classification algorithm to detect attack traffic in IIoT networks. The experimental results show that our proposed PWG-IDS outperforms other models, with F1-scores of 99% and 89% on the 2 datasets, respectively. And the pretraining mechanism we proposed can also be widely used in other GANs, providing a new way of thinking for the training of GANs. Copyright © 2021, The Authors. All rights reserved.

关键词： Intrusion detection

Unsupervised hashing with contrastive information bottleneck

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Qiu, Zexuan Su, Qinliang Ou, Zijing Yu, Jianxing Chen, Changyou School of Computer Science and Engineering Sun Yat-sen University Guangzhou China School of Artificial Intelligence Sun Yat-sen University Guangdong China CSE Department SUNY at Buffalo Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

Many unsupervised hashing methods are implicitly established on the idea of reconstructing the input data, which basically encourages the hashing codes to retain as much information of original data as possible. However, this requirement may force the models spending lots of their effort on reconstructing the unuseful background information, while ignoring to preserve the discriminative semantic information that is more important for the hashing task. To tackle this problem, inspired by the recent success of contrastive learning in learning continuous representations, we propose to adapt this framework to learn binary hashing codes. Specifically, we first propose to modify the objective function to meet the specific requirement of hashing and then introduce a probabilistic binary representation layer into the model to facilitate end-to-end training of the entire model. We further prove the strong connection between the proposed contrastive-learning-based hashing method and the mutual information, and show that the proposed model can be considered under the broader framework of the information bottleneck (IB). Under this perspective, a more general hashing model is naturally obtained. Extensive experimental results on three benchmark image datasets demonstrate that the proposed hashing method significantly outperforms existing baselines. © 2021, CC BY.

关键词： Semantics

MIPI 2022 Challenge on Under-Display Camera Image Restoration: Methods and Results 17th

学校读者我要写书评

暂无评论

MIPI 2022 Challenge on Under-Display Camera Image Restorati...

17th European Conference on computer vision, ECCV 2022

作者： Feng, Ruicheng Li, Chongyi Zhou, Shangchen Sun, Wenxiu Zhu, Qingpeng Jiang, Jun Yang, Qingyu Loy, Chen Change Gu, Jinwei Zhu, Yurui Wang, Xi Fu, Xueyang Hu, Xiaowei Hu, Jinfan Liu, Xina Chen, Xiangyu Dong, Chao Zhang, Dafeng Huang, Feiyu Liu, Shizhuo Wang, Xiaobing Jin, Zhezhu Jiang, Xuhao Shao, Guangqi Wang, Xiaotao Lei, Lei Zhang, Zhao Zhao, Suiyi Zheng, Huan Gao, Yangcheng Wei, Yanyan Ren, Jiahuan Huang, Tao Fang, Zhenxuan Huang, Mengluan Xu, Junwei Zhang, Yong Yang, Yuechi Shu, Qidi Yang, Zhiwen Li, Shaocong Yao, Mingde Xu, Ruikang Guan, Yuanshen Huang, Jie Xiong, Zhiwei Zhu, Hangyan Liu, Ming Liu, Shaohui Zuo, Wangmeng Jia, Zhuang Song, Binbin Song, Ziqi Mao, Guiting Hou, Ben Liu, Zhimou Ke, Yi Ouyang, Dengpei Han, Dekui Zhang, Jinghao Zhu, Qi Zheng, Naishan Zhao, Feng Jin, Wu Conde, Marcos Nathan, Sabari Timofte, Radu Xu, Tianyi Xu, Jun Hrishikesh, P.S. Puthussery, Densen Jiji, C.V. Jiang, Biao Ding, Yuhan Li, WanZhang Feng, Xiaoyue Chen, Sijing Zhong, Tianheng Lu, Jiyang Chen, Hongming Fan, Zhentao Chen, Xiang Nanyang Technological University Singapore Singapore SenseBrain San Jose United States Shanghai AI Laboratory Shanghai China SenseTime Research and Tetras.AI Beijing China University of Science and Technology of China Hefei China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China Samsung Research China Beijing China Xiaomi Beijing China Hefei University of Technology Hefei China School of Artificial Intelligence Xidian University Xi’an China School of Remote Sensing and Information Engineering Wuhan University Wuhan China State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan China Harbin Institute of Technology Harbin China University of Macau China Changsha Research Institute of Mining and Metallurgy Changsha China Tianjin University Tianjin China Computer Vision Lab University of Wurzburg Würzburg Germany Couger Inc. Tokyo Japan School of Statistics and Data Science Nankai University Tianjin China Founding Minds Software Thiruvananthapuram India Department of Electronics and Communication SRM University AP Amaravati India Fudan University Shanghai China Shenyang Aerospace University Shenyang China Nanjing University of Science and Technology Nanjing China

ISBN: (纸本)9783031250712

Developing and integrating advanced image sensors with novel algorithms in camera systems is prevalent with the increasing demand for computational photography and imaging on mobile platforms. However, the lack of high-quality data for research and the rare opportunity for in-depth exchange of views from industry and academia constrain the development of mobile intelligent photography and imaging (MIPI). To bridge the gap, we introduce the first MIPI challenge including five tracks focusing on novel image sensors and imaging algorithms. In this paper, we summarize and review the Under-Display Camera (UDC) Image Restoration track on MIPI 2022. In total, 167 participants were successfully registered, and 19 teams submitted results in the final testing phase. The developed solutions in this challenge achieved state-of-the-art performance on Under-Display Camera Image Restoration. A detailed description of all models developed in this challenge is provided in this paper. More details of this challenge and the link to the dataset can be found at https://***/mipi-challenge/MIPI2022. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Image reconstruction

Efficient MedSAMs: Segment Anything in Medical Images on Laptop

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ma, Jun Li, Feifei Kim, Sumin Asakereh, Reza Le, Bao-Hiep Nguyen-Vu, Dang-Khoa Pfefferle, Alexander Wei, Muxin Gao, Ruochen Lyu, Donghang Yang, Songxiao Purucker, Lennart Marinov, Zdravko Staring, Marius Lu, Haisheng Dao, Thuy Thanh Ye, Xincheng Li, Zhi Brugnara, Gianluca Vollmuth, Philipp Foltyn-Dumitru, Martha Cho, Jaeyoung Mahmutoglu, Mustafa Ahmed Bendszus, Martin Pflüger, Irada Rastogi, Aditya Ni, Dong Yang, Xin Zhou, Guang-Quan Wang, Kaini Heller, Nicholas Papanikolopoulos, Nikolaos Weight, Christopher Tong, Yubing Udupa, Jayaram K. Patrick, Cahill J. Wang, Yaqi Zhang, Yifan Contijoch, Francisco McVeigh, Elliot Ye, Xin He, Shucheng Haase, Robert Pinetz, Thomas Radbruch, Alexander Krause, Inga Kobler, Erich He, Jian Tang, Yucheng Yang, Haichun Huo, Yuankai Luo, Gongning Kushibar, Kaisar Amankulov, Jandos Toleshbayev, Dias Mukhamejan, Amangeldi Egger, Jan Pepe, Antonio Gsaxner, Christina Luijten, Gijs Fujita, Shohei Kikuchi, Tomohiro Wiestler, Benedikt Kirschke, Jan S. de la Rosa, Ezequiel Bolelli, Federico Lumetti, Luca Grana, Costantino Xie, Kunpeng Wu, Guomin Puladi, Behrus Martín-Isla, Carlos Lekadir, Karim Campello, Victor M. Shao, Wei Brisbane, Wayne Jiang, Hongxu Wei, Hao Yuan, Wu Li, Shuangle Zhou, Yuyin Wang, Bo AI Collaborative Centre University Health Network Department of Laboratory Medicine and Pathobiology University of Toronto Vector Institute Toronto Canada Peter Munk Cardiac Centre University Health Network Toronto Canada Toronto General Hospital Research Institute University Health Network Department of Computer Science University of Toronto University Health Network Vector Institute Toronto Canada University of Science Vietnam National University Ho Chi Minh City Viet Nam Institute of Computer Science University of Freiburg Freiburg Germany School of Medicine and Health Harbin Institute of Technology Harbin China Division of Image Processing Department of Radiology Leiden University Medical Center Leiden Netherlands Department of System and Control Engineering School of Engineering Institute of Science Tokyo Formerly Tokyo Institute of Technology Tokyo Japan Institute for Anthropomatics and Robotics Karlsruhe Institute of Technology Karlsruhe Germany School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China School of Electrical Engineering and Computer Science University of Queensland Brisbane Australia School of Cyberspace Hangzhou Dianzi University Hangzhou China Division for Computational Radiology and Clinical AI The Department of Neuroradiology University Hospital Bonn Germany Division for Computational Radiology and Clinical AI The Department of Neuroradiology University Hospital Bonn Germany Department of Neuroradiology Heidelberg University Hospital Heidelberg Germany Division for Computational Radiology and Clinical AI Department of Neuroradiology University Hospital Bonn Germany School of Biomedical Engineering Shenzhen University Shenzhen China School of Biological Science and Medical Engineering Southeast University Nanjing China Department of Urology Cleveland Clinic Cleveland United States Department of Computer Science University of Minnesota Minneapolis United St

Promptable segmentation foundation models have emerged as a transformative approach to addressing the diverse needs in medical images, but most existing models require expensive computing, posing a big barrier to their adoption in clinical practice. In this work, we organized the first international competition dedicated to promptable medical image segmentation, featuring a large-scale dataset spanning nine common imaging modalities from over 20 different institutions. The top teams developed lightweight segmentation foundation models and implemented an efficient inference pipeline that substantially reduced computational requirements while maintaining state-of-the-art segmentation accuracy. Moreover, the post-challenge phase advanced the algorithms through the design of performance booster and reproducibility tasks, resulting in improved algorithms and validated reproducibility of the winning solution. Furthermore, the best-performing algorithms have been incorporated into the open-source software with a user-friendly interface to facilitate clinical adoption. The data and code are publicly available to foster the further development of medical image segmentation foundation models and pave the way for impactful real-world applications. © 2024, CC BY-NC-SA.

关键词： Open source software