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

A recover-then-discriminate framework for robust anomaly detection

science China(Information sciences) 2025年第4期68卷 300-318页

作者： Peng XING Dong ZHANG Jinhui TANG Zechao LI School of Computer Science and Engineering Nanjing University of Science and Technology Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology

Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.

关键词： recovery network HOG prompt discriminative network self-correlation loss anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving filtering, control and optimization for industrial cyber-physical systems

引用

science China(Information sciences) 2025年第4期68卷 267-283页

作者： Derui DING Qing-Long HAN Xiaohua GE Xian-Ming ZHANG Jun WANG Department of Control Science and Engineering University of Shanghai for Science and Technology School of Engineering Swinburne University of Technology Department of Computer Science City University of Hong Kong

Industrial cyber-physical systems closely integrate physical processes with cyberspace, enabling real-time exchange of various information about system dynamics, sensor outputs, and control decisions. The connection between cyberspace and physical processes results in the exposure of industrial production information to unprecedented security risks. It is imperative to develop suitable strategies to ensure cyber security while meeting basic performance *** the perspective of control engineering, this review presents the most up-to-date results for privacy-preserving filtering,control, and optimization in industrial cyber-physical systems. Fashionable privacy-preserving strategies and mainstream evaluation metrics are first presented in a systematic manner for performance evaluation and engineering *** discussion discloses the impact of typical filtering algorithms on filtering performance, specifically for privacy-preserving Kalman filtering. Then, the latest development of industrial control is systematically investigated from consensus control of multi-agent systems, platoon control of autonomous vehicles as well as hierarchical control of power systems. The focus thereafter is on the latest privacy-preserving optimization algorithms in the framework of consensus and their applications in distributed economic dispatch issues and energy management of networked power systems. In the end, several topics for potential future research are highlighted.

关键词： industrial cyber-physical systems privacy preservation distributed control distributed optimization power systems

来源：评论

学校读者我要写书评

暂无评论

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

引用

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen School of Electrical and Electronic Engineering Nanyang Technological University School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Science and Engineering East China University of Science and Technology Department of Electrical and Computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

Multi-View Test-Time Adaptation for Semantic Segmentation in Clinical Cataract Surgery

引用

IEEE Transactions on Medical Imaging 2025年第5期44卷 2307-2318页

作者： Li, Heng Ou, Mingyang Li, Haojin Qiu, Zhongxi Niu, Ke Fu, Huazhu Liu, Jiang Southern University of Science and Technology Research Institute of Trustworthy Autonomous Systems Shenzhen518055 China Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen518055 China Beijing Information Science and Technology University Computer School Beijing100192 China Institute of High Performance Computing Agency for Science Technology and Research Fusionopolis Way 138632 Singapore Southern University of Science and Technology Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Shenzhen518055 China

Cataract surgery, a widely performed operation worldwide, is incorporating semantic segmentation to advance computer-assisted intervention. However, the tissue appearance and illumination in cataract surgery often differ among clinical centers, intensifying the issue of domain shifts. While domain adaptation offers remedies to the shifts, the necessity for data centralization raises additional privacy concerns. To overcome these challenges, we propose a Multi-view Test-time Adaptation algorithm (MUTA) to segment cataract surgical scenes, which leverages multi-view learning to enhance model training within the source domain and model adaptation within the target domain. In the training phase, the segmentation model is equipped with multi-view decoders to boost its robustness against variations in cataract surgery. During the inference phase, test-time adaptation is implemented using multi-view knowledge distillation, enabling model updates in clinics without data centralization or privacy concerns. We conducted experiments in a simulated cross-center scenario using several cataract surgery datasets to evaluate the effectiveness of MUTA. Through comparisons and investigations, we have validated that MUTA effectively learns a robust source model and adapts the model to target data during the practical inference phase. © 1982-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Test Case Optimization using Machine Learning based Hybrid Meta-Heuristic Approach

引用

Journal of Electronic Testing: Theory and Applications (JETTA) 2025年 1-20页

作者： Rao, Gajender Nandal, Deepak Research Scholar Department of Computer Science and Engineering Guru Jambheshwar University of Science and Technology Hisar India Department of Computer Science and Engineering Guru Jambheshwar University of Science and Technology Hisar India

Software testing is a critical task that can be used to ensure the quality of the end product. Different types of applications process the input data with respect to a specific operation and its outcomes are generated accordingly. It is essential to test each application as per the supported functionality, and it is also necessary to optimize the test cases for applications to reduce the computational cost. To achieve this goal, there is a need to design different test cases as well as an intelligent solution is required to select and optimize the test cases according to the requirements. Particle swarm optimization (PSO) and Genetic Algorithm (GA) both are capable enough to produce the optimal solutions for software testing. However, there is no provision to perform the classification over their outcomes with respect to test case optimization using machine learning support. This paper presents a hybrid meta-heuristic method that selects the test cases on behalf of their attributes as well as it also performs classification over the test cases under the constraints of the test case’s attributes. For experiments, different classifiers are used (i.e. k-nearest neighbour (KNN), Decision Tree (DT), Logistic Regression (LOG), Support Vector Machine (SVM), Gaussian Naive Bayes (GNB), Stochastic gradient descent (SGD) and Random Forest (RDF) etc.) and analysis shows that GNB and SGD classifiers both have optimal accuracy, precision & recall values. As compared to existing algorithms, i.e. traditional PSO and Genetic algorithm, it outperforms in terms of optimal number of detected errors (1821), error rate (91.05) and coverage rate (90.86363636). The Proposed scheme can be extended to optimize the test cases for other software types, along with real-time interaction and dataset updation support for software testers. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Random forests

来源：评论

学校读者我要写书评

暂无评论

A survey on cross-user federated recommendation

引用

science China(Information sciences) 2025年第4期68卷 7-32页

作者： Enyue YANG Yudi XIONG Wei YUAN Weike PAN Qiang YANG Zhong MING College of Computer Science and Software Engineering Shenzhen University School of Electrical Engineering and Computer Science The University of Queensland WeBank AI Lab WeBank Department of Computer Science and Engineering Hong Kong University of Science and Technology College of Big Data and Internet Shenzhen Technology University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)

Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.

关键词： cross-user federated recommendation federated recommendation federated learning recommender systems user privacy

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Referring Video Single- and Multi-Object Segmentation Via Cross-Modal Affinity with Instance Sequence Matching

引用

International Journal of computer Vision 2025年 1-19页

作者： Liu, Heng Li, Guanghui Gao, Mingqi Zhen, Xiantong Zheng, Feng Wang, Yang School of Computer Science and Technology Anhui University of Technology Maxiang Road Ma’anshan243032 China Department of Computer Science and Engineering Southern University of Science and Technology Xueyuan Avenue Shenzhen518055 China School of Computer Science and Information Engineering Hefei University of Technology Feicui Road Hefei230601 China

Referring Video Object Segmentation (RVOS) aims to segment specific objects in videos based on the provided natural language descriptions. As a new supervised visual learning task, achieving RVOS for a given scene requires a substantial amount of annotated data. However, only minimal annotations are usually available for new scenes in realistic scenarios. Another practical problem is that, apart from a single object, multiple objects of the same category coexist in the same scene. Both of these issues may significantly reduce the performance of existing RVOS methods in handling real-world applications. In this paper, we propose a simple yet effective model to address these issues by incorporating a newly designed cross-modal affinity (CMA) module based on a Transformer architecture. The CMA module facilitates the establishment of multi-modal affinity over a limited number of samples, allowing the rapid acquisition of new semantic information while fostering the model’s adaptability to diverse scenarios. Furthermore, we extend our FS-RVOS approach to multiple objects through a new instance sequence matching module over CMA, which filters out all object trajectories with similarity to language features that exceed a matching threshold, thereby achieving few-shot referring multi-object segmentation (FS-RVMOS). To foster research in this field, we establish a new dataset based on currently available datasets, which covers many scenarios in terms of single-object and multi-object data, hence effectively simulating real-world scenes. Extensive experiments and comparative analyses underscore the exceptional performance of our proposed FS-RVOS and FS-RVMOS methods. Our method consistently outperforms existing related approaches through practical performance evaluations and robustness studies, achieving optimal performance on metrics across diverse benchmark tests. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

science China(Information sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Optimizing medical image analysis through MViTX on multiple datasets with explainable AI

引用

Neural Computing and Applications 2025年第14期37卷 8479-8507页

作者： Sheakh, Md. Alif Tahosin, Mst. Sazia Alam, Mohammad Jahangir Begum, Mahbuba Department of Computer Science and Engineering Daffodil International University Dhaka Bangladesh Department of Computer Science and Engineering Mawlana Bhashani Science and Technology University Tangail Bangladesh

Cancer remains a leading cause of mortality worldwide, with early detection and accurate diagnosis critical to improving patient outcomes. While computer-aided diagnosis systems powered by deep learning have shown considerable promise, their widespread clinical adoption faces significant challenges in maintaining consistent performance across diverse imaging modalities and datasets. This research addresses the critical challenge of developing robust, generalizable deep learning models by proposing a comprehensive framework utilizing seven diverse medical imaging datasets encompassing fundus photography, histopathology, endoscopy, and MRI, covering diseases such as ocular toxoplasmosis, endometrial cancer, colorectal cancer, gastrointestinal disease, breast cancer, brain tumor, and tympanic membrane conditions. Our methodology combines customized data augmentation strategies (photometric, geometric, and elastic transformations) with an optimized vision transformer with external attention (MViTX) architecture. The MViTX model demonstrated exceptional performance with test accuracies ranging from 94.1 to 99.1% across all datasets, achieving superior metrics in accuracy, precision, recall, F1-score, and AUC compared to state-of-the-art CNNs. The model's effectiveness was further validated through ablation studies and explainable AI techniques, while its practical utility was demonstrated through deployment as a user-friendly web application. Our research establishes the effectiveness of combining tailored data augmentation with attention-based transformer architectures for medical image analysis, representing a significant step toward enhancing healthcare professionals' diagnostic capabilities and ultimately improving patient care outcomes. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

A Base Station Deployment Algorithm for Wireless Positioning Considering Dynamic Obstacles

引用

computers, Materials & Continua 2025年第3期82卷 4573-4591页

作者： Aiguo Li Yunfei Jia Department of Network Engineering Xi’an University of Science and TechnologyXi’an710600China College of Computer Science and Technology Xi’an University of Science and TechnologyXi’an710600China

In the context of security systems,adequate signal coverage is paramount for the communication between security personnel and the accurate positioning of *** studies focus on optimizing base station deployment under the assumption of static obstacles,aiming to maximize the perception coverage of wireless RF(Radio Frequency)signals and reduce positioning blind ***,in practical security systems,obstacles are subject to change,necessitating the consideration of base station deployment in dynamic ***,research in this area still needs to be *** paper proposes a Dynamic Indoor Environment Beacon Deployment Algorithm(DIE-BDA)to address this *** algorithm considers the dynamic alterations in obstacle locations within the designated *** determines the requisite number of base stations,the requisite time,and the area’s practical and overall signal coverage *** experimental results demonstrate that the algorithm can calculate the deployment strategy in 0.12 s following a change in obstacle *** results show that the algorithm in this paper requires 0.12 s to compute the deployment strategy after the positions of obstacles *** 13 base stations,it achieves an effective coverage rate of 93.5%and an overall coverage rate of 97.75%.The algorithm can rapidly compute a revised deployment strategy in response to changes in obstacle positions within security systems,thereby ensuring the efficacy of signal coverage.

关键词： Wireless positioning base station deployment dynamic obstacles dynamic obstacle wireless positioning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：