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

arXiv 2024年

作者： Liu, Hongzhi Li, Guicheng Nie, Jiacheng Tang, Hui Yang, Chunfeng Feng, Qianjin Xu, Hailin Chen, Yang The School of Computer Science and Engineering Southeast University Nanjing210096 China The Peking University People's Hospital Beijing100000 China The Guangdong Provincial Key Laboratory of Medical Image Processing School of Biomedical Engineering Southern Medical University Guangzhou510515 China The Key Laboratory of New Generation Artificial Intelligence Technology and its Interdisciplinary Applications Southeast University Ministry of Education China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing School of Computer Science and Engineering Southeast University Nanjing210096 China Jiangsu Key Laboratory of Molecular and Functional Imaging Department of Radiology Zhongda Hospital Southeast University Nanjing210009 China

Because of the complicated mechanism of ankle injury, it is very difficult to diagnose ankle fracture in clinic. In order to simplify the process of fracture diagnosis, an automatic diagnosis model of ankle fracture was proposed. Firstly, a tibia-fibula segmentation network is proposed for the joint tibiofibular region of the ankle joint, and the corresponding segmentation dataset is established on the basis of fracture data. Secondly, the image registration method is used to register the bone segmentation mask with the normal bone mask. Finally, a semi-supervised classifier is constructed to make full use of a large number of unlabeled data to classify ankle fractures. Experiments show that the proposed method can segment fractures with fracture lines accurately and has better performance than the general method. At the same time, this method is superior to classification network in several indexes. Copyright © 2024, The Authors. All rights reserved.

关键词： image classification

来源：评论

学校读者我要写书评

暂无评论

BGTplanner: Maximizing Training Accuracy for Differentially Private Federated Recommenders via Strategic Privacy Budget Allocation

arXiv

引用

arXiv 2024年

作者： Zhang, Xianzhi Zhou, Yipeng Hu, Miao Wu, Di Liao, Pengshan Guizani, Mohsen Sheng, Michael The School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China The Department of Computing Faculty of Science and Engineering Macquarie University Sydney Australia The Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence Abu Dhabi United Arab Emirates

To mitigate the rising concern about privacy leakage, the federated recommender (FR) paradigm emerges, in which decentralized clients co-train the recommendation model without exposing their raw user-item rating data. The differentially private federated recommender (DPFR) further enhances FR by injecting differentially private (DP) noises into clients. Yet, current DPFRs, suffering from noise distortion, cannot achieve satisfactory accuracy. Various efforts have been dedicated to improving DPFRs by adaptively allocating the privacy budget over the learning process. However, due to the intricate relation between privacy budget allocation and model accuracy, existing works are still far from maximizing DPFR accuracy. To address this challenge, we develop BGTplanner (Budget Planner) to strategically allocate the privacy budget for each round of DPFR training, improving overall training performance. Specifically, we leverage the Gaussian process regression and historical information to predict the change in recommendation accuracy with a certain allocated privacy budget. Additionally, Contextual Multi-Armed Bandit (CMAB) is harnessed to make privacy budget allocation decisions by reconciling the current improvement and long-term privacy constraints. Our extensive experimental results on real datasets demonstrate that BGTplanner achieves an average improvement of 6.76% in training performance compared to state-of-the-art baselines. Copyright © 2024, The Authors. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Cone-Beam Computed Tomography Limited-Angle image Reconstruction Using Planning CT-Guided Deep Diffusion Model

引用

IEEE Transactions on Instrumentation and Measurement 2025年 74卷

作者： Wu, Zhan Yang, Yang Hu, Dianlin Lyu, Tianling Li, Yinsheng Tang, Hao Shu, Huazhong Xi, Yan Zhang, Yi Chen, Yang Southeast University Laboratory of Image Science and Technology Nanjing210096 China Southeast University Ministry of Education Key Laboratory of Computer Network and Information Integration Nanjing210096 China Zhejiang University of Technology Academy for Advanced Interdisciplinary Science and Technology Hangzhou China Chinese Academy of Sciences Key Laboratory of Biomedical Imaging Science and System China Capital Medical University Beijing Jishuitan Hospital China First-Imaging Tech Shanghai China Sichuan University School of Cyber Science and Engineering Chengdu China Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing Laboratory of Image Science and Technology the School of Computer Science and Engineering Nanjing210096 China

For existing image-guided radiation therapy systems (IGRT), the limited angular range of the cone-beam computed tomography (CBCT) scanning improves the compactness of the system and compatibility between CBCT and linear accelerator configurations. However, the limited-angle CBCT reconstruction under incomplete projection data causes severe artifacts in the reconstructed images, further having a negative impact on the registration accuracy in IGRT. In this paper, we propose a planning CT-guided deep diffusion model, termed LARGE-DiffNet, to improve imaging quality and registration accuracy for limited-angle CBCT image reconstruction. In stark contrast to existing approaches leveraging hand-crafted regularization, such as local smoothness and/or sparsity of the image, LARGE-DiffNet learns the distribution-level prior knowledge to describe the features of ideal CBCT images via a planning CT-guided diffusion model. The proposed LARGE-DiffNet is evaluated on the clinical CBCT dataset, and extensive experimental results demonstrate that the proposed method outperforms the state-of-the-art methods. The proposed LARGE-DiffNet technique has great potential in IGRT. © 1963-2012 IEEE.

关键词： cone-beam computed tomography deep learning diffusion model image registration image-guided radiation therapy limited-angle

来源：评论

学校读者我要写书评

暂无评论

Learning from Untrimmed Videos: Self-Supervised Video Representation Learning with Hierarchical Consistency

arXiv

引用

arXiv 2022年

作者： Qing, Zhiwu Zhang, Shiwei Huang, Ziyuan Xu, Yi Wang, Xiang Tang, Mingqian Gao, Changxin Jin, Rong Sang, Nong Key Laboratory of Image Processing Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Alibaba Group China ARC National University of Singapore Singapore Dalian Unversity of Technology China

Natural videos provide rich visual contents for self-supervised learning. Yet most existing approaches for learning spatio-temporal representations rely on manually trimmed videos, leading to limited diversity in visual patterns and limited performance gain. In this work, we aim to learn representations by leveraging more abundant information in untrimmed videos. To this end, we propose to learn a hierarchy of consistencies in videos, i.e., visual consistency and topical consistency, corresponding respectively to clip pairs that tend to be visually similar when separated by a short time span and share similar topics when separated by a long time span. Specifically, a hierarchical consistency learning framework HiCo is presented, where the visually consistent pairs are encouraged to have the same representation through contrastive learning, while the topically consistent pairs are coupled through a topical classifier that distinguishes whether they are topic-related. Further, we impose a gradual sampling algorithm for proposed hierarchical consistency learning, and demonstrate its theoretical superiority. Empirically, we show that not only HiCo can generate stronger representations on untrimmed videos, it also improves the representation quality when applied to trimmed videos. This is in contrast to standard contrastive learning that fails to learn appropriate representations from untrimmed videos. Copyright © 2022, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms

引用

IEEE/CAA Journal of Automatica Sinica 2020年第4期7卷 1134-1153页

作者： Jiahai Wang Yuyan Sun Zizhen Zhang Shangce Gao the Department of Computer Science and also with the Key Laboratory of Machine Intelligence and Advanced ComputingMinistry of Educationand also with the Guangdong Key Laboratory of Big Data Analysis and ProcessingSun Yat-sen UniversityGuangzhou 510275China the Department of Computer Science Sun Yat-sen UniversityGuangzhou 510275China the Faculty of Engineering University of ToyamaToyama-shi 930-8555Japan

The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.

关键词： Adaptive neighborhood selection manpower planning multiobjective optimization multitrip pickup and delivery problem with time windows

来源：评论

学校读者我要写书评

暂无评论

Modeling Inter-Intra Heterogeneity for Graph Federated Learning 39

Modeling Inter-Intra Heterogeneity for Graph Federated Learn...

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Yu, Wentao Chen, Shuo Tong, Yongxin Gu, Tianlong Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Center for Advanced Intelligence Project RIKEN Japan State Key Laboratory of Complex & Critical Software Environment Beihang University China Engineering Research Center of Trustworthy AI Ministry of Education Jinan University China Department of Automation Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

ISBN: (纸本)157735897X

Heterogeneity is a fundamental and challenging issue in federated learning, especially for the graph data due to the complex relationships among the graph nodes. To deal with the heterogeneity, lots of existing methods perform the weighted federation based on their calculated similarities between pairwise clients (i.e., subgraphs). However, their inter-subgraph similarities estimated with the outputs of local models are less reliable, because the final outputs of local models may not comprehensively represent the real distribution of subgraph data. In addition, they ignore the critical intra-heterogeneity which usually exists within each subgraph itself. To address these issues, we propose a novel Federated learning method by integrally modeling the Inter-Intra Heterogeneity (FedIIH). For the inter-subgraph relationship, we propose a novel hierarchical variational model to infer the whole distribution of subgraph data in a multi-level form, so that we can accurately characterize the inter-subgraph similarities with the global perspective. For the intra-heterogeneity, we disentangle the subgraph into multiple latent factors and partition the model parameters into multiple parts, where each part corresponds to a single latent factor. Our FedIIH not only properly computes the distribution similarities between subgraphs, but also learns disentangled representations that are robust to irrelevant factors within subgraphs, so that it successfully considers the inter- and intra- heterogeneity simultaneously. Extensive experiments on six homophilic and five heterophilic graph datasets in both non-overlapping and overlapping settings demonstrate the effectiveness of our method when compared with nine state-of-the-art methods. Specifically, FedIIH averagely outperforms the second-best method by a large margin of 5.79% on all heterophilic datasets. Copyright © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Prognostic Prediction for Non-small-Cell Lung Cancer Based on Deep Neural Network and Multimodal Data 17th

Prognostic Prediction for Non-small-Cell Lung Cancer Based o...

引用

17th International Conference on Intelligent Computing, ICIC 2021

作者： Zhang, Zhong-Si Xu, Fei Jiang, Han-Jing Chen, Zhan-Heng Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Institute of Machine Learning and Systems Biology School of Electronics and Information Engineering Tongji University No. 4800 Caoan Road Shanghai201804 China

ISBN: (纸本)9783030845315

Non-small-cell lung cancer (NSCLC) is the most common lung cancer with poor prognosis. Prognostic prediction is significant in improving the prognosis of NSCLC patients. Clinical information and multi-omics data including gene expression, miRNA, copy number variations, and DNA methylation are closely related to NSCLC prognosis. In this study, we propose a deep neural network to conduct prognostic prediction for NSCLC patients based on all five types of data. Given the high dimensional features of the omics data, past works reduce the feature dimension by regression analysis or correlation sorting algorithms. A shortcoming of these methods is that only a small number of features are considered. To overcome it, we propose a convolution neural network-based feature transformation method, which considers all features and extracts the abstract representations of the omics data. Based on the representations, we predict the five-year survival status of NSCLC patients. The results show that our method achieves a more precise prediction than previous work, with the areas under the curve improved from 0.8163 to 0.8508 and the accuracy improved from 0.7544 to 0.8096. © 2021, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Discovery of Stochastic Differential Equations

引用

Engineering 2022年第10期17卷 244-252页

作者： Yasen Wang Huazhen Fang Junyang Jin Guijun Ma Xin He Xing Dai Zuogong Yue Cheng Cheng Hai-Tao Zhang Donglin Pu Dongrui Wu Ye Yuan Jorge Gonçalves Jürgen Kurths Han Ding School of Mechanical Science and Engineering Huazhong University of Science and TechnologyWuhan 430074China State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and TechnologyWuhan 430074China Department of Mechanical Engineering University of KansasLawrenceKS 66045USA HUST-Wuxi Research Institute Wuxi 214174China Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and AutomationHuazhong University of Science and TechnologyWuhan 430074China Department of Plant Sciences University of CambridgeCambridge CB23EAUK Luxembourg Centre for Systems Biomedicine University of LuxembourgBelvaux 4367Luxembourg Department of Physics Humboldt University of BerlinBerlin 12489Germany Department of Complexity Science Potsdam Institute for Climate Impact ResearchPotsdam 14473Germany

Stochastic differential equations(SDEs)are mathematical models that are widely used to describe complex processes or phenomena perturbed by random noise from different *** identification of SDEs governing a system is often a challenge because of the inherent strong stochasticity of data and the complexity of the system’s *** practical utility of existing parametric approaches for identifying SDEs is usually limited by insufficient data *** study presents a novel framework for identifying SDEs by leveraging the sparse Bayesian learning(SBL)technique to search for a parsimonious,yet physically necessary representation from the space of candidate basis *** importantly,we use the analytical tractability of SBL to develop an efficient way to formulate the linear regression problem for the discovery of SDEs that requires considerably less time-series *** effectiveness of the proposed framework is demonstrated using real data on stock and oil prices,bearing variation,and wind speed,as well as simulated data on well-known stochastic dynamical systems,including the generalized Wiener process and Langevin *** framework aims to assist specialists in extracting stochastic mathematical models from random phenomena in the natural sciences,economics,and engineering fields for analysis,prediction,and decision making.

关键词： Data-driven method System identification Sparse Bayesian learning Stochastic differential equations Random phenomena

来源：评论

学校读者我要写书评

暂无评论

Prediction of Drug-Disease Associations Based on Long Short-Term Memory Network and Gaussian Interaction Profile Kernel 15th

Prediction of Drug-Disease Associations Based on Long Short-...

引用

15th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2020

作者： Jiang, Han-Jing Wang, Yan-Bin Huang, Yabing Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China College of Computer Science and Technology Zhejiang University Hangzhou315000 China Department of Pathology Renmin Hospital of Wuhan University Wuhan430060 China

ISBN: (纸本)9789811613531

Drug-disease association depicts the accessibility landscape of the association at the molecular level, thereby revealing the intermolecular reaction in the process of drug reposition. However, the scarcity of drug-disease association data often complicates the drug reposition. In this work, we present a method for predicting drug-disease association, which is called drug-disease association prediction via Gaussian interaction profile kernel and long short-term memory network (G-LSTM). G-LSTM combines a recurrent network framework with a Gaussian interaction profile kernel to learn underlying features that accurately characterize drug-disease-association data. We have verified G-LSTM models on the two benchmark datasets Fdataset and Cdataset, respectively. The experimental results show that the predictive performance was significantly improved, with AUC of 0.9527 and 0.9705, respectively. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

CondNet: Conditional classifier for scene segmentation

arXiv

引用

arXiv 2021年

作者： Yu, Changqian Shao, Yuanjie Gao, Changxin Sang, Nong Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

—The fully convolutional network (FCN) has achieved tremendous success in dense visual recognition tasks, such as scene segmentation. The last layer of FCN is typically a global classifier (1×1 convolution) to recognize each pixel to a semantic label. We empirically show that this global classifier, ignoring the intra-class distinction, may lead to sub-optimal results. In this work, we present a conditional classifier to replace the traditional global classifier, where the kernels of the classifier are generated dynamically conditioned on the input. The main advantages of the new classifier consist of: (i) it attends on the intra-class distinction, leading to stronger dense recognition capability;(ii) the conditional classifier is simple and flexible to be integrated into almost arbitrary FCN architectures to improve the prediction. Extensive experiments demonstrate that the proposed classifier performs favourably against the traditional classifier on the FCN architecture. The framework equipped with the conditional classifier (called CondNet) achieves new state-of-the-art performances on two datasets. The code and models are available at https://***/CondNet. Copyright © 2021, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：