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

IEEE International Symposium on Biomedical Imaging

作者： Jing Yang Jian Cheng Cheng Li Wenxin Fan Juan Zou Ruoyou Wu Qiegen Liu Hairong Zheng Shanshan Wang Paul C. Lauterbur Research Center for Biomedical Imaging Shenzhen Institute of Advanced Technology Chinese Academy of Sciences 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 Hangzhou China Department of Electronic Information Engineering Nanchang University Nanchang China

ISBN: (数字)9798350313338

ISBN: (纸本)9798350313345

Diffusion Magnetic Resonance Imaging (dMRI) plays a crucial role in the noninvasive investigation of tissue microstructural properties and structural connectivity in the in vivo human brain. However, to effectively capture the intricate characteristics of water diffusion at various directions and scales, it is important to employ comprehensive q-space sampling. Unfortunately, this requirement leads to long scan times, limiting the clinical applicability of dMRI. To address this challenge, we propose SSOR, a Simultaneous q-Space sampling Optimization and Reconstruction framework. We jointly optimize a subset of q-space samples using a continuous representation of spherical harmonic functions and a reconstruction network. Additionally, we integrate the unique properties of diffusion magnetic resonance imaging (dMRI) in both the q-space and image domains by applying l1-norm and total-variation *** experiments conducted on HCP data demonstrate that SSOR has promising strengths both quantitatively and qualitatively and exhibits robustness to noise.

关键词： Water In vivo Limiting Magnetic resonance imaging Harmonic analysis Robustness Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Dynamics Modeling with Realistic Constraints for Robust Tracking Control of Manipulator

SSRN

引用

SSRN 2022年

作者： Zuo, Guoyu Li, Mi Liu, Lu Li, Jiangen Huang, Gao Faculty of Information Technology Beijing University of Technology Beijing100124 China Beijing Key Laboratory of Computing Intelligence and Intelligent Systems Beijing100124 China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology Beijing100081 China

To meet the requirements of precision assembly in industrial scenarios, an efficient, accurate and robust modeling control method has become an important research objective. This paper proposes a novel manipulator control method with three-level constraints, called the real deep Lagrangian network (Real-DeLaN). In this method, real data (also called physical data) are collected from the physical manipulator and utilized to train the Lagrangian dynamics network model to improve the migration ability from simulation to reality. The torque output of the dynamic model is corrected by real-time calculation of friction in the network. The contact force on the end effector of the manipulator is compensated based on the principle of virtual displacement work. Furthermore, a robust controller based on the dynamics model is designed, and the Lyapunov theorem is used to prove that the controlled system can achieve three different kinds of stability. The experimental results show that Real-DeLaN can better control the joints to perform trajectory tracking, reduce the friction error of the manipulator, and show better anti-interference ability. The robust controller further improves the robustness and tracking control effect of this method. Moreover, the method has higher practicability than other existing methods due to its good adaptability and migration ability. © 2022, The Authors. All rights reserved.

关键词： Manipulators

来源：评论

学校读者我要写书评

暂无评论

Modeling and Clustering of Parabolic Granular Data

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3728-3742页

作者： Tang, Yiming Gao, Jianwei Pedrycz, Witold Hu, Xianghui Xi, Lei Ren, Fuji Hu, Min Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6R 2V4 Canada Hefei University of Technology School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Polish Academy of Sciences Systems Research Institute Warsaw00-901 Poland Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Southeast University School of Computer Science and Engineering Nanjing211189 China University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China

At present, there exist some problems in granular clustering methods, such as lack of nonlinear membership description and global optimization of granular data boundaries. To address these issues, in this study, revolving around the parabolic granular data, we propose an overall architecture for parabolic granular modeling and clustering. To begin with, novel coverage and specificity functions are established, and then a parabolic granular data structure is proposed. The fuzzy c-means (FCM) algorithm is used to obtain the numeric prototypes, and then particle swarm optimization (PSO) is introduced to construct the parabolic granular data from the global perspective under the guidance of principle of justifiable granularity (PJG). Combining the advantages of FCM and PSO, we propose the parabolic granular modeling and optimization (PGMO) method. Moreover, we put forward attribute weights and sample weights as well as a distance measure induced by the Gaussian kernel similarity, and then come up with the algorithm of weighted kernel fuzzy clustering for parabolic granularity (WKFC-PG). In addition, the assessment mechanism of parabolic granular clustering is discussed. In summary, we set up an overall architecture including parabolic granular modeling, clustering, and assessment. Finally, comparative experiments on artificial, UCI, and high-dimensional datasets validate that our overall architecture delivers a good improvement over previous strategies. The parameter analysis and time complexity are also given for WKFC-PG. In contrast with related granular clustering algorithms, it is observed that WKFC-PG performs better than other granular clustering algorithms and has superior stability in handling outliers, especially on high-dimensional datasets. © 2020 IEEE.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Optimizing the Size of Peritumoral Region for Assessing Non-Small Cell Lung Cancer Heterogeneity Using Radiomics 12th

Optimizing the Size of Peritumoral Region for Assessing No...

引用

12th International Conference on Health Information Science, HIS 2023

作者： Zhang, Xingping Zhang, Guijuan Qiu, Xingting Yin, Jiao Tan, Wenjun Yin, Xiaoxia Yang, Hong Wang, Kun Zhang, Yanchun Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou510006 China School of Computer Science and Technology Zhejiang Normal University Jinhua321000 China Department of Respiratory and Critical Care First Affiliated Hospital of Gannan Medical University Ganzhou341000 China Institute for Sustainable Industries and Liveable Cities Victoria University Melbourne3011 Australia Department of New Networks Peng Cheng Laboratory Shenzhen518000 China Department of Radiology First Affiliated Hospital of Gannan Medical University Ganzhou341000 China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang110189 China

ISBN: (纸本)9789819971077

Objectives: Radiomics has a novel value in accurately and noninvasively characterizing non-small cell lung cancer (NSCLC), but the role of peritumoral features has not been discussed in depth. This work aims to systematically assess the additional value of peritumoral features by exploring the impact of peritumoral region size. Materials and methods: A total of 370 NSCLC patients who underwent preoperative contrast-enhanced CT scans between October 2017 and September 2021 were retrospectively analyzed. The study was carefully designed with a radiomics pipeline to predict lymphovascular invasion, pleural invasion, and T4 staging. To assess the impact of peritumoral features, tumor regions of interest (ROIs) annotated by two medical experts were automatically expanded to produce peritumoral ROIs of different regional sizes, with edge thicknesses of 1 mm, 3 mm, 5 mm, and 7 mm. In a custom pipeline, prediction models were constructed using peritumoral features with different margin thicknesses and intratumoral features of the primary tumor. Results: Radiomics features combining intratumoral and peritumoral regions were created based on the best features of each ROI. Models incorporating peritumoral features yielded varying degrees of improvement in AUCs compared to models using only intratumoral features. The choice of peritumoral size may impact the degree of improvement in radiomics analysis. Conclusions: The integration of peritumoral features has shown potential for improving the predictive value of radiomics. However, selecting an appropriate peritumoral region size is constrained by various factors such as clinical issues, imaging modalities, and ROI annotations. Therefore, future radiomics studies should consider these factors and optimize peritumoral features to cater to specific applications. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A DQN-Based Approach for Online Service Placement in Mobile Edge computing 16th

A DQN-Based Approach for Online Service Placement in Mobile ...

引用

16th EAI International Conference on Collaborative computing: Networking, Applications, and Worksharing, CollaborateCom 2020

作者： Jie, Xiaogan Liu, Tong Gao, Honghao Cao, Chenhong Wang, Peng Tong, Weiqin School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Key Laboratory of Data Science Shanghai China Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai China Shanghai Engineering Research Center of Intelligent Computing System Shanghai China

ISBN: (纸本)9783030675394

Due to the development of 5G networks, computation intensive applications on mobile devices have emerged, such as augmented reality and video stream analysis. Mobile edge computing is put forward as a new computing paradigm, to meet the low-latency requirements of applications, by moving services from the cloud to the network edge like base stations. Due to the limited storage space and computing capacity of an edge server, service placement is an important issue, determining which services are deployed at edge to serve corresponding tasks. The problem becomes particularly complicated, with considering the stochastic arrivals of tasks, the additional latency incurred by service migration, and the time spent for waiting in queues for processing at edge. Benefiting from reinforcement learning, we propose a deep Q network based approach, by formulating service placement as a Markov decision process. Real-time service placement strategies are output, to minimize the total latency of arrived tasks in a long term. Extensive simulation results demonstrate that our approach works effectively. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Truthful Online Incentive Mechanism for a Social Crowdsensing Network 16th

An Efficient and Truthful Online Incentive Mechanism for a S...

引用

16th EAI International Conference on Collaborative computing: Networking, Applications, and Worksharing, CollaborateCom 2020

作者： Fang, Lu Liu, Tong Gao, Honghao Cao, Chenhong Li, Weimin Tong, Weiqin School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Key Laboratory of Data Science Shanghai China Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai China Shanghai Engineering Research Center of Intelligent Computing System Shanghai China

ISBN: (纸本)9783030675363

Crowdsening plays an important role in spatiotemporal data collection by leveraging ubiquitous smart devices equipped with sensors. Considering rational and strategic device users, designing a truthful incentive mechanism is a crucial issue. Moreover, another key challenge is that there may not exist adequate participating users in reality. To encourage more users to participate, the social relationship among them can be leveraged, as users may be significantly influenced by their social friends. In this paper, we assume recruited users to diffuse uncompleted sensing tasks to their friends, and propose an efficient and truthful online incentive mechanism for a such social crowdsensing network. Specially, we model the time-varying social influence of a user by extending two metrics of node centrality used in social networks. In order to maximize the accumulated social welfare achieved by the network, we design a user selection algorithm and a payment determination algorithm respectively, in which payments given to participants not only depend on data qualities but also related with social influences. We theoretically prove that our mechanism achieves properties of computational efficiency, individual rationality, and truthfulness. Extensive simulations are conducted, and the results show the superiority of our mechanism. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Efficient Hierarchical Exploration with An Active Subgoal Generation Strategy

Efficient Hierarchical Exploration with An Active Subgoal Ge...

引用

IEEE International Conference on Robotics and Biomimetics

作者： Xin Xu Guoyu Zuo Jiangeng Li Gao Huang Faculty of Information Technology Beijing University of Technology Beijing China Beijing Key Laboratory of Computing Intelligence and Intelligent Systems Beijing China Faculty of Information Beijing University of Technology Beijing China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing China

ISBN: (纸本)9781665481106

Goal-conditioned hierarchical reinforcement learning (HRL) is a promising approach in long-horizon and complex tasks. It has been successfully used by decomposing tasks via subgoals. However, the existing goal-conditioned HRL methods often suffer from training inefficiency in the long-horizon tasks with sparse external rewards. For this problem, this paper proposes a novel framework that can train high-level policy efficiently with an effective sub goal generation method. The key component of the framework is an active subgoal generation strategy which consists of (a) an efficient high-level policy learning mechanism and (b) two measures of novelty and coverage for filtering effective subgoals. We also introduce the HER mechanism to the framework to solve the problem of sparse reward in the environment. Building upon the proposed framework, this paper develops an active hierarchical exploration strategy with an efficient subgoal generation method. We test our method on a variety of continuous control tasks. Experimental results demonstrate that the strategy outperforms the state-of-the-art HRL approaches.

关键词： Training Learning systems Representation learning Filtering Biomimetics Buildings Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Remolding Semantic Focus with Dual Attention Mechanism for Aspect-based Sentiment Analysis

Remolding Semantic Focus with Dual Attention Mechanism for A...

引用

IEEE International Conference on Cloud computing and Intelligence Systems (CCIS)

作者： Xingda Li Yanwei Bao Min Hu Fuji Ren Hefei University of Technology Hefei Anhwi China Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology China University of Electronic Science and Technology of China Chengdu Chengdu China

ISBN: (纸本)9781665456579

Aspect-based sentiment analysis (ABSA) is an NLP task that classify fine-grained sentiment towards one specific aspect from the same text. While attention mechanism has achieved great success, attaching aspects to abstract sentiment remains challenging. In this paper, we propose dual attention mechanism, a novel method to re-weight the distribution of attention between stack BERT layers, in prompt learning way with pretrained language model BERT. Specifically, after obtaining the most attractive words, the method raises weight of other possible corresponding words and makes model consider more comprehensively. To introduce more aspect information, we classify the sentiment in improved prompt learning way. Note that the overfitting using BERT on ABSA, we utilize the approach of staged loss that restrict the training not too small. Finally, the experiment results demonstrate the effectiveness and the stability of dual attention and provide a good insight of attention mechanism.

关键词： Training Learning systems Sentiment analysis Cloud computing Computational modeling Bit error rate Semantics

来源：评论

学校读者我要写书评

暂无评论

Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Dong, Xuewen Li, Jiachen Li, Shujun You, Zhichao Qu, Qiang Kholodov, Yaroslav Shen, Yulong The School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi’an710071 China The School of Computing Kent Interdisciplinary Research Centre in Cyber Security University of Kent CanterburyCT2 7NF United Kingdom Shenzhen Institute of Advanced Technology Chinese Academy of Sciences China The Intelligent Transportation Systems Lab Innopolis University Innopolis Russia The School of Computer Science and Technology Xidian University China

Recent studies show that graph neural networks (GNNs) are vulnerable to backdoor attacks. Existing backdoor attacks against GNNs use fixed-pattern triggers and lack reasonable trigger constraints, overlooking individual graph characteristics and rendering insufficient evasiveness. To tackle the above issues, we propose ABARC, the first Adaptive Backdoor Attack with Reasonable Constraints, applying to both graph-level and node-level tasks in GNNs. For graph-level tasks, we propose a subgraph backdoor attack independent of the graph’s topology. It dynamically selects trigger nodes for each target graph and modifies node features with constraints based on graph similarity, feature range, and feature type. For node-level tasks, our attack begins with an analysis of node features, followed by selecting and modifying trigger features, which are then constrained by node similarity, feature range, and feature type. Furthermore, an adaptive edge-pruning mechanism is designed to reduce the impact of neighbors on target nodes, ensuring a high attack success rate (ASR). Experimental results show that even with reasonable constraints for attack evasiveness, our attack achieves a high ASR while incurring a marginal clean accuracy drop (CAD). When combined with the state-of-the-art defense randomized smoothing (RS) method, our attack maintains an ASR over 94%, surpassing existing attacks by more than 7%. © 2004-2012 IEEE. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：