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

Forgery-Aware Adaptive Learning With Vision Transformer for Generalized Face Forgery Detection

IEEE Transactions on Circuits and systems for Video Technology 2025年第5期35卷 4116-4129页

作者： Luo, Anwei Cai, Rizhao Kong, Chenqi Ju, Yakun Kang, Xiangui Huang, Jiwu Kot, Alex C. Sun Yat-sen University School of Computer Science and Engineering Guangzhou510006 China Jiangxi University of Finance and Economics School of Computing and Artificial Intelligence Nanchang330013 China Laboratory School of Electrical and Electronic Engineering Jurong West 639798 Singapore Sun Yat-sen University Guangdong Key Laboratory of Information Security School of Computer Science and Engineering Guangzhou510006 China Shenzhen MSU-BIT University Guangdong Laboratory of Machine Perception and Intelligent Computing Faculty of Engineering Shenzhen518116 China China-Singapore International Joint Research Institute Guangzhou China

With the rapid progress of generative models, the current challenge in face forgery detection is how to effectively detect realistic manipulated faces from different unseen domains. Though previous studies show that pre-trained Vision Transformer (ViT) based models can achieve some promising results after fully fine-tuning on the Deepfake dataset, their generalization performances are still unsatisfactory. To this end, we present a Forgery-aware Adaptive Vision Transformer (FA-ViT) under the adaptive learning paradigm for generalized face forgery detection, where the parameters in the pre-trained ViT are kept fixed while the designed adaptive modules are optimized to capture forgery features. Specifically, a global adaptive module is designed to model long-range interactions among input tokens, which takes advantage of self-attention mechanism to mine global forgery clues. To further explore essential local forgery clues, a local adaptive module is proposed to expose local inconsistencies by enhancing the local contextual association. In addition, we introduce a fine-grained adaptive learning module that emphasizes the common compact representation of genuine faces through relationship learning in fine-grained pairs, driving these proposed adaptive modules to be aware of fine-grained forgery-aware information. Extensive experiments demonstrate that our FA-ViT achieves state-of-the-arts results in the cross-dataset evaluation, and enhances the robustness against unseen perturbations. Particularly, FA-ViT achieves 93.83% and 78.32% AUC scores on Celeb-DF and DFDC datasets in the cross-dataset evaluation. © 1991-2012 IEEE.

关键词： Forgery Faces Adaptation models Transformers Feature extraction Adaptive learning computer vision Face recognition Deepfakes Visualization

来源：评论

学校读者我要写书评

暂无评论

PMSE-YOLO: an efficient framework for detecting surface defects of hot-rolled strip steel

引用

Signal, Image and Video Processing 2025年第7期19卷 1-13页

作者： Zhou, Mengran Wang, Ruiyan Chen, Yue School of Electrical and Information Engineering Anhui University of Science and Technology Anhui Huainan232001 China State Key Laboratory of Mining Response and Disaster Prevention and Control in Deep Coal Mines Anhui University of Science and Technology Anhui Huainan232001 China

To address the issues of omission, and low algorithmic accuracy in detecting surface defects of hot-rolled strip steel in complex backgrounds, this paper proposes the PMSE-YOLO surface defect detection algorithm. First, to enhance the model’s ability to extract multi-scale features, the CSP_PMS structure is designed to optimize the C2f structure in the Backbone, improving feature extraction for multi-scale targets. Second, to preserve the semantic information of small targets in the Neck, the EfficientRepBiPAN structure is adopted, utilizing cross-layer connections to enhance multi-scale feature representation and achieve small target feature fusion. Finally, the Wise-ShapeIoU loss function is incorporated to enhance the model’s detection performance. Experimental validation on the NEU-DET dataset demonstrates that PMSE-YOLO reduces parameter by 17% and computational cost by 18.5%, while improving mAP@0.5 by 3.1 to 82.2% compared to baseline network. PMSE-YOLO balances lightweight design and real-time performance while enhancing surface defect detection accuracy for hot-rolled strips, facilitating deployment on edge devices. Furthermore, experimental results on the GC10-DET dataset confirm the superior generalization capability of the proposed model. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A survey on deep learning for polyp segmentation: techniques, challenges and future trends

引用

Visual Intelligence 2025年第1期3卷 1-20页

作者： Mei, Jiaxin Zhou, Tao Huang, Kaiwen Zhang, Yizhe Zhou, Yi Wu, Ye Fu, Huazhu PCA Lab Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China School of Computer Science and Engineering Southeast University Nanjing China Institute of High Performance Computing A*STAR Singapore Singapore

Early detection and assessment of polyps play a crucial role in the prevention and treatment of colorectal cancer (CRC). Polyp segmentation provides an effective solution to assist clinicians in accurately locating and segmenting polyp regions. In the past, people often relied on manually extracted lower-level features such as color, texture, and shape, which often had problems capturing global context and lacked robustness to complex scenarios. With the advent of deep learning, more and more medical image segmentation algorithms based on deep learning networks have emerged, making significant progress in the field. This paper provides a comprehensive review of polyp segmentation algorithms. We first review some traditional algorithms based on manually extracted features and deep segmentation algorithms, and then describe benchmark datasets related to the topic. Specifically, we carry out a comprehensive evaluation of recent deep learning models and results based on polyp size, taking into account the focus of research topics and differences in network structures. Finally, we discuss the challenges of polyp segmentation and future trends in the field. © The Author(s) 2025.

关键词： Comprehensive evaluation Deep learning Medical imaging Polyp segmentation

来源：评论

学校读者我要写书评

暂无评论

Semantic Feature Division Multiple Access for Digital Semantic Broadcast Channels

引用

IEEE Internet of Things Journal 2025年第11期12卷 17123-17136页

作者： Ma, Shuai Sun, Zhiye Shen, Bin Wu, Youlong Li, Hang Shi, Guangming Li, Shiyin Al-Dhahir, Naofal Peng Cheng Laboratory Shenzhen518066 China China University of Mining and Technology School of Information and Control Engineering Xuzhou221116 China ShanghaiTech University School of Information Science and Technology Shanghai201210 China Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China Xidian University School of Artificial Intelligence Shaanxi Xi'an710071 China The University of Texas at Dallas Department of Electrical and Computer Engineering RichardsonTX75080 United States

In this paper, we propose a digital semantic feature division multiple access (SFDMA) paradigm in multi-user broadcast (BC) networks for the inference and the image reconstruction tasks. In this SFDMA scheme, the multi-user semantic information is encoded into discrete approximately orthogonal representations, and the encoded semantic features of multiple users can be simultaneously transmitted in the same time-frequency resource. Specifically, for inference tasks, we design a SFDMA digital BC network based on robust information bottleneck (RIB), which can achieve a tradeoff between inference performance, data compression and multi-user interference. Moreover, for image reconstruction tasks, we develop a SFDMA digital BC network by utilizing a Swin Transformer, which significantly reduces multi-user interference. More importantly, SFDMA can protect the privacy of users' semantic information, in which each receiver can only decode its own semantic information. Furthermore, we establish a relationship between performance and signal to interference plus noise ratio (SINR), which is fitted by an Alpha-Beta-Gamma (ABG) function. Furthermore, an optimal power allocation method is developed for the inference and reconstruction tasks. Extensive simulations verify the effectiveness and superiority of our proposed SFDMA scheme. © 2014 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

A Novel Consensus Mechanism Based on Dynamic Sharding 20th

A Novel Consensus Mechanism Based on Dynamic Sharding

引用

20th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2024

作者： Zhang, Jingyu Teng, Yilong Sun, Yongtao Zhu, Shi Yang, Fangliao Luo, Lailong School of Computer and Communication Engineering Changsha University of Science and Technology Changsha China Science and Technology on Information Systems Engineering Laboratory School of Systems Engineering National University of Defense Technology Changsha China Data Operations Center State Grid Hunan Electric Power Information and Communication Corporation Hunan Changsha China

ISBN: (纸本)9789819628292

Blockchain, as an emerging technology, has been widely studied by the researchers from academia and industry. Alliance chain, as an important form of blockchain, is often applied to smart grids, smart city and the Internet of Things to ensure the authenticity and reliability of data. Practical Byzantine Fault Tolerance (PBFT) algorithm is a key technology to ensure data consistency in the alliance chains, and it plays a critical role in improving system performance, security and scalability. However, with the increase of the number of nodes and transactions, the ability of PBFT to process transactions is challenged. In particular, PBFT’s linear transaction processing also limits its ability to process transactions in parallel. In view of the problems existing in PBFT, this paper studies the consensus mechanism optimization, and puts forward a consensus mechanism with better performance. In this paper, in order to solve the problem of weak parallel transaction processing capability of PBFT, we propose a novel Consensus Mechanism based on Dynamic Sharding (CMDS). CMDS firstly constructs a dynamic fragmentation model based on consistent hash algorithm to segment nodes, and then constructs a voting consensus mechanism based on reputation weight to achieve global state consistency. The experimental results show that CMDS can significantly improve the ability of parallel transaction processing and the performance of blockchain system. © IFIP International Federation for information Processing 2025.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Design and Performance Analysis of a Series-Parallel Self-Aligning Index Finger Exoskeleton

引用

IEEE Robotics and Automation Letters 2025年第6期10卷 6456-6463页

作者： Sun, Ning Wang, Zelong Cheng, Long Li, Houcheng Niu, Ben Sun, Xijin Li, Ke Shandong Normal University School of Information Science and Engineering Jinan China Chinese Academy of Sciences State Key Laboratory of Management and Control for Complex Systems Institute of Automation Beijing China University of Chinese Academy of Sciences School of Artificial Intelligence Beijing China Shandong University Institute of Intelligent Medical Engineering School of Control Science and Engineering Jinan China

Hand exoskeletons have become increasingly crucial for the rehabilitation of hand function, as relevant studies have shown that using the exoskeletons to assist in rehabilitation training can improve hand motor function. However, developing a human-robot kinematic compatibility exoskeleton while providing sufficient assistance torque is still a challenge. This paper develops a series-parallel self-aligning index finger exoskeleton to assist the index finger in flexion/extension and adduction/abduction training. A series-parallel mechanism driven by two motors simultaneously was proposed for the metacarpophalangeal (MCP) joint, which can ensure human-robot joint axes self-alignment and increase the joint assistance torque. A kinematic compatibility analysis method was proposed, and the kinematic compatibility of the series-parallel mechanism was analyzed. The degrees of freedom and forward kinematics of the proposed mechanism were analyzed, and its workspace was calculated, which results show that the motion range of the MCP joint can meet the grasping training requirements. Preliminary experiments were carried out, and the results indicate that the motion trajectory coefficients of the marker points at the MCP, PIP, and DIP joints averaged for all subjects with and without the proposed exoskeleton are 0.993, 0.956, and 0.939, respectively, which can verify the kinematic transparency of the proposed mechanism. The assistance torque generated by the proposed mechanism on the MCP joint can meet the joint assistance torque requirements. In a word, the proposed exoskeleton can achieve flexion/extension and adduction/abduction training, human-robot joint axes self-alignment, and provide sufficient assistance torque. © 2016 IEEE.

关键词： Exoskeleton (Robotics)

来源：评论

学校读者我要写书评

暂无评论

Detection of Perfect Stealthy Attacks on Cyber-Physical systems Subject to Measurement Quantizations: A Watermark-Based Strategy

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 114-125页

作者： Yu-Ang Wang Zidong Wang Lei Zou Bo Shen Hongli Dong the College of Information Science and Technology Donghua University the Engineering Research Center of Digitalized Textile and Fashion Technology Ministry of Education IEEE the College of Electrical Engineering and Automation Shandong University of Science and Technology the Department of Computer Science Brunel University London Uxbridge the Sanya Offshore Oil and Gas Research Institute Northeast Petroleum University the Artificial Intelligence Energy Research Institute Northeast Petroleum University Heilongjiang Provincial Key Laboratory of Networking and Intelligent Control Northeast Petroleum University

In this paper, the attack detection problem is investigated for a class of closed-loop systems subjected to unknownbutbounded noises in the presence of stealthy attacks. The measurement outputs from the sensors are quantized before transmission.A specific type of perfect stealthy attack, which meets certain rather stringent conditions, is taken into account. Such attacks could be injected by adversaries into both the sensor-toestimator and controller-to-actuator channels, with the aim of disrupting the normal data flow. For the purpose of defending against these perfect stealthy attacks, a novel scheme based on watermarks is developed. This scheme includes the injection of watermarks(applied to data prior to quantization) and the recovery of data(implemented before the data reaches the estimator).The watermark-based scheme is designed to be both timevarying and hidden from adversaries through incorporating a time-varying and bounded watermark signal. Subsequently, a watermark-based attack detection strategy is proposed which thoroughly considers the characteristics of perfect stealthy attacks,thereby ensuring that an alarm is activated upon the occurrence of such attacks. An example is provided to demonstrate the efficacy of the proposed mechanism for detecting attacks.

关键词： Attack detection cyber-physical systems (CPSs) perfect stealthy attacks watermark-based strategy

来源：评论

学校读者我要写书评

暂无评论

Accurate, Secure, and Efficient Semi-Constrained Navigation Over Encrypted City Maps

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2642-2658页

作者： Li, Meng Chen, Yifei Gao, Jianbo Wu, Jingyu Zhang, Zijian He, Jialing Zhu, Liehuang Conti, Mauro Lin, Xiaodong Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei230002 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230002 China Hefei University of Technology Anhui Province Key Laboratory of Industry Safety and Emergency Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei230002 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100811 China University of Science and Technology of China School of Computer Science and Technology Hefei230026 China Beijing Institute of Technology Southeast Institute of Information Technology Fujian Putian351100 China Chongqing University College of Computer Science Chongqing400044 China University of Padua Department of Mathematics HIT Center Padua35131 Italy Delft University of Technology Faculty of Electrical Engineering Mathematics and Computer Science Delft2628 CD Netherlands University of Guelph School of Computer Science GuelphONN1G 2W1 Canada

Navigation services enable users to find the shortest path from a starting point S to a destination D, reducing time, gas, and traffic congestion. Still, navigation users risk the exposure of their sensitive location data. Our motivation arises from how users can accurately, securely, and efficiently navigate from S to Dwhile passing through k unordered stops, i.e., midway locations with a non-fixed visiting order. In this work, we formally define Semi-Constrained Navigation (SCN) and present a novel scheme Hermestoachieveaccurate,secure, andefficient SCN. Specifically, weproposeadivide-and-conquerapproachtostrikeagoodbalance betweenaccuracyandefficiency. It recursively depth-first-searches the whole area (a navigation tree) and invokes five carefully-crafted strategies stop-by-stop to compute three subpaths in three se quential subareas. We construct a path-distance oracle to encrypt the road graph and securely implement the strategies by using homomorphic encryption and garble circuits. We formally prove the security in the random oracle model and analyze the search complexity to be less than O(k2). We experiment over a real-world city map and compare with six baselines. Results show that path search with k = 4 among N = 1000 intersections requires 5.58 seconds with a 3.2% distance deviation rate and an 82.5% path similarity. © 2004-2012 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Prediction of Coefficient of Friction in Wet Friction Components: A Model Development and Interpretability Analysis

引用

Journal of Tribology 2025年第7期147卷 074601页

作者： Wu, Jianpeng Zhao, Peng Cui, Jiahao Wang, Liyong Yang, Chengbing Ouyang, Jianping Key Laboratory of Modern Measurement and Control Technology Ministry of Education Beijing Information Science and Technology University 12 Xiaoying East Road Haidian District Beijing100192 China School of Mechanical and Engineering University of Science and Technology Beijing 30 Xueyuan Road Haidian District Beijing100083 China Mechanical Electrical Engineering School Beijing Information Science and Technology University 12 Xiaoying East Road Haidian District Beijing100192 China

Predicting the coefficient of friction (COF) is essential for enhancing the efficiency and reliability of mechanical systems. Nevertheless, traditional mechanistic models relying on fixed values or fitted curves fail to accurately capture this complexity. To address this issue, this paper proposes a model for predicting the COF of wet friction components using an extreme gradient boosting (XGBoost) algorithm optimized by the sparrow search algorithm (SSA). This model effectively captures the nonlinear relationships among relative speed, pressure, temperature, and COF. As a result, the proposed SSA-XGBoost model exhibits excellent predictive performance with a root mean square error (RMSE) of only 0.063, and 88.3% of the COF predictions have a relative error of less than 1%, significantly outperforming other deep-learning algorithms. Additionally, to enhance the understanding of the COF prediction results for wet friction components, the SHapley Additive exPlanations (SHAP) model is used to explore the influence of relative speed, pressure, and temperature on the predicted COF values. Copyright © 2024 by ASME.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Mask-guided Multi-scale Spatial-Spectral Transformer for Snapshot Compressive Imaging

Mask-guided Multi-scale Spatial-Spectral Transformer for Sna...

引用

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

作者： Yin, Heyuan Yang, Jingxiang Liu, Jia Xiao, Liang School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Key Laboratory of Analysis of Mathematical Theory and Modeling of Complex Systems Ministry of Industry and Information Technology China

ISBN: (纸本)9798350368741

Effectively reconstructing 3D hyperspectral images (HSIs) from 2D measurements presents a significant challenge in Coded Aperture Snapshot Spectral Imaging (CASSI) systems. While recent transformers exhibit potential in HSI reconstruction, they often suffer from inadequate exploration of multi-scale spatial-spectral self-similarity, leading to mean effects and information loss. Additionally, these methods struggle with insufficient modeling of the degradation inherent in the compressive imaging process. To address these issues, we propose a novel Mask-guided Multi-scale Spatial-Spectral Transformer (MMSST). Specifically, we introduce a Degradation Aware Mask Attention (DAMA) module to incorporate degradation information of the compressive imaging process. Furthermore, MMSST leverages Local-Regional SpAtial attention (LRSA) and Global-Regional SpEctral attention (GRSE) to effectively exploit multi-scale self-similarity across spatial and spectral dimensions. Extensive experimental results demonstrate the effectiveness of our MMSST. © 2025 IEEE.

关键词： hyperspectral reconstruction Snapshot Compressive Imaging spatial-spectral transformer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：