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

ASRNet: Adversarial Segmentation and Registration Networks for Multispectral Fundus Images

Computer Systems Science & Engineering 2021年第3期36卷 537-549页

作者： Yanyun Jiang Yuanjie Zheng Xiaodan Sui Wanzhen Jiao Yunlong He Weikuan Jia School of Information Science and Engineering Shandong Normal UniversityJinan250358China Key Laboratory of Intelligent Computing&Information Security in Universities of Shandong Shandong Provincial Key Laboratory for Novel Distributed Computer Software TechnologyInstitute of Biomedical SciencesShandong Normal UniversityJinan250358China Shandong Provincial Hospital Affiliated to Shandong University Jinan250021China INSA Lyon University of LyonCNRSInsermVilleurbanne69621CedexFrance

Multispectral imaging (MSI) technique is often used to capture imagesof the fundus by illuminating it with different wavelengths of light. However,these images are taken at different points in time such that eyeball movementscan cause misalignment between consecutive images. The multispectral imagesequence reveals important information in the form of retinal and choroidal bloodvessel maps, which can help ophthalmologists to analyze the morphology of theseblood vessels in detail. This in turn can lead to a high diagnostic accuracy of several diseases. In this paper, we propose a novel semi-supervised end-to-end deeplearning framework called “Adversarial Segmentation and Registration Nets”(ASRNet) for the simultaneous estimation of the blood vessel segmentation andthe registration of multispectral images via an adversarial learning process. ASRNet consists of two subnetworks: (i) A segmentation module S that fulfills theblood vessel segmentation task, and (ii) A registration module R that estimatesthe spatial correspondence of an image pair. Based on the segmention-drivenregistration network, we train the segmentation network using a semi-supervisedadversarial learning strategy. Our experimental results show that the proposedASRNet can achieve state-of-the-art accuracy in segmentation and registrationtasks performed with real MSI datasets.

关键词： Deep learning deformable image registration image segmentation multispectral imaging(MSI)

来源：评论

学校读者我要写书评

暂无评论

AID-DTI: ACCELERATING HIGH-FIDELITY DIFFUSION TENSOR IMAGING WITH DETAIL-PRESERVING MODEL-BASED DEEP LEARNING

arXiv

引用

arXiv 2024年

作者： Fan, Wenxin Cheng, Jian Li, Cheng Ma, Xinrui Yang, Jing Zou, Juan Wu, Ruoyou Liu, Qiegen Wang, Shanshan Paul C. Lauterbur Research Center for Biomedical Imaging Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Shenzhen China University of Chinese Academy of Sciences Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China Key Laboratory of Data Science and Intelligent Computing Institute of International Innovation Beihang University Zhejiang Hangzhou China Peng Cheng Laboratory Guangdong Shenzhen China Nan Chang University Jiang Xi Nan Chang China

Deep learning has shown great potential in accelerating diffusion tensor imaging (DTI). Nevertheless, existing methods tend to suffer from Rician noise and detail loss in reconstructing the DTI-derived parametric maps especially when sparsely sampled q-space data are used. This paper proposes a novel method, AID-DTI (Accelerating hIgh fiDelity Diffusion Tensor Imaging), to facilitate fast and accurate DTI with only six measurements. AID-DTI is equipped with a newly designed Singular Value Decomposition (SVD)-based regularizer, which can effectively capture fine details while suppressing noise during network training. Experimental results on Human Connectome Project (HCP) data consistently demonstrate that the proposed method estimates DTI parameter maps with fine-grained details and outperforms three state-of-the-art methods both quantitatively and qualitatively. Copyright © 2024, The Authors. All rights reserved.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

An intelligent Resource Scheduling Method with Edge Channel Deployment for BPM 19

An Intelligent Resource Scheduling Method with Edge Channel ...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Liu, Bowen Dou, Wanchun Zhou, Xiaokang Zhang, Xuyun Qi, Lianyong Dai, Fei Chen, Chaochao Nanjing University State Key Laboratory for Novel Software Technology Nanjing China Shiga University Faculty of Data Science Hikone Japan Macquarie University Department of Computing Sydney Australia College of Computer and Software Qingdao China Southwest Forestry University College of Big Data and Intelligent Engineering Kunming China Zhejiang University College of Computer Science and Technology Hangzhou China

ISBN: (纸本)9798350346558

Edge computing is a novel computing paradigm that offers kinds of resources at the network edge. In edge computing, terminal users are connected to edge servers via the wireless network and there are various channels in each wireless link. These wireless channels are limited resource while different channel has different cost and service ability. The dynamic changes of users' status make it harder to find an appropriate method to satisfy the BPM requirements of channel deployment. With this observation, it is a tricky challenge to make a trade-off between the system cost(rental price) and the service ability(number of users). In view of this challenge, an intelligent resource scheduling method, named EdgeIRS, is proposed in this paper. In the technical sense, the EdgeIRS method can accommodate most users at the edge with a minimum cost of deploying channel resources in an online way. Its performance is analyzed theoretically and the experiments verify the superiority of the method. © 2022 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

A DECOUPLED STRUCTURE PRESERVING SCHEME FOR THE POISSON-NERNST-PLANCK NAVIER-STOKES EQUATIONS AND ITS ERROR ANALYSIS

arXiv

引用

arXiv 2023年

作者： Yu, Ziyao Cheng, Qing Shen, Jie Wang, Changyou Department of Mathematics West LafayetteIN47907 United States Key Laboratory of Intelligent Computing and Application Tongji University Ministry of Education Department of Mathematics Tongji University Shanghai200092 China Eastern Institute of Technology Zhejiang Ningbo315200 China

We consider in this paper a numerical approximation of Poisson-Nernst-Planck-Navier-Stokes (PNP-NS) system. We construct a decoupled semi-discrete and fully discrete scheme that enjoys the properties of positivity preserving, mass conserving, and unconditionally energy stability. Then, we establish the well-posedness and regularity for the initial and (periodic) boundary value problem of the PNP-NS system under suitable assumptions on the initial data, and carry out a rigorous convergence analysis for the fully discretized scheme. We also present some numerical results to validate the positivity preserving property and the accuracy of our scheme. Copyright © 2023, The Authors. All rights reserved.

关键词： Navier Stokes equations

来源：评论

学校读者我要写书评

暂无评论

Detection of Children’s Molars Based on Noise Filter

Research Square

引用

Research Square 2022年

作者： Yan, Zhiwen Chen, Ying Song, Jinlong Zhu, Jia Li, Jianbo School of Computing Science South China Normal University Guangzhou China Key Laboratory of Intelligent Education Technology Application of Zhejiang Province Zhejiang Normal University Zhejiang China Stomatological Hospital Southern Medical University Guangzhou China

Pit and fissure sealant is for children aged seven to twelve years to prevent molars from becoming caries. In this paper, we propose a new detection framework to identify whether children need pit and fissure sealing. We divide the framework into two parts: molar detection and molar classification. According to the characteristics of teeth, we propose to use the clustering method to filter the bounding box in the object detection part. In the region divided by clustering, we only keep one detection frame in the same category. In the classification part, we propose a noise filtering layer based on wavelet transform for feature extraction. We map the training samples to another space in the training process based on metric learning to increase the distance between categories and improve the accuracy of classification. © 2022, CC BY.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Auto-MatRegressor材料性能自动预测器:解放材料机器学习"调参师"

引用

Science Bulletin 2023年第12期68卷 1259-1270,M0004页

作者：刘悦王双燕杨正伟 Maxim Avdeev 施思齐 School of Computer Engineering and Science Shanghai UniversityShanghai 200444China Shanghai Engineering Research Center of Intelligent Computing System Shanghai 200444China State Key Laboratory of Advanced Special Steel School of Materials Science and EngineeringShanghai UniversityShanghai 200444China Materials Genome Institute Shanghai UniversityShanghai 200444China Zhejiang Laboratory Hangzhou 311100China Australian Nuclear Science and Technology Organisation Sydney 2232Australia School of Chemistry The University of SydneySydney 2006Australia

机器学习因其能够快速、精准拟合数据的潜在模式而被广泛应用于材料构效关系研究。然而,材料科学家往往需要进行繁琐的模型选择及参数寻优才能构建出高精度预测模型,为了解放材料机器学习"调参师",本文研发了基于元学习的材... 详细信息

机器学习因其能够快速、精准拟合数据的潜在模式而被广泛应用于材料构效关系研究。然而,材料科学家往往需要进行繁琐的模型选择及参数寻优才能构建出高精度预测模型,为了解放材料机器学习"调参师",本文研发了基于元学习的材料性能自动预测器,采集了60份文献公开数据集与60份标准数据集,基于此训练18种常用回归算法并获得其预测性能,定义与计算了27个刻画数据集特点的元特征,以此构建了一份蕴含建模经验的元数据集;同时,创建了表征数据集所属材料类型的类别树,将其嵌入基于距离的元学习算法,进一步耦合贝叶斯优化算法,实现领域知识和元数据协同驱动下的自动算法推荐和模型参数确定,实验结果表明,材料科学家仅需为新材料性能预测任务提供数据集,便可利用该预测器高效地构建具有与文献报道相当或更高预测精度的机器学习模型.

关键词：机器学习贝叶斯优化算法预测器材料科学家元数据参数寻优预测性能材料性能

来源：评论

学校读者我要写书评

暂无评论

A Multiplayer Perceptron Algorithm Based on Global Electrical Heterogeneity and Cardiodynamicsgram for Non-Invasive Detection of Coronary Microvascular Dysfunction

A Multiplayer Perceptron Algorithm Based on Global Electrica...

引用

International Conference on Electronic Engineering and Informatics (EEI)

作者： Xiaoye Zhao Yinglan Gong Jucheng Zhang Haipeng Liu Tianhai Huang Jun Jiang Ling Xia Jiandong Mao School of Instrument Science and Opto-electronic Engineering Hefei University of Technology Hefei China School of Medical Technology North Minzu University Yinchuan China Institute of Wenzhou Zhejiang University Wenzhou China Department of Clinical Engineering The Second Affiliated Hospital Zhejiang University School of Medicine Hangzhou China Centre for Intelligent Healthcare Coventry University Coventry United Kingdom Department of Cardiology The Second Affiliated Hospital Zhejiang University School of Medicine Hangzhou China Key Laboratory for Biomedical Engineering of Ministry of Education Zhejiang University School of Medicine Hangzhou China Institute of Biomedical Engineering Zhejiang University Hangzhou China Key Laboratory of Atmospheric Environment Remote Sensing of Ningxia Yinchuan China

ISBN: (数字)9798350353594

ISBN: (纸本)9798350353600

Coronary microvascular dysfunction (CMD) is a key etiology of myocardial ischemia. Currently, early and non- invasive detection of CMD is lack in clinical practice. We proposed a multiplayer perceptron (MLP) model based on global electrical heterogeneity (GEH)- and cardiodynamicsgram (CDG)-based features for non-invasive detection of CMD. 25 GEH parameters and CDG-based features were derived from vectocardiograms (VCGs) of 82 CMD patients and 107 healthy controls to train the support vector machine (SVM) and multiplayer perceptron (MLP) models. Seventeen features (14 GEH parameters, 3 CDG-based features) were finally selected, and the performance of the two models were compared. The proposed MLP model performs better than SVM and provides accuracy: 0.871, sensitivity: 0.925, specificity: 0.775, F1-score: 0.810, and AUC (area under curve): 0.849 in the testing dataset. The proposed MLP model could distinguish CMD from healthy controls, providing possibilities for a noninvasive, low-cost approach for early detection of CMD.

关键词： Support vector machines Electric potential Computational modeling Myocardium Feature extraction Informatics Testing

来源：评论

学校读者我要写书评

暂无评论

RobustPFL: Robust Personalized Federated Learning

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Chen, Guorong Wang, Wei Wu, Yufang Li, Chao Xu, Guangquan Ji, Shouling Li, Tao Shen, Meng Han, Yufei Xi'an Jiaotong University Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an China Beijing Jiaotong University 3 Shangyuancun Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100044 China Tianjin University Tianjin Key Laboratory of Advanced Networking College of Intelligence and Computing Tianjin300350 China Zhejiang University College of Computer Science and Technology Hangzhou310027 China ITAI Haihe Lab Tianjin China Nankai University College of Computer Science Tianjin300350 China Beijing Institute of Technology School of Cyberspace Security Beijing100081 China Peng Cheng Laboratory Cyberspace Security Research Center Shenzhen518066 China INRIA Bretagne Rennes35042 France

Conventional federated learning (FL) coordinated by a central server focuses on training a global model and protecting the privacy of clients' training data by storing it locally. However, the statistical heterogeneity hinders the global model from adapting to the non-IID distributions among clients. Moreover, untrusted and unreliable central servers and malicious clients may compromise model integrity and availability, thus degrading the robustness of FL. To address these challenges, we present RobustPFL, a decentralized personalized federated learning (PFL) approach that combines α-based Layer-position Normalized Similarity (α-LNS) and local collaborative training to improve personalized performance while utilizing a blockchain-based committee mechanism to coordinate the aggregation process, thereby achieving high personalized accuracy and robustness. Extensive experiments show that our RobustPFL approach outperforms multiple algorithms, including Local training, FedAvg, FedReptile, Per-FedAvg, FedBN, and SPFL, on MNIST, CIFAR10, EMNIST, and N-BaIoT datasets in four non-IID settings. We also evaluate RobustPFL's effectiveness against attacks - poisoning attacks and free-riding attacks. Particularly, for three prevalent poisoning attacks (backdoor, label flipping, and model poisoning attacks), we compare non-defensive (FedAvg) and defensive (Krum, trimmed mean, Bulyan, FedBN, FLAME, and FangTrmean) methods with our proposed RobustPFL. The results show that our approach achieves significant defensive effects. © 2004-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Greedy Strategy for Graph Cut

arXiv

引用

arXiv 2024年

作者： Nie, Feiping Pei, Shenfei Zheng, Zengwei Wang, Rong Li, Xuelong Northwestern Polytechnical University Shaanxi Xi’an710072 China The School of Computer and Computing Science Hangzhou City University Zhejiang Hangzhou310015 China the Key Laboratory of Intelligent Interaction and Applications Ministry of Industry and Information Technology the School of Computer Science Northwestern Polytechnical University Shaanxi Xi’an710072 China

We propose a Greedy strategy to solve the problem of Graph Cut, called GGC. It starts from the state where each data sample is regarded as a cluster and dynamically merges the two clusters which reduces the value of the global objective function the most until the required number of clusters is obtained, and the monotonicity of the sequence of objective function values is proved. To reduce the computational complexity of GGC, only mergers between clusters and their neighbors are considered. Therefore, GGC has a nearly linear computational complexity with respect to the number of samples. Also, unlike other algorithms, due to the greedy strategy, the solution of the proposed algorithm is unique. In other words, its performance is not affected by randomness. We apply the proposed method to solve the problem of normalized cut which is a widely concerned graph cut problem. Extensive experiments show that better solutions can often be achieved compared to the traditional two-stage optimization algorithm (eigendecomposition + k-means), on the normalized cut problem. In addition, the performance of GGC also has advantages compared to several state-of-the-art clustering algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TEVA: Training-Efficient and Verifiable Aggregation for Federated Learning for Consumer Electronics in Industry 5.0

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xia, Yuanjun Liu, Yining Chen, Jingxue Liang, Yangfan Khan, Fazlullah Alturki, Ryan Wang, Xiaopei Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software School of Computer and Information Security Guilin541004 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325027 China University of Technology School of Mathematical and Physical Sciences SydneyNSW2007 Australia Jiaxing University Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems The Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province The Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing314001 China University of Nottingham Ningbo China School of Computer Science Faculty of Science and Engineering Zhejiang Ningbo315104 China Umm AI-Qura University Makkah Department of Software Engineering College of Computing Saudi Arabia Riverside Department of Computer Science and Engineering University of California CA92521 United States

Federated learning (FL) has been widely used for privacy-preserving model updates in Industry 5.0, facilitated by 6G networks. Despite FL's privacy-preserving advantages, it remains vulnerable to attacks where adversaries can infer private data from local models or manipulate the central server (CS) to deliver falsified global models. Current privacy-preserving approaches, primarily based on the FedAvg algorithm, fail to optimize training efficiency for non-independent and identically distributed (non-IID) data. This article proposes training-efficient and verifiable aggregation (TEVA) for FL to resolve these issues. This scheme combines threshold Paillier homomorphic encryption (TPHE), verifiable aggregation, and an optimized double momentum update mechanism (OdMum). TEVA not only leverages TPHE to protect the privacy of local models but also ensures the integrity of the global model through a verifiable aggregation mechanism. Additionally, TEVA integrates the OdMum algorithm to effectively address the challenges posed by non-IID data, promoting rapid model convergence and significantly enhancing overall training efficiency. Security analysis indicates that TEVA meets the requirements for privacy protection. Extensive experimental results demonstrate that TEVA can accelerate model convergence while incurring lower computational and communication overheads. © 1975-2011 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：