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

Correlation Attention Registration Based on Deep Learning from Histopathology to MRI of Prostate

Critical Reviews in Biomedical engineering 2024年第2期52卷 39-50页

作者： Wang, Xue Song, Zhili Zhu, Jianlin Li, Zhixiang School of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai201418 China

Deep learning offers a promising methodology for the registration of prostate cancer images from histopathology to MRI. We explored how to effectively leverage key information from images to achieve improved end-to-end registration. We developed an approach based on a correlation attention registration framework to register segmentation labels of histopathology onto MRI. The network was trained using paired prostate datasets of histopathology and MRI from the Cancer Imaging Archive. We introduced An L2-Pearson correlation layer to enhance feature matching. Furthermore, our model employed an enhanced attention regression network to distinguish between key and nonkey features. For data analysis, we used the Kolmogorov–Smirnov test and a one-sample t-test, with the statistical significance level for the one-sample t-test set at 0.001. Compared with two other models (ProsRegNet and CNNGeo), our model exhibited improved performance in Dice coefficient, with increases of 9.893% and 2.753%, respectively. The Hausdorff distance was reduced by approximately 50% and 50%, while the average label error (ALE) was reduced by 0.389% and 15.021%. The proposed improved multimodal prostate registration framework demonstrated high performance in statistical analysis. The results indicate that our enhanced strategy significantly improves registration performance and enables faster registration of histopathological images of patients undergoing radical prostatectomy to preoperative MRI. More accurate registration can prevent over-diagnosing low-risk cancers and frequent false positives due to observer differences. © 2023 by Begell House, Inc.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

A hybrid machine learning approach for enhanced anomaly detection in drinking water quality

引用

International Journal of Environmental Studies 2024年第2期81卷 661-674页

作者： Kalaivanan, K. Vellingiri, J. School of Computer Science Engineering and Information Systems Vellore Institute of Technology Vellore India

Machine learning has become important for anomaly detection in water quality prediction. Data anomalies are often caused by the difficulties of analysing large amounts of data, both technical and human, but approaches have been inadequate when water contamination increases. The paper reports an anomaly detection technique based on an autoencoder and an extreme learning machine (AEELM). This approach uses an autoencoder for feature selection and an ELM algorithm for classification purposes. It is estimated using the Cauvery River dataset. The autoencoder-based ELM techniques outperformed other models with 83% accuracy, 77% precision, 83% recall, and 83% F1-level characteristic performance indicators. These results demonstrate its great effectiveness. © 2024 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Water quality

来源：评论

学校读者我要写书评

暂无评论

Effective Tool Augmented Multi-Agent Framework for Data Analysis

引用

Data Intelligence 2024年第4期6卷 923-945页

作者： Xilin Zhang Zhixin Mao Ziwen Chen Shen Gao School of Automation Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Computer Science and Engineering(School of Cyber Security) University of Electronic Science and Technology of ChinaChengdu 611731China

Data analysis tasks aim to provide insightful analysis for given data by incorporating background knowledge of the represented phenomenon, which in turn supports decision-making. While existing large language models(LLMs) can describe data trends, they still lag behind human data analysts in terms of integrating external knowledge and in-depth data analysis. Therefore, we propose a multi-agent data analysis framework based on LLMs. The framework decomposes the data analysis task into subtasks by employing three different agents. By empowering agents with the ability to utilize data search tools, the framework enables them to search for arbitrary relevant knowledge during the analysis process, leading to more insightful analysis. Moreover, to enhance the quality of the analysis results, we propose a multi-stage iterative optimization method that iteratively performs data analysis to form more in-depth conclusions. To validate the performance of our framework, we apply it to three real-world problems in the research development of higher education in China data. Experimental results demonstrate that our approach can achieve more insightful data analysis results compared to directly using LLMs alone.

关键词： Exploratory data analysis Multi-agent Large language models

来源：评论

学校读者我要写书评

暂无评论

QAAS:quick accurate auto-scaling for streaming processing

引用

Frontiers of computer science 2024年第1期18卷 5-15页

作者： Shiyuan LIU Yunchun LI Hailong YANG Ming DUN Chen CHEN Huaitao ZHANG Wei LI State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Cyber Science and Technology Beihang UniversityBeijing 100191China School of Computer Science and Technology Xi’an Jiaotong UniversityXi’an 710049China

In recent years,the demand for real-time data processing has been increasing,and various stream processing systems have *** the amount of data input to the stream processing system fluctuates,the computing resources required by the stream processing job will also *** resources used by stream processing jobs need to be adjusted according to load changes,avoiding the waste of computing *** present,existing works adjust stream processing jobs based on the assumption that there is a linear relationship between the operator parallelism and operator resource consumption(e.g.,throughput),which makes a significant deviation when the operator parallelism *** paper proposes a nonlinear model to represent operator *** divide the operator performance into three stages,the Non-competition stage,the Non-full competition stage,and the Full competition *** our proposed performance model,given the parallelism of the operator,we can accurately predict the CPU utilization and operator *** with actual experiments,the prediction error of our model is below 5%.We also propose a quick accurate auto-scaling(QAAS)method that uses the operator performance model to implement the auto-scaling of the operator parallelism of the Flink *** to previous work,QAAS is able to maintain stable job performance under load changes,minimizing the number of job adjustments and reducing data backlogs by 50%.

关键词： stream processing performance model auto-scaling

来源：评论

学校读者我要写书评

暂无评论

Diabetic Retinopathy Image Segmentation Method Based on Fusion DenseNet and U-Net Network

引用

engineering Letters 2025年第2期33卷 418-428页

作者： Zhang, Yaxuan Xu, Yang Zhai, Jinlong University of Science and Technology LiaoNing Anshan114051 China School of Computer Science and Software Engineering University of Science and Technology LiaoNing Anshan114051 China

Diabetic Retinopathy (DR) is a common and significant complication in patients with diabetes, and severely affecting their quality of life. Image segmentation plays a crucial role in the early diagnosis and treatment of DR. However, traditional methods are limited in terms of segmentation accuracy and generalization capability. This paper proposes a novel image segmentation method for diabetic retinopathy based on the integration of DenseNet and U-Net networks. Firstly, DenseNet is utilized to replace the encoder part of U-Net. The dense connection mechanism enhances the efficiency of feature propagation and improves the feature extraction capability of the encoder. Secondly, we introduce Omni-Dimensional Dynamic Convolution (ODConv) to replace traditional convolutions. ODConv is used to handle diverse input features effectively. The model's adaptability and segmentation accuracy for various samples is improved. Finally, we integrate the Convolutional Block Attention Module (CBAM) into the decoder. By leveraging channel and spatial attention, the ability to capture key features is enhanced, and the segmentation accuracy and boundary recognition capabilities are improved. To validate the effectiveness and feasibility of the model. This paper conducts experiments on the DDR dataset and the IDRID dataset. The experimental results show that the proposed method improved the mDice score by 0.53% compared to traditional methods. It also increased the mIoU score by 1.12% over traditional methods. This indicates that the proposed method has better performance in segmenting diabetic retinopathy images. It also demonstrates better generalization ability. © 2025, International Association of Engineers. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

High Dynamic Range Imaging for Dynamic Scenes Based on Multi-Level Spike Camera

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年第6期35卷 5394-5406页

作者： Zhu, Zhenkun Xiong, Ruiqin Zhao, Jing Zhao, Rui Fan, Xiaopeng Zhu, Shuyuan Huang, Tiejun Peking University School of Computer Science Beijing100871 China Harbin Institute of Technology Department of Computer Science and Technology Harbin150001 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China

Spike camera is a retina-inspired neuromorphic camera which can capture dynamic scenes of high-speed motion by firing a continuous stream of spikes at an extremely high temporal resolution. The limitation in the current design is that each spike only represents the arrival of a fixed amount of photons. It can not deal with strong light areas in which the amount of accumulated photons reaches the pre-specified threshold multiple times within a single readout interval. In this paper, we propose a new spike camera model of high-speed imaging for high dynamic range scenarios. In this scheme, each pixel accumulates the incoming photons persistently and generates a new type of spike stream in which each spike symbol may be associated with different levels, indicating the arrival of different amounts of photons since the last readout. This enables the camera to support dynamic scenes with wider dynamic range. To achieve this, we propose a two-level buffer mechanism, one for photon accumulation and one for spike-firing encoding. We use a register to hold the number of spike-firings which has not been read out yet. At each readout time, the major part in the counter is read out via a carefully designed exponential encoding and the counter is updated. Such encoding and readout strategy enables a very efficient expansion of the dynamic range using a small number of encoding bits. Furthermore, we propose an image reconstruction scheme for the proposed camera, utilizing both spike intervals and spike levels to recover the light intensity. We incorporate Mamba and propose a temporal-spatial selective scan mechanism to extract temporal-spatial correlation within spike streams. We employ a pyramid adaptive filtering and alignment module to achieve coarse-to-fine feature alignment. Experimental results show that the proposed scheme can achieve better imaging quality and outperform the existing spike camera in high dynamic range scenarios. © 1991-2012 IEEE.

关键词： Adaptive filtering

来源：评论

学校读者我要写书评

暂无评论

DMF: A Deep Multimodal Fusion-Based Network Traffic Classification Model

引用

computers, Materials & Continua 2025年第5期83卷 2267-2285页

作者： Xiangbin Wang Qingjun Yuan Weina Niu Qianwei Meng Yongjuan Wang Chunxiang Gu Henan Key Laboratory of Network Cryptography Technology Information Engineering UniversityZhengzhou450001China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu611731China

With the rise of encrypted traffic,traditional network analysis methods have become less effective,leading to a shift towards deep learning-based *** these,multimodal learning-based classification methods have gained attention due to their ability to leverage diverse feature sets from encrypted traffic,improving classification ***,existing research predominantly relies on late fusion techniques,which hinder the full utilization of deep features within the *** address this limitation,we propose a novel multimodal encrypted traffic classification model that synchronizes modality fusion with multiscale feature ***,our approach performs real-time fusion of modalities at each stage of feature extraction,enhancing feature representation at each level and preserving inter-level correlations for more effective *** continuous fusion strategy improves the model’s ability to detect subtle variations in encrypted traffic,while boosting its robustness and adaptability to evolving network *** results on two real-world encrypted traffic datasets demonstrate that our method achieves a classification accuracy of 98.23% and 97.63%,outperforming existing multimodal learning-based methods.

关键词： Deep fusion intrusion detection multimodal learning network traffic classification

来源：评论

学校读者我要写书评

暂无评论

Predicting circRNA-Disease Associations by Using Multi-Biomolecular Networks Based on Variational Graph Auto-Encoder with Attention Mechanism

引用

Chinese Journal of Electronics 2024年第6期33卷 1526-1537页

作者： Jing YANG Xiujuan LEI Yi PAN School of Computer Science Shaanxi Normal University Faculty of Computer Science and Control Engineering Shenzhen Institute of Advanced TechnologyChinese Academy of Sciences Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology

CircRNA-disease association(CDA) can provide a new direction for the treatment of diseases. However,traditional biological experiment is time-consuming and expensive, this urges us to propose the reliable computational model to predict the associations between circRNAs and diseases. And there is existing more and more evidence indicates that the combination of multi-biomolecular information can improve the prediction accuracy. We propose a novel computational model for CDA prediction named MBCDA, we collect the multi-biomolecular information including circRNA, disease, miRNA and lncRNA based on 6 databases, and construct three heterogeneous network among them, then the multi-heads graph attention networks are applied to these three networks to extract the features of circRNAs and diseases from different views, the obtained features are put into variational graph auto-encoder(VGAE) network to learn the latent distributions of the nodes, a fully connected neural network is adopted to further process the output of VGAE and uses sigmoid function to obtain the predicted probabilities of circRNA-disease *** a result, MBCDA achieved the values of AUC and AUPR under 5-fold cross-validation of 0.893 and 0.887. MBCDA was applied to the analysis of the top-25 predicted associations between circRNAs and diseases, these experimental results show that our proposed MBCDA is a powerful computational model for CDA prediction.

关键词： Knowledge engineering Attention mechanisms Computational modeling Biological system modeling Predictive models Feature extraction Heterogeneous networks Topology Data mining Diseases

来源：评论

学校读者我要写书评

暂无评论

Central Attention Mechanism for Convolutional Neural Networks

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2024年第10期51卷 1642-1648页

作者： Geng, Y.X. Wang, L. Wang, Z.Y. Wang, Y.G. School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China Automation Design Institute Metallurgical Engineering Technology Co. Ltd. Dalian116000 China

Model performance has been significantly enhanced by channel attention. The average pooling procedure creates skewness, lowering the performance of the network architecture. In the channel attention approach, average pooling is used to collect feature information to provide representative values. By leveraging the central limit theorem, we hypothesize that the strip-shaped average pooling operation will generate a one-dimensional tensor by considering the spatial position information of the feature map. The resulting tensor, obtained through average pooling, serves as the representative value for the features, mitigating skewness during the process. By incorporating the concept of the central limit theorem into the channel attention operation process, this study introduces a novel attention mechanism known as the"Central Attention Mechanism (CAM)." Instead of directly using average pooling to generate channel representative values, the central attention approach employs star-stripe average pooling to normalize multiple feature representative values into a single representative value. In this way, strip-shaped average pooling can be utilized to collect data and generate a one-dimensional tensor, while star-stripe average pooling can provide feature representative values based on different spatial directions. To generate channel attention for the complementary input features, the activation of the feature representation value is performed for each channel. Our attention approach is flexible and can be seamlessly incorporated into various traditional network structures. Through rigorous testing, we demonstrate the effectiveness of our attention strategy, which can be applied to a wide range of computer vision applications and outperforms previous attention techniques. © (2024), (International Association of Engineers). All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Online Convex Optimization with Switching Cost and Delayed Gradients

引用

Performance Evaluation Review 2024年第4期51卷 22-23页

作者： Senapati, Spandan Vaze, Rahul Department of Computer Science & Engineering Indian Institute of Technology Kanpur India School of Technology and Computer Science Tata Institute of Fundamental Research India

We consider the online convex optimization (OCO) problem with quadratic and linear switching cost when at time t only gradient information for functions fτ, τ 16(Lµ+5) for the quadratic switching cost, and also show the bound to be order-wise tight in terms of L, µ. In addition, we show that the competitive ratio of any online algorithm is at least max{Ω(L), Ω(pLµ )} when the switching cost is quadratic. For the linear switching cost, the competitive ratio of the OMGD algorithm is shown to depend on both the path length and the squared path length of the problem instance, in addition to L, µ, and is shown to be order-wise, the best competitive ratio any online algorithm can achieve. Copyright is held by author/owner(s).

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：