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

MGDefect: A Mask-Guided High-Quality Defect Image Generation Method for Improving Defect Inspection

IEEE Transactions on Multimedia 2025年

作者： Jiang, Xiaoheng Li, Yingjie Yan, Feng Lu, Yang Xu, Changsheng Xu, Mingliang Zhengzhou University School of Computer and Artificial Intelligence Zhengzhou450001 China National Supercomputing Center in Zhengzhou Engineering Research Center of Intelligent Swarm Systems Ministry of Education Zhengzhou450001 China Chinese Academy of Sciences State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Beijing100190 China University of Chinese Academy of Sciences School of Artificial Intelligence Beijing100049 China

Deep learning based defect inspection methods have achieved promising performance, which usually relies on a large number of well-labeled training samples. However, it requires much effort to obtain enough annotated samples especially pixel-level annotations in practical production. Generative adversarial networks (GANs) can be utilized to generate defect samples. However, training GANs typically requires a large amount of defect data and most of them cannot generate defect samples with pixel-level annotations. In this paper, we present a Mask-Guided Defect image generation method, called MGDefect, which can generate high-quality defect samples with pixel-level annotations and effectively improves the performance of downstream tasks. Specifically, MGDefect consists of a Mask-Guided Defect Generation GAN (MGDG-GAN) and a Defect Mask GAN (DM-GAN). MGDG-GAN generates images containing defects with specific locations, shapes, and sizes via mask guidance and the dual discrimination for defects at the region level and image level. DM-GAN aims to generate diverse and rational masks for MGDG-GAN. It also adopts region-level and image-level dual discrimination for masks to generate compatible masks with the target objects. MGDG-GAN mainly focuses on generating local defect regions and DM-GAN specializes in generating masks, which are both trained on limited defect samples and abundant normal samples. Experiments conducted on the MVTec AD, DAGM 2007, and KolektorSDD2 benchmark datasets demonstrate that our method achieves promising results compared with other state-of-the-art approaches. Meanwhile, the generated defect samples significantly improve the performance of defect inspection tasks including classification and segmentation. Specifically, our method achieves KIDx 103/IS scores of 48.35/2.27 on MVTec AD, 15.37/2.44 on DAGM 2007, and 19.70/2.01 on KolektorSDD2. Furthermore, our method improves mIoU by 10.59%, 2.20%, and 2.17% on these datasets, respectively, using U-Net

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Decentralized and Lightweight Cross-Chain Transaction Scheme Based on Proxy Re-signature

Decentralized and Lightweight Cross-Chain Transaction Scheme...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Huiying Zou Jia Duan Xi Liu Wei Ren Tao Li Xianghan Zheng Kim-Kwang Raymond Choo School of Computer Science China University of Geosciences Wuhan China The Third Surveying and Mapping Institute of Hunan Province Hunan Engineering Research Center of Geographic Information Security and Application Hunan China Key Laboratory of Data Protection and Intelligent Management Sichuan University Ministry of Education China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China College of Computer and Big Data Fuzhou University School of Information and Intelligent Engineering Sanya College China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio USA

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

With the widespread application of digital assets and the rapid development of blockchain technology, achieving secure and efficient transactions between different blockchain networks has become an urgent challenge. Existing cross-chain methods impose limitations, e.g., hash lock technology exhibits low scalability, side-chain technology is overly complex, and notary schemes pose centralization risks. In order to address these issues, we propose a cross-chain transaction solution based on proxy re-signature technology. To tackle the centralization concerns, we employ proxy re-signature technology to decentralize the authority of notaries among transaction participants, minimizing the potential for centralization at a low cost. We further present an extended scheme that can guarantee more requirements such as higher transaction amount and shorter transaction time. Furthermore, we analyze and compare the signature technologies used in the proposed solution and provide a systematic proof of our approach’s security.

关键词： Privacy Systematics Costs Scalability Blockchains Security

来源：评论

学校读者我要写书评

暂无评论

CADEC: A Combinatorial Auction for Dynamic Distributed DNN Inference Scheduling in Edge-Cloud Networks

引用

IEEE Transactions on Mobile computing 2025年

作者： Xu, Xiaolong Hu, Yuhao Cui, Guangming Qi, Lianyong Dou, Wanchun Nanjing University of Information Science and Technology School of Software Nanjing210044 China Nanjing University of Information Science and Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software China Nanjing University State Key Laboratory for Novel Software Technology China College of Computer science and technology Qingdao China Georgia State University Department of Computer Science United States

Deep Neural Network (DNN) Inference, as a key enabler of intelligent applications, is often computation-intensive and latency-sensitive. Combining the advantages of cloud computing (abundant computing resources) and edge computing (fast transmission), edge-cloud collaborative DNN inference is a powerful solution to these problems. However, in edge-cloud networks with heterogeneous resources, how to obtain reasonable decisions on server selection, model partition and resource allocation for efficient distributed DNN inference is a hard challenge. Furthermore, it is non-trivial to design suitable resource prices to maximize the social welfare. These challenges even escalate in dynamic edge-cloud networks where decisions should be generated as soon as each user arrives without future information. Therefore, we design a combinatorial auction for dynamic distributed DNN inference scheduling, named CADEC. CADEC first constructs a bid set for each user based on convex optimization theory for optimal solution searching. Next, prices of resources in the edge-cloud network are adjusted according to changes in supply-demand relationship, and whether to admit the request of each user is decided. Finally, the dynamic distributed inference scheduling decisions are generated through the primal-dual algorithm to maximize the social welfare. Theoretical analysis shows the good competitive ratio and polynomial time complexity of CADEC. Results of simulation experiments present that CADEC improves social welfare by up to 46% compared with state-of-the-art distributed DNN inference schemes. © 2002-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks

arXiv

引用

arXiv 2025年

作者： Dong, Xuewen Li, Jiachen Li, Shujun You, Zhichao Qu, Qiang Kholodov, Yaroslav Shen, Yulong School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi’an710071 China University of Kent CanterburyCT2 7NP United Kingdom Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Intelligent Transportation Systems Lab Innopolis University Innopolis Russia School of Computer Science and Technology Xidian University China The Shaanxi Key Laboratory of Network and System Security Xi’an710071 China

Recent studies show that graph neural networks (GNNs) are vulnerable to backdoor attacks. Existing backdoor attacks against GNNs use fixed-pattern triggers and lack reasonable trigger constraints, overlooking individual graph characteristics and rendering insufficient evasiveness. To tackle the above issues, we propose ABARC, the first Adaptive Backdoor Attack with Reasonable Constraints, applying to both graph-level and node-level tasks in GNNs. For graph-level tasks, we propose a subgraph backdoor attack independent of the graph’s topology. It dynamically selects trigger nodes for each target graph and modifies node features with constraints based on graph similarity, feature range, and feature type. For node-level tasks, our attack begins with an analysis of node features, followed by selecting and modifying trigger features, which are then constrained by node similarity, feature range, and feature type. Furthermore, an adaptive edge-pruning mechanism is designed to reduce the impact of neighbors on target nodes, ensuring a high attack success rate (ASR). Experimental results show that even with reasonable constraints for attack evasiveness, our attack achieves a high ASR while incurring a marginal clean accuracy drop (CAD). When combined with the state-of-the-art defense randomized smoothing (RS) method, our attack maintains an ASR over 94%, surpassing existing attacks by more than 7%. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Deep Learning Approach Featuring Graph-Based Algorithm for Cell Segmentation and Tracking

A Novel Deep Learning Approach Featuring Graph-Based Algorit...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Keliang Zhao Jovial Niyogisubizo Linxia Xiao Yi Pan Dongqing Wei Didi Rosiyadi Yanjie Wei Shenzhen Key Laboratory of Intelligent Bioinformatics and Center for High Performance Computing Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China College of Computer Science and Control Engineering Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China State Key Laboratory of Microbial Metabolism and School of Life Sciences and Biotechnology Shanghai Jiao Tong University Shanghai China Research Center for Artificial Intelligence and Cybersecurity National Research and Innovation Agency Bandung Indonesia

The precise segmentation and tracking of cells in microscopy image sequences play a pivotal role in biomedical research, facilitating the study of tissue, organ, and organism development. However, manual segmentation and tracking of cells is time-consuming and often require professional experiences. Besides, segmenting cells in the images with a low signal-to-noise ratio remains difficult. While deep learning (DL) has become a common method for cell segmentation, few DL- based methods address concurrent cell segmentation and tracking. In this paper, we propose a novel DL approach featuring graph-based tracking for cell segmentation and tracking in microscopy images. We combine Deeplabv3+ for semantic segmentation and ResNet50 for enhanced feature extraction, enabling comprehensive cell detection and instance segmentation. Post-processing, involving non-maxima suppression and outlier detection, refines predictions and produces final segmentation. The tracking method is based on the relative position of graph nodes to track segmented cells, encompassing cell division and apoptosis. We conduct our experiments on the induced pluripotent stem (iPS) cell datasets, and the results show that the segmentation and tracking performance of our method yields superior performance compared to the benchmark models. More specifically, our approach achieved DET values of 0.955 and 0.913, TRA values of 0.951 and 0.906, and SEG values of 0.690 and 0.665 on two iPS dataset videos, respectively. Additionally, the performance assessment encompasses four real microscopy datasets from the Cell Tracking Challenge (CTC). Our method greatly reduces the cost of manual labeling and labor-intensive costs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2024年

作者： Ren, Yingying Li, Qiuli Guo, Yangyang Pedrycz, Witold Xing, Lining Liu, Anfeng Song, Yanjie School of Computer Electronics and Information Guangxi University Nanning China Guangxi Key Laboratory of Multimedia Communications and Network Technology China Key Laboratory of Parallel Distributed and Intelligent Computing Guangxi University China School of Systems Science Beijing Jiaotong University Beijing China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Poland Faculty of Engineering and Natural Sciences Department of Computer Engineering Sariyer Istanbul Turkey School of Electronic Engineering Xidian University Xian China School of Electronic Engineering Central South University Changsha China National Engineering Research Center of Maritime Navigation System Dalian Maritime University Dalian China

With the rapid development of the satellite industry, the information transmission network based on communication satellites has gradually become a major and important part of the future satellite ground integration network. However, the low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system and needs to be solved urgently. Effectively planning the task of satellite ground networking by reasonably scheduling resources is crucial for the efficient transmission of task data. In this paper, we hope to provide a task execution scheme that maximizes the profit of the networking task for satellite ground network planning considering feeding mode (SGNPFM). To solve the SGNPFM problem, a mixed-integer planning model with the objective of maximizing the gain of the link-building task is constructed, which considers various constraints of the satellite in the feed-switching mode. Based on the problem characteristics, we propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks. To obtain more high-quality solutions, different similarity evaluation methods are designed to assist the algorithm in intelligently screening individuals. The DSGAalso uses an adaptive crossover strategy based on similarity mechanism, which guides the algorithm to achieve efficient population search. In addition, a task scheduling algorithm considering the feed-switching mode is designed for decoding the algorithm to generate a highquality scheme. The results of simulation experiments show that the DSGA can effectively solve the SGNPFM problem. Compared to other algorithms, the proposed algorithm not only obtains higher quality planning schemes but also has faster algorithm convergence speed. The proposed algorithm improves data trans

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

TEVA: Training-Efficient and Verifiable Aggregation for Federated Learning for Consumer Electronics in Industry 5.0

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xia, Yuanjun Liu, Yining Chen, Jingxue Liang, Yangfan Khan, Fazlullah Alturki, Ryan Wang, Xiaopei Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software School of Computer and Information Security Guilin541004 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325027 China University of Technology School of Mathematical and Physical Sciences SydneyNSW2007 Australia Jiaxing University Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems The Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province The Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing314001 China University of Nottingham Ningbo China School of Computer Science Faculty of Science and Engineering Zhejiang Ningbo315104 China Umm AI-Qura University Makkah Department of Software Engineering College of Computing Saudi Arabia Riverside Department of Computer Science and Engineering University of California CA92521 United States

Federated learning (FL) has been widely used for privacy-preserving model updates in Industry 5.0, facilitated by 6G networks. Despite FL's privacy-preserving advantages, it remains vulnerable to attacks where adversaries can infer private data from local models or manipulate the central server (CS) to deliver falsified global models. Current privacy-preserving approaches, primarily based on the FedAvg algorithm, fail to optimize training efficiency for non-independent and identically distributed (non-IID) data. This article proposes training-efficient and verifiable aggregation (TEVA) for FL to resolve these issues. This scheme combines threshold Paillier homomorphic encryption (TPHE), verifiable aggregation, and an optimized double momentum update mechanism (OdMum). TEVA not only leverages TPHE to protect the privacy of local models but also ensures the integrity of the global model through a verifiable aggregation mechanism. Additionally, TEVA integrates the OdMum algorithm to effectively address the challenges posed by non-IID data, promoting rapid model convergence and significantly enhancing overall training efficiency. Security analysis indicates that TEVA meets the requirements for privacy protection. Extensive experimental results demonstrate that TEVA can accelerate model convergence while incurring lower computational and communication overheads. © 1975-2011 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Robust Imagined Speech Production from Electrocorticography with Adaptive Frequency Enhancement

Robust Imagined Speech Production from Electrocorticography ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xu Xu Chong Fu Junxin Chen Gwanggil Jeon David Camacho School of Computer Science and Engineering Northeastern University Shenyang China School of Software Dalian University of Technology Dalian China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang China Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang China College of Information Technology Incheon National University Incheon Korea Department of Computer Systems Engineering Universidad Politécnica de Madrid Madrid Spain

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Imagined speech production with electrocorticography (ECoG) plays a crucial role in brain-computer interface system. A challenging issue is the great variation underlying the frequency bands of the ECoG signals’ encode information, which makes current methods difficult to generate imagined speech with stable quality among different persons. To this end, we propose a robust model to generate high-quality imagined speech from ECoG. A frequency enhancement branch is first designed to adaptively modulate the frequency information, whose product is fed into the following multi-scale channel attention module for robust feature extraction and fusion. By incorporating both the mel-spectrum and audio as training constraints, a multi-constraint decoder branch is finally constructed for imagined speech production. The performance of our model is evaluated on a high-quality dateset, i.e, Single Word Production Dutch-iBIDS. It yields Pearson correlation scores that are all above 0.8, and the standard deviationsare are all below 0.2 in different volunteers. Experimental results demonstrate that our model is effective and robust for ECoG based imagined speech production, and has advantages over peer methods.

关键词： Training Adaptation models Frequency modulation Correlation Neuroscience Production Speech enhancement

来源：评论

学校读者我要写书评

暂无评论

YOLO-Ant: A Lightweight Detector via Depthwise Separable Convolutional and Large Kernel Design for Antenna Interference Source Detection

arXiv

引用

arXiv 2024年

作者： Tang, Xiaoyu Chen, Xingming Cheng, Jintao Wu, Jin Fan, Rui Zhang, Chengxi Zhou, Zebo The School of Electronic and Information Engineering Faculty of Engineering South China Normal University Guangdong Foshan528225 China The School of Physics South China Normal University Guangdong Guangzhou510000 China The Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong The College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China The School of Internet of Things Engineering Jiangnan University Wuxi214122 China The School of Aeronautics Astronautics University of Electronic Science and Technology of China and Aircraft swarm intelligent sensing and cooperative control Key Laboratory of Sichuan Province Chengdu610097 China The National Laboratory on Adaptive Optics Chengdu610209 China

In the era of 5G communication, removing interference sources that affect communication is a resource-intensive task. The rapid development of computer vision has enabled unmanned aerial vehicles to perform various high-altitude detection tasks. Because the field of object detection for antenna interference sources has not been fully explored, this industry lacks dedicated learning samples and detection models for this specific task. In this article, an antenna dataset is created to address important antenna interference source detection issues and serves as the basis for subsequent research. We introduce YOLO-Ant, a lightweight CNN and transformer hybrid detector specifically designed for antenna interference source detection. Specifically, we initially formulated a lightweight design for the network depth and width, ensuring that subsequent investigations were conducted within a lightweight framework. Then, we propose a DSLK-Block module based on depthwise separable convolution and large convolution kernels to enhance the network’s feature extraction ability, effectively improving small object detection. To address challenges such as complex backgrounds and large interclass differences in antenna detection, we construct DSLKVit-Block, a powerful feature extraction module that combines DSLK-Block and transformer structures. Considering both its lightweight design and accuracy, our method not only achieves optimal performance on the antenna dataset but also yields competitive results on public datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

OverlapMamba: Novel Shift state Space Model for LiDAR-based Place Recognition

arXiv

引用

arXiv 2024年

作者： Xiang, Qiuchi Cheng, Jintao Luo, Jiehao Wu, Jin Fan, Rui Chen, Xieyuanli Tang, Xiaoyu School of Data Science and Engineering Xingzhi College South China Normal University Shanwei516600 China School of Electronic and Information Engineering South China Normal University Guangdong Foshan528225 China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong College of Intelligence Science and Technology National University of Defense Technology Changsha China College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China

Place recognition is the foundation for enabling autonomous systems to achieve independent decision-making and safe operations. It is also crucial in tasks such as loop closure detection and global localization within SLAM. Previous methods utilize mundane point cloud representations as input and deep learning-based LiDAR-based Place Recognition (LPR) approaches employing different point cloud image inputs with convolutional neural networks (CNNs) or transformer architectures. However, the recently proposed Mamba deep learning model, combined with state space models (SSMs), holds great potential for long sequence modeling. Therefore, we developed OverlapMamba, a novel network for place recognition, which represents input range views (RVs) as sequences. In a novel way, we employ a stochastic reconstruction approach to build shift state space models, compressing the visual representation. Evaluated on three different public datasets, our method effectively detects loop closures, showing robustness even when traversing previously visited locations from different directions. Relying on raw range view inputs, it outperforms typical LiDAR and multi-view combination methods in time complexity and speed, indicating strong place recognition capabilities and realtime efficiency. Copyright © 2024, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：