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

NaFV-Net: An Adversarial Four-view Network for Mammogram Classification 39

学校读者我要写书评

暂无评论

NaFV-Net: An Adversarial Four-view Network for Mammogram Cla...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Lu, Feng Hou, Yuxiang Li, Wei Yang, Xiangying Zheng, Haibo Luo, Wenxi Chen, Leqing Cao, Yuyang Liao, Xiaofei Zhang, Yu Yang, Fan Zomaya, Albert Jin, Hai 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 Huazhong University of Science and Technology China Australia-China Joint Research Centre for Energy Informatics and Demand Response Technologies Centre for Distributed and High Performance Computing School of Computer Science University of Sydney Australia Tongji Hospital Tongji Medical College Huazhong University of Science and Technology China

ISBN: (纸本)157735897X

Breast cancer remains a leading cause of mortality among women, with millions of new cases diagnosed annually. Early detection through screening is crucial. Using neural networks to improve the accuracy of breast cancer screening has become increasingly important. In accordance with radiologists’ practices, we propose using images from the unaffected side to create adversarial samples with critical medical implications in our adversarial learning process. By introducing beneficial perturbations, this method aims to reduce overconfidence and improve the precision and robustness of breast cancer classification. Our proposed framework is an adversarial four-view classification network (NaFV-Net) incorporating images from both affected and unaffected perspectives. By comprehensively capturing local and global information and implementing adversarial learning from four mammography views, this framework allows for the fusion of features and the integration of medical principles and radiologist evaluation techniques, thus facilitating the accurate identification and characterization of breast tissues. Extensive experiments have shown the high effectiveness of our model in accurately distinguishing between benign and malignant findings, demonstrating state-of-the-art classification performance on both internal and public datasets. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Mammography

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Zhen Zhang, Ruqian Zou, Deqing Wang, Ning Li, Yating Xu, Shouhuai Chen, Chen Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science University of Colorado Colorado Springs United States Center for Research in Computer Vision University of Central Florida United States School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier;the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

Simplify Implant Depth Prediction as Video Grounding: A Texture Perceive Implant Depth Prediction Network

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Xinquan Li, Xuguang Luo, Xiaoling Zeng, Leilei Zhang, Yudi Shen, Linlin Deng, Yongqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China AI Research Center for Medical Image Analysis and Diagnosis Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Stomatology Shenzhen University General Hospital Shenzhen China

Surgical guide plate is an important tool for the dental implant surgery. However, the design process heavily relies on the dentist to manually simulate the implant angle and depth. When deep neural networks have been applied to assist the dentist quickly locates the implant position, most of them are not able to determine the implant depth. Inspired by the video grounding task which localizes the starting and ending time of the target video segment, in this paper, we simplify the implant depth prediction as video grounding and develop a Texture Perceive Implant Depth Prediction Network (TPNet), which enables us to directly output the implant depth without complex measurements of oral bone. TPNet consists of an implant region detector (IRD) and an implant depth prediction network (IDPNet). IRD is an object detector designed to crop the candidate implant volume from the CBCT, which greatly saves the computation resource. IDPNet takes the cropped CBCT data to predict the implant depth. A Texture Perceive Loss (TPL) is devised to enable the encoder of IDPNet to perceive the texture variation among slices. Extensive experiments on a large dental implant dataset demonstrated that the proposed TPNet achieves superior performance than the existing methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Forecasting

A Four-Pronged Defense Against Byzantine Attacks in Federated Learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wan, Wei Hu, Shengshan Li, Minghui Lu, Jianrong Zhang, Longling Zhang, Leo Yu Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Federated learning (FL) is a nascent distributed learning paradigm to train a shared global model without violating users' privacy. FL has been shown to be vulnerable to various Byzantine attacks, where malicious participants could independently or collusively upload well-crafted updates to deteriorate the performance of the global model. However, existing defenses could only mitigate part of Byzantine attacks, without providing an all-sided shield for FL. It is difficult to simply combine them as they rely on totally contradictory assumptions. In this paper, we propose FPD, a four-pronged defense against both non-colluding and colluding Byzantine attacks. Our main idea is to utilize absolute similarity to filter updates rather than relative similarity used in existingI works. To this end, we first propose a reliable client selection strategy to prevent the majority of threats in the bud. Then we design a simple but effective score-based detection method to mitigate colluding attacks. Third, we construct an enhanced spectral-based outlier detector to accurately discard abnormal updates when the training data is not independent and identically distributed (non-IID). Finally, we design update denoising to rectify the direction of the slightly noisy but harmful updates. The four sequentially combined modules can effectively reconcile the contradiction in addressing non-colluding and colluding Byzantine attacks. Extensive experiments over three benchmark image classification datasets against four state-of-the-art Byzantine attacks demonstrate that FPD drastically outperforms existing defenses in IID and non-IID scenarios (with 30% improvement on model accuracy). © 2023, CC BY.

关键词： Classification (of information)

Downstream-agnostic Adversarial Examples

学校读者我要写书评

暂无评论

Downstream-agnostic Adversarial Examples

International Conference on Computer Vision (ICCV)

作者： Ziqi Zhou Shengshan Hu Ruizhi Zhao Qian Wang Leo Yu Zhang Junhui Hou Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan University School of Information and Communication Technology Griffith University Department of Computer Science City University of Hong Kong School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab

Self-supervised learning usually uses a large amount of unlabeled data to pre-train an encoder which can be used as a general-purpose feature extractor, such that downstream users only need to perform fine-tuning operations to enjoy the benefit of "large model". Despite this promising prospect, the security of pre-trained encoder has not been thoroughly investigated yet, especially when the pre-trained encoder is publicly available for commercial *** this paper, we propose AdvEncoder, the first framework for generating downstream-agnostic universal adversarial examples based on the pre-trained encoder. AdvEncoder aims to construct a universal adversarial perturbation or patch for a set of natural images that can fool all the downstream tasks inheriting the victim pre-trained encoder. Unlike traditional adversarial example works, the pre-trained encoder only outputs feature vectors rather than classification labels. Therefore, we first exploit the high frequency component information of the image to guide the generation of adversarial examples. Then we design a generative attack framework to construct adversarial perturbations/patches by learning the distribution of the attack surrogate dataset to improve their attack success rates and transferability. Our results show that an attacker can successfully attack downstream tasks without knowing either the pre-training dataset or the downstream dataset. We also tailor four defenses for pre-trained encoders, the results of which further prove the attack ability of AdvEncoder. Our codes are available at: https://***/CGCL-codes/AdvEncoder.

关键词：

Reconciling Selective Logging and Hardware Persistent Memory Transaction

学校读者我要写书评

暂无评论

Reconciling Selective Logging and Hardware Persistent Memory...

IEEE Symposium on High-Performance Computer Architecture

作者： Chencheng Ye Yuanchao Xu Xipeng Shen Yan Sha Xiaofei Liao Hai Jin Yan Solihin 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 Huazhong University of Science and Technology Wuhan China North Carolina State University Raleigh North Carolina USA University of Central Florida Florida USA

Log creation, maintenance, and its persist ordering are known to be performance bottlenecks for durable transactions on persistent memory. Existing hardware persistent memory transactions overlook an important opportunity for improving performance: some persistent data is algorithmically redundant such that it can be recovered from other data, removing the need for logging such data. The paper presents an ISA extension that enables selective logging for hardware persistent memory transactions for the first time. The ISA extension features two novel components: fine-grain logging and lazy persistency. Fine-grain logging allows hardware to log updates on data in the granularity of words without lengthening the critical path of data accesses. Lazy persistency allows updated data to remain in the cache after the transaction commits. Together, the new hardware persistent memory transaction outperforms the state-of-the-art hardware counterpart by 1.8× on average.

关键词： Computer architecture Maintenance engineering Hardware Optimization IEEE transactions

Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Yechao Hu, Shengshan Zhang, Leo Yu Shi, Junyu Li, Minghui Liu, Xiaogeng Wan, Wei Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Adversarial examples for deep neural networks (DNNs) have been shown to be transferable: examples that successfully fool one white-box surrogate model can also deceive other black-box models with different architectures. Although a bunch of empirical studies have provided guidance on generating highly transferable adversarial examples, many of these findings fail to be well explained and even lead to confusing or inconsistent advice for practical use. In this paper, we take a further step towards understanding adversarial transferability, with a particular focus on surrogate aspects. Starting from the intriguing "little robustness" phenomenon, where models adversarially trained with mildly perturbed adversarial samples can serve as better surrogates for transfer attacks, we attribute it to a trade-off between two dominant factors: model smoothness and gradient similarity. Our research focuses on their joint effects on transferability, rather than demonstrating the separate relationships alone. Through a combination of theoretical and empirical analyses, we hypothesize that the data distribution shift induced by off-manifold samples in adversarial training is the reason that impairs gradient similarity. Building on these insights, we further explore the impacts of prevalent data augmentation and gradient regularization on transferability and analyze how the trade-off manifest in various training methods, thus building a comprehensive blueprint for the regulation mechanisms behind transferability. Finally, we provide a general route for constructing superior surrogates to boost transferability, which optimizes both model smoothness and gradient similarity simultaneously, e.g., the combination of input gradient regularization and sharpness-aware minimization (SAM), validated by extensive experiments. In summary, we call for attention to the united impacts of these two factors for launching effective transfer attacks, rather than optimizing one while ignoring the other,

关键词： Deep neural networks

Multi-Granularity Open Intent Classification via Adaptive Granular-Ball Decision Boundary

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Yanhua Ouyang, Xiaocao Pan, Chaofan Zhang, Jie Zhao, Sen Xia, Shuyin Yang, Xin Wang, Guoyin Li, Tianrui School of Computing and Artificial Intelligence Southwestern University of Finance and Economics Chengdu611130 China Engineering Research Center of Intelligent Finance Ministry of Education Chengdu611130 China Key Laboratory of Big Data Intelligent Computing Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China National Center for Applied Mathematics in Chongqing Chongqing Normal University Chongqing401331 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China

Open intent classification is critical for the development of dialogue systems, aiming to accurately classify known intents into their corresponding classes while identifying unknown intents. Prior boundary-based methods assumed known intents fit within compact spherical regions, focusing on coarse-grained representation and precise spherical decision boundaries. However, these assumptions are often violated in practical scenarios, making it difficult to distinguish known intent classes from unknowns using a single spherical boundary. To tackle these issues, we propose a Multi-granularity Open intent classification method via adaptive Granular-Ball decision boundary (MOGB). Our MOGB method consists of two modules: representation learning and decision boundary acquiring. To effectively represent the intent distribution, we design a hierarchical representation learning method. This involves iteratively alternating between adaptive granular-ball clustering and nearest sub-centroid classification to capture fine-grained semantic structures within known intent classes. Furthermore, multi-granularity decision boundaries are constructed for open intent classification by employing granular-balls with varying centroids and radii. Extensive experiments conducted on three public datasets demonstrate the effectiveness of our proposed method. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

EC²Detect: Real-Time Online Video Object Detection in Edge-cloud Collaborative IoT

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2022年第20期9卷 20382-20392页

作者： Siyan Guo Cong Zhao Guiqin Wang Jiaqing Yang Shusen Yang National Engineering Laboratory for Big Data Analytics and the School of Mathematics and Statistics Xi’an Jiaotong University Xi’an China Department of Computing Imperial College London London U.K. National Engineering Laboratory for Big Data Analytics and the School of Computer Science and Technology Xi’an Jiaotong University Xi’an China School of Mathematics and Statistics Xi’an Jiaotong University Xi’an China National Engineering Laboratory for Big Data Analytics and Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China Industrial Artificial Intelligence Center Pazhou Laboratory Guangzhou China

Video object detection is a fundamental technology of intelligent video analytics for Internet of Things (IoT) applications. However, even with extraordinary detection accuracy, predominating solutions based on deep convolutional neural networks (DCNNs) cannot achieve real-time online object detection on video streams with a low end-to-end (E2E) response latency and therefore cannot be applied to proliferating latency-sensitive IoT applications like autonomous driving requiring large-scale intelligent video analytics. To address this issue, we present EC2Detect, an edge-cloud collaborative real-time online video object detection method. Specifically, we propose a tracking-assisted object detection architecture based on edge-cloud collaboration with keyframe selection, where the accurate but heavy object detection is conducted by the cloud on sparse keyframes adaptively selected according to their semantic variation, and the lightweight object tracking is used to localize and identify objects in other frames at edge devices. Extensive experiments of our real-world prototype demonstrate that, EC2Detect significantly outperforms state-of-the-art methods in terms of processing speed (up to $4.77\times $ faster), E2E latency (up to $8.12 \times $ lower), and edge-cloud bandwidth occupation ( $17 \times $ lower) with an acceptable mAP, which can effectively support large-scale intelligent video analytics in practice. Source code of EC2Detect is available at https://***/ECCDetect/ECCDetect .

关键词： Object detection Image edge detection Streaming media Internet of Things Collaboration Visual analytics Feature extraction