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

Enhancing Adversarial Example Transferability via Regularized Constrained Feature Layer

Computers, Materials & Continua 2025年第4期83卷 157-175页

作者： Xiaoyin Yi Long Chen Jiacheng Huang Ning Yu Qian Huang School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing400065China Chongqing Key Laboratory of Public Big Data Security Technology Chongqing401420China School of Cyber Security and Information Law Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of EducationChongqing400065China Artificial Intelligence and Big Data College Chongqing Polytechnic University of Electronic TechnologyChongqing401331China

Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior *** is achieved by leveraging the property of adversarial *** is,when generated from a surrogate model,they retain their features if applied to other models due to their good ***,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source ***,when attempting black-box transfer attacks on different target models,their effectiveness is *** solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency *** are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial ***,a regularized loss function is used to enhance the black-box transferability between different target *** proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.

关键词： Adversarial examples black-box transferability regularized constrained transfer-based adversarial attacks

来源：评论

学校读者我要写书评

暂无评论

Accelerated Feature Selection Based on Granular-Ball Rough Sets 11th

Accelerated Feature Selection Based on Granular-Ball Rough ...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Lian, Xiaoyu Xia, Shuyin He, Hongxuan The Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China

ISBN: (纸本)9783031927430

Although the existing granular-ball rough set (GBRS) model can use equivalence classes to represent knowledge and can process continuous and discrete data at the same time, it fails to make full use of the information of the granular-ball split before superimposing attributes when performing feature selection, and all boundary sample points still need to be split again. This paper proposes to make full use of the information of the boundary granular-ball before superimposing attributes, proposes an accelerated feature selection method based on GBRS, and gives a criterion to further guide the determination of the minimum number of samples in the granular-ball. Experimental results on benchmark datasets show that the learning accuracy and efficiency of the accelerated method are significantly improved compared with the GBRS algorithm. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Equivalence classes

来源：评论

学校读者我要写书评

暂无评论

Subsampling Decomposition based k-Space Refinement for Accelerated MRI Reconstruction

Subsampling Decomposition based k-Space Refinement for Accel...

引用

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

作者： Qiao, Xiaoyu Li, Weisheng Xiao, Bin Huang, Yuping Yang, Lijian Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and Telecommunications Ministry of Education Chongqing China

ISBN: (纸本)9798350368741

In accelerated MRI reconstruction problem, directly recovering all the missing k-space data from undersampled measurements is highly ill-posed and often leads to suboptimal performance. To address the problem, we propose a novel deep unfolding network (DUN) with subsampling decomposition (SD) based k-space refinement to mitigate the ill-posedness. Our method employs a parallel network architecture with a primary branch unfolded by gradient descent-inspired optimization process (GD-PB) for reconstruction. Additionally, we introduce an SD-based auxiliary branch (SD-AB) that decompose the inverse problem into moderately corrupted subproblems. We design a novel subsampling mask predictor that captures both global and local spatial correlations in k-space, ensuring the SD-AB effectively preserves the most well-reconstructed subsets as reliable region (RR). The RR in SD-AB is used to periodically refine the intermediate outputs of the GD-PB, achieving improved accuracy. Experimental results reveal that our method significantly outperforms conventional and SD-based DUN techniques, achieving superior PSNR and SSIM results compared with cutting-edge methods. © 2025 IEEE.

关键词： compressed sensing deep unfolded network MRI reconstruction parallel imaging subsampling decomposition

来源：评论

学校读者我要写书评

暂无评论

Learning Preconditioners in Gates-controlled Deep Unfolding Networks based on Quasi-Newton Methods For Accelerated MRI Reconstruction

Learning Preconditioners in Gates-controlled Deep Unfolding ...

引用

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

ISBN: (纸本)9798350368741

Deep unfolding networks (DUNs) have made significant progress in MRI reconstruction, successfully tackling the problem of prolonged imaging time. However, the ill-conditioned nature of MRI reconstruction often causes slow convergence in iterative optimization, potentially compromising the performance of DUNs. In this study we propose a preconditioned and gates-controlled DUN (PGDUN) to address these challenges. Our approach starts with optimizing the step size of proximal gradient descent (PGD) through a preconditioner. To improve flexibility and adaptability, we relax the constrains on quasi-newton-based optimization procedure. We design ConvLSTM-based modules, where the gate units automatically preserve necessary long- and short-term information, facilitating the learning of optimized variables and their combinations. Furthermore, we design gate units to modulate the features fed to regularizers across different iterations, boosting their robustness against potential accumulated errors. Evaluations using PSNR and SSIM metrics reveal that our approach outperforms existing state-of-the-art methods, achieving superior reconstruction results across various sequences. © 2025 IEEE.

关键词： Compressed Sensing LSTM MRI reconstruction Preconditioner Quasi-Newton

来源：评论

学校读者我要写书评

暂无评论

Stacking U-Nets in U-shape: Redesigning the Information Flow in Model-based Networks for MRI Reconstruction

Stacking U-Nets in U-shape: Redesigning the Information Flow...

引用

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

ISBN: (纸本)9798350368741

Model-based networks have shown convincing performance in MRI reconstruction. However, the unrolled cascades within the networks are constrained to solely obtain information from the preceding counterpart, resulting in potential error accumulation. Moreover, the linear structure fails to address the challenge of recovering fine-grained details. To tackle these problems, we propose to redesign the information flow in model-based networks. Our method features a large U-shaped network, where the nodes are built with unrolled cascades and U-Net-based regularizers. We design an input-level integration module to help the cascades acquire information from adjacent and skip-connected counterparts, building robust mappings to the target. We further design a coarse-to-fine feature-level integration module, aiming at guiding the network to progressively recover fine details. Intermediate reconstructions produced by subnetworks of different scales are integrated, enabling the extraction of complementary information to enhance the final performance. Compared with cutting-edge methods on different datasets, our method exhibits superior performances. © 2025 IEEE.

关键词： compressed sensing deep learning model-based MRI reconstruction U-Net

来源：评论

学校读者我要写书评

暂无评论

CMIF: A Cross-Modal Information Fusion Approach for Molecular Property Prediction 11th

CMIF: A Cross-Modal Information Fusion Approach for Molecul...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Zang, Maoyuan Gong, Xu Han, Rui Liu, Qun Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China

ISBN: (纸本)9783031927409

Molecular property prediction is vital in bioinformatics, as accurate and efficient predictions can greatly speed up drug discovery and lower R&D costs. In recent years, the development of deep learning has driven the innovation of data-driven molecular representation learning, which has derived sequence-based, graph-based, and geometry-based molecular representations. Many methods have been proposed to fuse molecular representations of different modalities to improve the performance of molecular property prediction. However, most recent studies have focused on one or two modes and combined them in a simple way, they also neglected the alignment of heterogeneous features. To address these challenges, we propose CMIF, a cross-modal information fusion framework for molecular property prediction, which integrates the three modal representations of sequence, graph, and geometry. The proposed CMIF encodes each modal feature separately through a specific neural network and innovatively employs a cross-attention mechanism for deep feature fusion to avoid the limitations of traditional linear operations. To further solve the problem of heterogeneous feature alignment, CMIF introduces a dual self-supervised strategy of contrast learning and cross-modal matching to strengthen the inter-modal semantic consistency. We evaluated the performance of CMIF on seven molecular datasets, and the results show that our method outperforms baseline models in most cases, validating the effectiveness of CMIF in comprehensively capturing molecular features. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Feature Fusion Network with Multiscale Adaptively Attentional for Object Detection in Complex Traffic Scenes

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on intelligent Vehicles 2024年

作者： Cai, Fei Qu, Zhong Yin, Xuehui Chongqing Key Laboratory of Computational Intelligence The Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education The Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China

Currently, small object detection in complex traffic scenarios remains a major challenge due to variations in object shape, scales, and external environment, as well as a high inter-class similarity. Although the latest algorithms achieve high accuracy, the results for small objects are still unsatisfactory. To obtain satisfactory small object detection results, the YOLOv8 algorithm is used to construct a feature fusion network with multiscale adaptively attentional (MAAFFNet). Firstly, the C2f module is modified to replace the simple summation operation with Multiscale Iterative Attentional Feature Fusion (MSIAFF), which enhances the ability of multi-scale aggregation of the C2f module and suppresses the interference of irrelevant information, resulting in a richer semantic feature map. Secondly, the adaptive spatial feature fusion (ASFF) module is introduced to deal with the feature maps of different scales, allocate the weights of spatial features of different levels, and enhance the consistency of semantic information between each layer of the feature maps, so as to improve the detail richness of the network. Finally, to achieve more accurate classification of small objects, a Slide loss function is introduced to achieve object classification and localization. Our proposed algorithm has been extensively experimented on KITTI, COCO-traffic and VOC 2012 datasets, respectively, comparing the proposed method to popular two-stage and single-stage object detection algorithms, the proposed method performs well in terms of accuracy. © 2024 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Anatomical Prior Guided Spatial Contrastive Learning for Few-Shot Medical Image Segmentation 24

Anatomical Prior Guided Spatial Contrastive Learning for Few...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Huang, Wendong Hu, Jinwu Bi, Xiuli Xiao, Bin Chongqing Key Laboratory of Image Cognition Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Post and Telecommunications Chongqing China Pazhou Lab School of Software Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9798400706868

Few-shot semantic segmentation has considerable potential for low-data scenarios, especially for medical images that require expert-level dense annotations. Existing few-shot medical image segmentation methods strive to deal with the task by means of prototype learning. However, this scheme relies on support prototypes to guide the segmentation of query images, ignoring the rich anatomical prior knowledge in medical images, which hinders effective feature enhancement for medical images. In this paper, we propose an anatomical prior guided spatial contrastive learning, called APSCL, which exploits anatomical prior knowledge derived from medical images to construct contrastive learning from a spatial perspective for few-shot medical image segmentation. The new framework forces the model to learn the features in line with the embedded anatomical representations. Besides, to fully exploit the guidance information of the support samples, we design a mutual guidance decoder to predict the label of each pixel in the query image. Furthermore, our APSCL can be trained end-to-end in the form of episodic training. Comprehensive experiments on three challenging medical image datasets, i.e., CHAOS-T2, MS-CMRSeg, and Synapse, prove that our method significantly surpasses state-of-the-art few-shot medical segmentation methods, with a mean improvement of 3.61%, 2.30%, and 6.38% on the Dice score, respectively. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Auxiliary Attributes-Guided Face Age Estimation 11th

Auxiliary Attributes-Guided Face Age Estimation

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： You, Fan Zhong, Fujin Yu, Hong Hu, Jun Yang, Yan Liu, Mengqi School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China

ISBN: (纸本)9783031927409

Facial age estimation is a critical task within computer vision, with wide-ranging applications in demographic analysis, video retrieval, and access control. Prior research has highlighted that facial aging is significantly influenced by attributes such as gender and ethnicity, which present substantial challenges to achieving accurate and robust age prediction. To tackle this challenge, we propose MSAN, an innovative end-to-end age estimation framework that integrates auxiliary information, including gender and ethnicity, during the prediction phase and dynamically models their interactions with age. Extensive evaluations on multiple public datasets demonstrate that our model outperforms several state-of-the-art approaches. This study provides an effective solution for enhancing the accuracy of facial age estimation. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

PriFU: Capturing Task-Relevant Information Without Adversarial Learning 24

PriFU: Capturing Task-Relevant Information Without Adversari...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Bi, Xiuli Hu, Yang Liu, Bo Li, Weisheng Cosman, Pamela Xiao, Bin Chongqing Key Laboratory of Image Cognition Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing China Department of Electrical and Computer Engineering University of California San Diego San Diego United States

ISBN: (纸本)9798400706868

As machine learning advances, machine learning as a service (MLaaS) in the cloud brings convenience to human lives but also privacy risks, as powerful neural networks used for generation, classification or other tasks can also become privacy snoopers. This motivates privacy preservation in the inference phase. Many approaches for preserving privacy in the inference phase introduce multi-objective functions, training models to remove specific private information from users' uploaded data. Although effective, these adversarial learning-based approaches suffer not only from convergence difficulties, but also from limited generalization beyond the specific privacy for which they are trained. To address these issues, we propose a method for privacy preservation in the inference phase by removing task-irrelevant information, which requires no knowledge of the privacy attacks nor introduction of adversarial learning. Specifically, we introduce a metric to distinguish task-irrelevant information from task-relevant information, and achieve more efficient metric estimation to remove task-irrelevant features. The experiments demonstrate the potential of our method in several tasks. Our code will be available at: https://***/iwhoyoung/PriFU. © 2024 ACM.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：