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

Harnessing the Power of Attention for Patch-Based Biomedical Image Classification

IEEE Access 2025年 13卷 36760-36774页

作者： Habib, Gousia Ahmad Malik, Ishfaq Qureshi, Shaima Ra, In-Ho Singh, Saurabh Sharma, Surbhi Department of Electrical Engineering New Delhi110016 India Shoolini University Yogananda School of AI Computer and Data Sciences Solan173229 India Department of Computer Science Engineering Srinagar190006 India Kunsan National University School of Computer Information and Communication Engineering Gunsan54150 Korea Republic of Woosong University Department of AI and Big Data Daejeon34606 Korea Republic of

The analysis of biomedical images, particularly brain MRI scans, is critical in healthcare and medical research. However, conventional approaches such as convolutional neural networks (CNNs) often struggle to capture complex spatial and contextual relationships within medical imaging data, limiting their generalization capabilities. To address these limitations, we propose a novel framework for brain MRI analysis using Vision Transformers (ViTs) augmented with a Shifted Patching Technique (S.P.T.). This approach combines conventional non-overlapping patching with shifted patching to better model intricate spatial dependencies and contextual associations. The proposed method is evaluated on the BRAIN MRI dataset, with standardized image resolution achieved through Lanczos5 interpolation. Further validation is performed on the ChestX-ray14 and Camelyon17 datasets to assess its generalizability across medical imaging modalities. Performance metrics such as accuracy, F1-score, and precision demonstrate that the proposed ViT model consistently outperforms traditional CNN-based methods. Ablation studies further confirm the significant contribution of the S.P.T. and other architectural components to overall performance. These findings highlight the potential of ViT-based architectures with innovative patching techniques as powerful tools for biomedical image analysis. This work offers a robust and scalable solution for enhancing diagnostic accuracy and advancing medical research applications. © 2013 IEEE.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Overlapping community-based fair influence maximization in social networks under open-source development model algorithm

引用

Artificial Intelligence Review 2025年第8期58卷 1-31页

作者： Wei, Pengcheng Yan, Bei Huang, Sixing Zhou, ZhiHong School of Artificial Intelligence Chongqing University of Education Chongqing400065 China School of Mathematics and Big Data Chongqing University of Posts and Telecommunications Chongqing China College of Computer Science and Technology Jilin Normal University Jilin Siping136000 China

The aim of Influence Maximization (IM) in social networks is to identify an optimal subset of users to maximize the spread of influence across the network. Fair Influence Maximization (FIM) develops the IM problem with the aim of equitable distribution of influence across communities and enhancing the fair propagation of information. Among the solutions for FIM, community-based techniques enhance performance by effectively capturing the structural properties and ensuring a more equitable influence spread. However, these techniques often ignore the overlapping nature of communities and suffer from a trade-off between complexity and fairness. With this motivation, this study handles the FIM based on Overlapping Community detection under optimization algorithms (FIMOC). FIMOC includes an overlapping community detection approach that can consider the importance of influential overlapping nodes in communities. Meanwhile, FIMOC uses a non-overlapping and overlapping node selection module based on communities to identify potential candidate nodes. Subsequently, FIMOC uses the Open-Source Development Model Algorithm (ODMA) as an optimization algorithm to identify the set of influential nodes. Our method considers the dynamic and overlapping nature of social communities, ensuring that the influence spread is not only maximized but also equitably distributed across diverse groups. By leveraging real‐world social networks, we demonstrate the effectiveness of our method compared to state-of-the-art methods through extensive experiments. The results show that our method achieves a more balanced influence spread, providing a fairer solution, while also enhancing the overall reach of information dissemination. © The Author(s) 2025.

关键词： Open access

来源：评论

学校读者我要写书评

暂无评论

Fine extraction of multi-crop planting area based on deep learning with Sentinel- 2 time-series data

引用

Environmental science and Pollution Research 2025年第19期32卷 11931-11949页

作者： Jiang, Jingmin Zhang, Jiahua Wang, Xue Zhang, Shichao Kong, Delong Wang, Xiaopeng Ali, Shawkat Ullah, Hidayat Space Information and Big Earth Data Research Center School of Computer Science and Technology Qingdao University Qingdao266071 China Key Laboratory of Digital Earth Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China

Accurate and timely access to the spatial distribution of crops is crucial for sustainable agricultural development and food security. However, extracting multi-crop areas based on high-resolution time-series data and deep learning still faces challenges. Therefore, this study aims to provide an effective model for multi-crop classification using high-resolution remote sensing time-series data. We designed two deep learning models based on convolutional neural network-long short-term memory (CNN-LSTM) and bidirectional long short-term memory (Bi-LSTM). The monthly synthetic time series of the normalized difference vegetation index (NDVI) from Sentinel-2 data will be used as input features to extract the multi-crop planting area in Shandong province’s northwestern, southwestern, and eastern regions. The results showed that deep learning models achieved higher accuracy compared to the random forest (RF) and extreme gradient boosting (XGBoost) models, with CNN-LSTM achieving the highest overall accuracy of 96.48%. At the county level, the coefficients of determination (R2) for the CNN-LSTM model were 0.91 for wheat, 0.88 for maize, and 0.73 for spring cotton. This study demonstrates that the CNN-LSTM model combined with monthly synthetic time-series NDVI provides a feasible approach for accurately mapping high-resolution multi-crop planting areas and also contributes significantly to decision support and resource management in agricultural production. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Deep learning High-resolution Monthly synthetic time-series NDVI Multi-crop classification Remote sensing Sentinel- 2

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Edge data Caching with Failure Tolerance and Popularity Awareness

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 5357-5369页

作者： Luo, Ruikun Zhang, Zujia He, Qiang Xu, Mengxi Chen, Feifei Dai, Xiaohai Wu, Song Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology China Deakin University School of Information Technology GeelongVIC3125 Australia

In the mobile edge computing environment, caching data in edge storage systems can significantly reduce data retrieval latency for users while saving the costs incurred by cloud-edge data transmissions for app vendors. Existing edge data caching (EDC) methods prioritize popular data and aim to minimize users' data retrieval latency and system storage costs jointly. However, these EDC methods often rely on the assumption that data popularity always follows certain distributions. As a result, they cannot properly adapt to the fluctuations in data popularity due to user mobility or unexpected increases in user demands. Meanwhile, unlike cloud data centers, complex and fragile edge servers are more likely to experience physical failures or network outages, presenting new challenges for EDC strategies. Specifically, when an edge server fails or experiences an outage, cached data may become temporarily unavailable, leading to increased latency as requests are redirected to alternative servers or the cloud. In this paper, to enable uncertainty-aware edge data caching (uEDC), we first model the problem as a robust optimization problem and propose an optimal algorithm named uEDC-B to find the optimal uEDC solution. To address the high computational complexity of uEDC-B, we introduce an approximate algorithm named uEDC-L based on linear decision rules. Theoretical analysis and extensive experiments on a real-world dataset demonstrate that the proposed methods outperform two state-of-the-art approaches in handling the uncertainties in data popularity and edge server failure with a significant performance improvement of 59.27% in data retrieval latency and 55.07% in data caching cost. © 2002-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

A power optimization approach for mixed polarity Reed–Muller logic circuits based on multi-strategy fusion memetic algorithm

引用

Frontiers of Information Technology & Electronic Engineering 2025年第3期26卷 415-426页

作者： Mengyu ZHANG Zhenxue HE Yijin WANG Xiaojun ZHAO Xiaodan ZHANG Limin XIAO Xiang WANG Intelligent griculturalquipment RearchInstitute Hebei Agricultural UniverityBaoding 071001China Key Laboratory of Agricultural Big Data of Hebei Province Hebei Agricultural UniversityBaoding 071001China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Electronic Information Engineering Beihang UniversityBeijing 100191China

The power optimization of mixed polarity Reed–Muller(MPRM)logic circuits is a classic combinatorial optimization *** optimization approaches often suffer from slow convergence and a propensity to converge to local optima,limiting their effectiveness in achieving optimal power ***,we propose a novel multi-strategy fusion memetic algorithm(MFMA).MFMA integrates global exploration via the chimp optimization algorithm with local exploration using the coati optimization algorithm based on the optimal position learning and adaptive weight factor(COA-OLA),complemented by population management through truncation ***,leveraging MFMA,we propose a power optimization approach for MPRM logic circuits that searches for the best polarity configuration to minimize circuit *** results based on Microelectronics Center of North Carolina(MCNC)benchmark circuits demonstrate significant improvements over existing power optimization *** achieves a maximum power saving rate of 72.30%and an average optimization rate of 43.37%;it searches for solutions faster and with higher quality,validating its effectiveness and superiority in power optimization.

关键词： Power optimization Multi-strategy fusion memetic algorithm(MFMA) Mixed polarity Reed-Muller(MPRM) Combinatorial optimization problem

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Adjacency Query Supporting Homoionym Search over Medical Graph data in Cloud Computing 17th

Privacy Preserving Adjacency Query Supporting Homoionym Sear...

引用

17th International Conference on Cloud Computing, CLOUD 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Li, Hourong Tian, Yun Wu, Bin Shi, Jiaoli School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China

ISBN: (纸本)9783031771521

Cloud computing is widely used in all walks of life today. Massive amounts of medical graph data are being outsourced to cloud servers to reduce overhead. The untrustworthiness of cloud servers puts the sensitive information of outsourced graph data at risk. To eliminate this security risk, it is an effective method to encrypt sensitive data. The adjacent queries are frequently used and highly valuable in graph data operations, and the adjacency query supporting homoionym search will enlarge the query effect and improve the query function. When the medical graph data is encrypted and stored on the cloud server, the operation of the data becomes extremely difficult. In this article, we propose a scheme to implement the adjacency query supporting homoionym search in cloud computing (AQHS), which maintains search contents privacy. We use a stem extraction algorithm and the searchable encryption mechanism to build secure index, and then achieve the adjacency query. The security of our proposed scheme is verified by formal analysis, and the effectiveness of the scheme is verified by experimental analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Architecture Search

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Arch...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Zhang, Binyan Ren, Ao Zhang, Zihao Duan, Moming Liu, Duo Tan, Yujuan Zhong, Kan College of Computer Science Chongqing University Chongqing China School of Big Data Software & Engineering Chongqing University Chongqing China Institute of Data Science National University of Singapore Singapore

ISBN: (纸本)9798350368741

With the rapid development of social media, sentiment analysis from multimodal posts has garnered significant attention in recent years. However, the substantial size of these models impedes their deployment on resource-constrained embedded devices. Although pruning has been extensively studied to reduce the size of unimodal models, specific challenges remain for Multimodal Sentiment Analysis (MSA) models. First, existing techniques prune fixed original models into sparse models, while our findings indicate that different model architectures of identical size yield varying performance outcomes. Second, prior studies fail to explore the unique characteristics of MSA models, resulting in suboptimal pruning performance. To address these challenges, we propose MPNAS, a unified pruning framework via Neural Architecture Search (NAS) for MSA models. Specifically, we formulate pruning as a NAS problem and analyze MSA model characteristics to guide the subnet search. We conduct an initial coarse-grained NAS on the original model, expanding the search space slightly to identify suitable subnets that enhance pruning rates and accuracy. Subsequently, we refine coarse-grained subnets in a fine-grained NAS stage, where MSA model characteristics guide the search process. Extensive experiments on three representative datasets demonstrate the superiority of our approach over existing methods. © 2025 IEEE.

关键词： Multimodal Compression NAS

来源：评论

学校读者我要写书评

暂无评论

SAMFNet: Scene-aware sampling and multi-stage fusion for multimodal 3D object detection

引用

Alexandria Engineering Journal 2025年 126卷 90-104页

作者： Wang, Baotong Xia, Chenxing Gao, Xiuju Ge, Bin Li, Kuan-Ching Fang, Xianjin Zhang, Yan Yang, Yuan College of Computer Science and Engineering Anhui University of Science and Technology Huainan232001 China College of Electrical and Information Engineering Anhui University of Science and Technology Huainan232001 China Department of Computer Science and Information Engineering Providence University Taichung43301 China The School of Electronics and Information Engineering Anhui University Hefei230039 China School of Mathematics and Big Data Anhui University of Science and Technology Huainan232001 China

Recently, multimodal 3D object detection (M3OD) that fuses the complementary information from LiDAR data and RGB images has gained significant attention. However, the inherent structural differences between point clouds and images pose fusion challenges, significantly hindering the exploration of correlations within multimodal data. To address this issue, this paper introduces an enhanced multimodal 3D object detection framework (SAMFNet), which leverages virtual point clouds generated from depth completion. Specifically, we design a scene-aware sampling module (SASM) that employs tailored sampling strategies for different bins based on the density distribution of point clouds. This effectively alleviates the detection bias problem while ensuring the key information of virtual points, significantly reducing the computational cost. In addition, we introduce a multi-stage feature fusion module (MSFFM) that embeds point-level and regional-adaptive feature fusion strategies to generate more informative multimodal features by fusing features with different granularities. To further improve the accuracy of model detection, we also introduce a confidence prediction branch unit (CPBU), which improves the detection accuracy by predicting the confidence of feature classification in the intermediate stage. Extensive experiments on the challenging KITTI dataset demonstrate the validity of our model. © 2025 The Authors

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

Subpart Suppression Network for Few-Shot Object Counting

Subpart Suppression Network for Few-Shot Object Counting

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Lanxin Liu, Xinyan Li, Guorong School of Computer Science and Technology Key Lab of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China School of Computer Science and Technology Harbin Institute of Technology Weihai China

ISBN: (纸本)9798350368741

Few-shot object counting and detection aim to count objects along with their bounding boxes specified by exemplar bounding boxes. Current mainstream methods predict density maps by applying similarity between exemplar and image features to get counting results and detecting peak points from the density map as the positions of objects. However, the sub-parts of objects can also have high similarity to the exemplars, harming the counting and detection performance. To address these issues, we propose a two-stage Subpart Suppression Network (SSN), consisting of a Subpart Suppression Density map Predictor (SSDP), which enforces the model focus on whole objects rather than subparts, and a SAM-based Detector and Verifier, which refines the final prediction by a clustering method. Extensive experiments on two popular datasets show an advantage in performance over the state-of-the-art methods and prove the components' effectiveness. © 2025 IEEE.

关键词： Counting Detection Few-Shot Localization

来源：评论

学校读者我要写书评

暂无评论

Secret Sharing Based Key Agreement Protocol for Body Area Networks 18th

Secret Sharing Based Key Agreement Protocol for Body Area N...

引用

18th International Conference on Wireless Artificial Intelligent Computing Systems and Applications, WASA 2024

作者： Sheng, Weihong Cai, Bin Hu, Chunqiang Li, Ruinian School of Big Data and Software Engineering Chongqing University Chongqing China Computer Science Department Bowling Green State University Bowling Green United States

ISBN: (纸本)9783031714634

In order to provide more comprehensive medical services and personalized health monitoring according to individual needs, Body Area Networks (BANs) have been extensively studied by many researchers. As BANs involve the transmission of personal private data, the security of the communication is of utmost importance. Unfortunately, existing encryption techniques cannot be directly applied with the limited power or computation ability of the sensors in BANs. An alternative direction is to use physiological signals for key agreement. However, many of the current physiological signal-based key agreement schemes either have high overheads or are vulnerable to certain security issues. In this paper, we proposed a novel secret sharing and Bloom filter based key agreement scheme that balances overhead and security for BANs. Also, we use an approximate hash table to free ourselves from the problem of dependence on the ordering of features, which has been neglected by previous researchers. We validate the security of our scheme with based on real datasets and compare overheads with other solutions. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：