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

A level set model with shape prior constraint for intervertebral disc MRI image segmentation

Multimedia Tools and Applications 2025年第9期84卷 6755-6783页

作者： Tian, Zhuangzhou Wang, Shengsheng College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

Accurate intervertebral disc image segmentation is necessary for further treatment. However, existing methods are difficult to segment due to the intensity inhomogeneity of intervertebral disc MRI images and the similarity in intensity between the intervertebral disc and the surrounding regions. This paper proposes a novel level set model by introducing a shape prior constraint for automatic and accurate segmentation. We utilize a detection model and intensity change to obtain rectangle prior information, which is used to define a shape constraint term. Then, combining data and regularizing terms construct an energy function and employ the steepest descent method minimization to get segmentation results. Finally, we apply the proposed new method to segment intervertebral disc images and get promising results. Extensive experiments and comparisons show that our model is more efficient and accurate. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Bayesian Network Reconstruction and Iterative Divergence Problem Solving Method Based on Norm Minimization

引用

Computer Modeling in engineering & Sciences 2025年第4期143卷 617-637页

作者： Kuo Li Aimin Wang Limin Wang Yuetan Zhao Xinyu Zhu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun130012China College of Software Jilin UniversityChangchun130012China

A Bayesian network reconstruction method based on norm minimization is proposed to address the sparsity and iterative divergence issues in network reconstruction caused by noise and missing *** method achieves precise adjustment of the network structure by constructing a preliminary random network model and introducing small-world network characteristics and combines L1 norm minimization regularization techniques to control model complexity and optimize the inference process of variable *** the experiment of game network reconstruction,when the success rate of the L1 norm minimization model’s existence connection reconstruction reaches 100%,the minimum data required is about 40%,while the minimum data required for a sparse Bayesian learning network is about 45%.In terms of operational efficiency,the running time for minimizing the L1 normis basically maintained at 1.0 s,while the success rate of connection reconstruction increases significantly with an increase in data volume,reaching a maximum of 13.2 ***,in the case of a signal-to-noise ratio of 10 dB,the L1 model achieves a 100% success rate in the reconstruction of existing connections,while the sparse Bayesian network had the highest success rate of 90% in the reconstruction of non-existent *** the analysis of actual cases,the maximum lift and drop track of the research method is 0.08 *** mean square error is 5.74 cm^(2).The results indicate that this norm minimization-based method has good performance in data efficiency and model stability,effectively reducing the impact of outliers on the reconstruction results to more accurately reflect the actual situation.

关键词： Bayesian norm minimization network reconstruction iterative divergence sparsity

来源：评论

学校读者我要写书评

暂无评论

Distributed Leader-Following Formation Control of Networked Mobile Robots via Global Orientation Estimation

引用

IEEE Transactions on Network Science and engineering 2025年第3期12卷 2135-2150页

作者： Wang, Siqi Wang, Heng Che, Weiwei Li, Qing University of Science and Technology Beijing Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering Beijing100083 China Northeastern University College of Information Science and Engineering Shenyang110819 China

This article proposes a novel distributed leader-following formation control strategy for multiple networked mobile robots, utilizing the relative position measurements among robots. In particular, the leader is assumed to have the same kinematics as the followers and all the robots do not rely on orientation measurements. Firstly, a global orientation estimation law is proposed in the sense that the followers' orientation information is estimated in the leader's reference frame, only based on the leader's orientation estimation and relative bearing information. Secondly, since the leader is not directly connected to all the followers, a new distributed state observer is designed for each follower to estimate the leader's states. Especially, the designed observer not only removes the algebraic loops issue but also eliminates the requirement for the leader's acceleration information. Furthermore, a distributed formation control law is proposed by incorporating the previous estimations, and it is proved that the closed-loop system consisting of the observer and controller is asymptotically stable. Finally, simulation results validate the effectiveness and superiority of the proposed method. © 2013 IEEE.

关键词： Observers Formation control Estimation Robot sensing systems Position measurement Robot kinematics Mobile robots Topology Decentralized control Accuracy

来源：评论

学校读者我要写书评

暂无评论

Dual AAV Cluster-Assisted Maritime Physical-Layer Secure Communications via Collaborative Beamforming

引用

IEEE Internet of Things Journal 2025年第9期12卷 12589-12607页

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Du, Hongyang Niyato, Dusit Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong

Autonomous aerial vehicles (AAVs) can be utilized as relay platforms to assist maritime wireless communications. However, complex channels and multipath effects at sea can adversely affect the quality of AAV transmitted signals. Collaborative beamforming (CB) can enhance the signal strength and range to assist the AAV relay for remote maritime communications. However, due to the open nature of AAV channels, security issue requires special consideration. This article proposes a dual AAV cluster-assisted system via CB to achieve physical-layer security in maritime wireless communications. Specifically, one AAV cluster forms a maritime AAV-enabled virtual antenna array (MUVAA) relay to forward data signals to the remote legitimate vessel, and the other AAV cluster forms an MUVAA jammer to send jamming signals to the remote eavesdropper. In this system, we formulate a secure and energy-efficient maritime communication multiobjective optimization problem (SEMCMOP) to maximize the signal-to-interference-plus-noise ratio (SINR) of the legitimate vessel, minimize the SINR of the eavesdropping vessel and minimize the total flight energy consumption of AAVs. Since the SEMCMOP is an NP-hard and large-scale optimization problem, we propose an improved swarm intelligence optimization algorithm with chaotic solution initialization and hybrid solution update strategies to solve the problem. Simulation results indicate that the proposed algorithm outperforms other comparison algorithms, and it can achieve more efficient signal transmission by using the CB-based method. © 2014 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Histological Image Diagnosis of Breast Cancer Based on Multi-Attention Convolution Neural Network

引用

Journal of Shanghai Jiaotong university(Science) 2025年第1期30卷 91-106页

作者： XU Wangwang XU Liangfeng LIU Ninghui LU Na Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230601China School of Computer and Information Hefei University of TechnologyHefei230601China First Affiliated Hospital of Anhui Medical University Hefei230022China

Breast cancer is a serious and high morbidity disease in women,and it is the main cause of cancer death in ***,getting tested and diagnosed early can reduce the risk of *** present,there are clinical examinations,imaging screening and biopsies,among which histopathological examination is the gold ***,the process is complicated and time-consuming,and misdiagnosis may *** paper puts forward a classification framework based on deep learning,introducing multi-attention mechanism,selecting kernel convolution instead of ordinary convolution,and using different weights and combinations to pay attention to the accuracy index and growth rate of the *** addition,we also compared the learning rate *** function can fine-tune the learning rate to achieve good performance,using label softening to reduce the loss error caused by model error recognition in the label,and assigning different category weights in the loss function to balance the positive and negative *** used the BreakHis data set to automatically classify histological images into benign and malignant,four categories and eight *** results showed that the accuracy of binary classifications ranged from 98.23%to 98.83%,and that of multiple classifications ranged from 97.89%to 98.11%.

关键词： breast cancer deep learning attentional mechanism classification diagnosis

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Recognition of tea sprouts based on improved deeplabV3 + model

引用

Multimedia Tools and Applications 2025年 1-18页

作者： Liu, Ruixin Wang, Dengzhun Chen, Zhonghui Li, Zhilin Xiao, Hui Yan, Chunyu Yan, Jianwei Lu, Ping Xie, Benliang College of Big Data and Information Engineering Guizhou University Guiyang550025 China Power Semiconductor Device Reliability Engineering Center of the Ministry of Education Guiyang550025 China College of Mechanical Engineering Guizhou University Guiyang550025 China State Key Laboratory Breeding Base of Green Pesticide and Agricultural Bioengineering Key Laboratory of Green Pesticide and Agricultural Bioengineering Ministry of Education Guizhou University Guiyang550025 China

The recognition of tea sprouts is the premise of realize the intelligence of the premium tea picking. DeepLabV3 +, as the latest semantic segmentation algorithm of DeepLab family, can well recognize the tea sprouts in images. However, the model still has the problem of large number of parameters, and there is still room for improvements in segmentation accuracy and speed. To solve the multi-label recognition and segmentation of background, single bud, one leaf and two leaves in the tea sprout images, an improved deep convolutional neural network algorithm is proposed. This method realizes the recognition of different postures of high-quality tea sprouts on the premise of efficiency and accuracy. The DMResNet18 model is used as the feature extraction network to lightweight the network model and increase the segmentation speed. The feature joint attention network is added to optimize the spatial weights and channel weights of the model, which improves the accuracy of segmentation. Additionally, the low-level feature fusion method is applied to obtain rich initial global information of features and improves the overall performance of the model. The results show that the segmentation accuracy of improved DeepLabV3 + model reaches 92.58%, which is improved by 4.26% compared with the original DeepLabV3 + model. The model size and the speed of detection are improved by 80.67% and 52.24%, respectively. The proposed method offers a solution for the intelligent recognition of tea sprouts. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Byzantine-robust distributed support vector machine

引用

Science China Mathematics 2025年第3期68卷 707-728页

作者： Xiaozhou Wang Weidong Liu Xiaojun Mao School of Statistics East China Normal UniversityShanghai 200062China Key Laboratory of Advanced Theory and Application in Statistics and Data Science(Ministry of Education) East China Normal UniversityShanghai 200062China School of Mathematical Sciences Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Artificial Intelligence(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory of Scientific and Engineering Computing(Ministry of Education) Shanghai Jiao Tong UniversityShanghai 200240China

The development of information technology brings diversification of data sources and large-scale data sets and calls for the exploration of distributed learning algorithms. In distributed systems, some local machines may behave abnormally and send arbitrary information to the central machine(known as Byzantine failures), which can invalidate the distributed algorithms based on the assumption of faultless systems. This paper studies Byzantine-robust distributed algorithms for support vector machines(SVMs) in the context of binary classification. Despite a vast literature on Byzantine problems, much less is known about the theoretical properties of Byzantine-robust SVMs due to their unique challenges. In this paper, we propose two distributed gradient descent algorithms for SVMs. The median and trimmed mean operations in aggregation can effectively defend against Byzantine failures. Theoretically, we show the convergence of the proposed estimators and provide the statistical error rates. After a certain number of iterations, our estimators achieve near-optimal rates. Simulation studies and real data analysis are conducted to demonstrate the performance of the proposed Byzantine-robust distributed algorithms.

关键词： Byzantine robustness convergence distributed learning support vector machine

来源：评论

学校读者我要写书评

暂无评论

PBCounter:weighted model counting on pseudo-boolean formulas

引用

Frontiers of Computer Science 2025年第3期19卷 55-63页

作者： Yong LAI Zhenghang XU Minghao YIN College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China School of Computer Science and Information Technology Northeast Normal UniversityChangchun 130017China

In Weighted Model Counting(WMC),we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its *** current WMC solvers work on Conjunctive Normal Form(CNF)***,CNF is not a natural representation for human-being in many *** by the stronger expressive power of Pseudo-Boolean(PB)formulas than CNF,we propose to perform WMC on PB *** on a recent dynamic programming algorithm framework called ADDMC for WMC,we implement a weighted PB counting tool *** compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD,ExactMC,D4,and ADDMC,where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF *** experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.

关键词： weighted model counting pseudo-boolean constraint algebraic decision diagrams preprocessing techniques

来源：评论

学校读者我要写书评

暂无评论

Two efficient beamforming methods for hybrid IRS-aided AF relay wireless networks

引用

Science China(Information Sciences) 2025年第4期68卷 363-379页

作者： Xuehui WANG Qingbo LI Wen ZHU Feng SHU Mengxing HUANG Fuhui ZHOU Riqing CHEN Cunhua PAN Yongpeng WU Jiangzhou WANG School of Mathematics and Statistics Hainan Normal University Key Laboratory of Data Science and Smart Education Ministry of Education Hainan Normal University School of Information and Communication Engineering Hainan University Collaborative Innovation Center of Information Technology Hainan University School of Electronic and Optical Engineering Nanjing University of Science and Technology College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Digital Fujian Institute of Big Data for Agriculture Fujian Agriculture and Forestry University National Mobile Communications Research Laboratory Southeast University Shanghai Key Laboratory of Navigation and Location Based Services Shanghai Jiao Tong University School of Engineering University of Kent

Owing to its ability to mitigate the double-fading effect by amplifying the reflected signal, the active intelligent reflecting surface(IRS) has garnered significant attention. In this paper, an amplify-and-forward(AF) relay network assisted by a hybrid IRS consisting of both passive and active units is developed. A signal-to-noise ratio(SNR) maximization problem is formulated, where the AF relay beamforming matrix and the hybrid IRS reflecting coefficient matrices for two-time slots need to be optimized. To address the SNR maximization problem, this paper proposes both a high-performance(HP) method and a low-complexity(LC) method. The HP method is based on the semidefinite relaxation and fractional programming(SDR-FP)algorithm, with rank-1 solutions obtained through Gaussian randomization. For the LC method, the amplification coefficient of each active IRS element is assumed to be equal. The SNR maximization problem is then addressed using the whitening filter,generalized power iteration, and generalized Rayleigh-Ritz(WF-GPI-GRR) approach. Simulation results show that compared with the benchmarks, such as the passive IRS-aided AF relay network, the proposed HP-SDR-FP and WF-GPI-GRR methods achieve significant rate improvements. In particular, the HP-SDR-FP and WF-GPI-GRR methods yield more than a 135.0%rate gain when the transmit power Ps of the source is 10 dBm. Furthermore, the proposed HP-SDR-FP method outperforms the WF-GPI-GRR method in terms of rate performance.

关键词： double-fading intelligent reflecting surface active elements passive elements hybrid IRS AF relay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：