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

Low-rank matrix recovery with total generalized variation for defending adversarial examples

Frontiers of information technology & Electronic Engineering 2024年第3期25卷 432-445页

作者： Wen LI Hengyou WANG Lianzhi HUO Qiang HE Linlin CHEN Zhiquan HE Wing W.Y.Ng School of Science Beijing University of Civil Engineering and ArchitectureBeijing 100044China School of Computer Science and Engineering South China University of TechnologyGuangzhou 510006China Aerospace Information Research Institute Chinese Academy of SciencesBeijing 100094China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen 518060China Institute of Big Data Modeling and Technology Beijing University of Civil Engineering and ArchitectureBeijing 100044China

Low-rank matrix decomposition with first-order total variation(TV)regularization exhibits excellent performance in exploration of image *** advantage of its excellent performance in image denoising,we apply it to improve the robustness of deep neural ***,although TV regularization can improve the robustness of the model,it reduces the accuracy of normal samples due to its *** our work,we develop a new low-rank matrix recovery model,called LRTGV,which incorporates total generalized variation(TGV)regularization into the reweighted low-rank matrix recovery *** the proposed model,TGV is used to better reconstruct texture information without *** reweighted nuclear norm and Li-norm can enhance the global structure ***,the proposed LRTGV can destroy the structure of adversarial noise while re-enhancing the global structure and local texture of the *** solve the challenging optimal model issue,we propose an algorithm based on the alternating direction method of *** results show that the proposed algorithm has a certain defense capability against black-box attacks,and outperforms state-of-the-art low-rank matrix recovery methods in image restoration.

关键词： Total generalized variation Low-rank matrix Alternating direction method of multipliers Adversarial example

来源：评论

学校读者我要写书评

暂无评论

Multi-scale fusion clustering algorithm for urban travel features 3

Multi-scale fusion clustering algorithm for urban travel fea...

引用

2023 3rd International Conference on Intelligent Traffic Systems and Smart City, ITSSC 2023

作者： Zhang, Zixiang Zhao, Zhilong Deng, Jiaming Zhao, Yingying Xu, Tao Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China Key Laboratory of Geographical Information Science Ministry of Education East China Normal University Shanghai200241 China School of Computer and Information Engineering Henan University Kaifeng475004 China International Education College Henan University Zhengzhou450046 China Henan Technology Innovation Center of Spatio-Temporal Big Data Henan University Zhengzhou450046 China Henan Industrial Technology Academy of Spatio-Temporal Big Data Henan University Zhengzhou450046 China

ISBN: (纸本)9781510672963

Urban travel data typically encompass various temporal and spatial scales and features. Nonetheless, existing traffic travel feature analysis often focuses on a single spatial scale, which may overlook crucial information and hinder features at different scales. Consequently, this could reduce the accuracy of travel pattern recognition. To solve this problem, we introduce a multi-scale fusion transformation algorithm. In our approach, we first establish a multi-level taxi travel data grid system. Then, we apply the I-Clique clustering algorithm to perform grid clustering at each level of the system to identify taxi travel feature regions of different scales. Subsequently, a multi-scale fusion pyramid model is constructed utilizing the acquired travel feature regions at various scales. Finally, we determine the transformation relationships between scales in the pyramid model, enabling the identification of travel feature areas across both known and unknown scales. This approach facilitates the recognition of travel features within cities at any scale. Experimental results demonstrate that the multi-scale fusion transformation algorithm enhances our understanding of spatial aggregation patterns and the hierarchical structure of geographical entities, offering a novel approach for multi-scale urban traffic analysis. © 2024 SPIE. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Attention information Fusion Emotion Analysis Model Based on BiLSTM-BERT

Attention Information Fusion Emotion Analysis Model Based on...

引用

Consumer Electronics and computer Engineering (ICCECE), 2021 IEEE International Conference on

作者： Zhi-Wei Cheng Shun-Xin Li Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial Wuhan University of Science and Technology Wuhan China

Aiming at the problem that most sentiment analysis methods do not focus on the weight fusion of local context and global context information and the important information in fusion features is not prominent, AIFM-BB (Attention information fusion emotion analysis model based on BiLSTM-BERT) is proposed. The model uses a pre-trained BERT model to process text vectors and a collaborative speech analysis algorithm to process audio vectors, and introduces BiLSTM and Attention mechanisms. The weight of the feature vector is dynamically adjusted by combining the global information and local information of text and audio and the attention information of text and audio modes. The emotion analysis results are obtained through the Softmax layer after the fusion features are self-focused. The experimental results show that the accuracy of the proposed AIFM-BB model on the CMU-MOSI dataset is 85.3%, which is 2.8 percentage points higher than the baseline. In the multi-category emotion classification task, the accuracy of the model is 44.7%, an improvement of 1.1 percentage points compared with baseline. The accuracy is 83.6% on the CMU-MOSEI dataset, an improvement of 1.4 percentage points compared to baseline.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Remote Sensing Images Semantic Segmentation Method Based on Improved Nested UNet

Remote Sensing Images Semantic Segmentation Method Based on ...

引用

2022 International Conference on Geographic information and Remote Sensing technology, GIRST 2022

作者： Li, Zhongyu Liu, Yang Kuang, Yin Wang, Huajun Liu, Cheng College of Geophysics Chengdu University of Technology Chengdu610059 China College of Computer Science Chengdu Normal University Chengdu611130 China Key Laboratory of interior Layout optimization and Security Institutions of Higher Education of Sichuan Province Sichuan Chengdu611130 China Key Laboratory of Pattern Recognition and Intelligent Information Processing of Sichuan Chengdu University Chengdu610106 China Artificial Intelligence Key Laboratory of Sichuan Province Zigong643000 China

ISBN: (纸本)9781510662186

With the development of remote sensing technology, remote sensing images of buildings are of great significance in urban planning, disaster response, and other directions. When we use a neural network containing batch normalization layers for semantic segmentation, the neural network is sensitive to batch size and has low segmentation accuracy for occluded and dense buildings. This paper proposes a method for building segmentation in remote sensing images based on Nested UNet (UNet++) deep neural network. First, the UNet++ network is used to extract features, and the Group Normalization (GN) method is used instead of Batch Normalization (BN) to alleviate the model's sensitivity to batch size. Then the weighted combination of Cross-Entropy Loss (CELoss) and DiceLoss is used as the loss function to improve the feature extraction ability of the neural network for unbalanced buildings. Finally, experiments are carried out on the WHUBuilding dataset. The experimental results show that the improved model (UNet++-GN) improves Mean Intersection over Union (MIoU) and Mean Pixel Accuracy (Macc) by 12.16% and 2.92%, respectively, compared with the original model (UNet++-BN). © 2023 SPIE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

TRAIL: Trust-Aware Client Scheduling for Semi-Decentralized Federated Learning 39

TRAIL: Trust-Aware Client Scheduling for Semi-Decentralized ...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Hu, Gangqiang Lu, Jianfeng Han, Jianmin Cao, Shuqin Liu, Jing Fu, Hao School of Computer Science and Technology Zhejiang Normal University China School of Computer Science and Technology Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

ISBN: (纸本)157735897X

Due to the sensitivity of data, Federated Learning (FL) is employed to enable distributed machine learning while safeguarding data privacy and accommodating the requirements of various devices. However, in the context of semi-decentralized FL, clients’ communication and training states are dynamic. This variability arises from local training fluctuations, heterogeneous data distributions, and intermittent client participation. Most existing studies primarily focus on stable client states, neglecting the dynamic challenges inherent in real-world scenarios. To tackle this issue, we propose a TRust-Aware clIent scheduLing mechanism called TRAIL, which assesses client states and contributions, enhancing model training efficiency through selective client participation. We focus on a semi-decentralized FL framework where edge servers and clients train a shared global model using unreliable intra-cluster model aggregation and inter-cluster model consensus. First, we propose an adaptive hidden semi-Markov model to estimate clients’ communication states and contributions. Next, we address a client-server association optimization problem to minimize global training loss. Using convergence analysis, we propose a greedy client scheduling algorithm. Finally, our experiments conducted on real-world datasets demonstrate that TRAIL outperforms state-of-the-art baselines, achieving an improvement of 8.7% in test accuracy and a reduction of 15.3% in training loss. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Simplifying Control Mechanism in Text-to-Image Diffusion Models 39

Simplifying Control Mechanism in Text-to-Image Diffusion Mod...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Feng, Zhida Chen, Li Sun, Yuenan Liu, Jiaxiang Feng, Shikun School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China Baidu Inc China

ISBN: (纸本)157735897X

ControlNet has significantly advanced controllable image generation by integrating dense conditions (such as depth and canny edges) with text-to-image diffusion models. However, ControlNet’s integration requires an additional amount nearly equal to half of the base diffusion model’s parameters, making it inefficient. To address this, we introduce Simple-ControlNet, an efficient and streamlined network for controllable text-to-image generation. It employs a single-scale projection layer to incorporate condition information into the denoising U-Net. It is supplemented by Low-Rank Adapter (LoRA) parameters to facilitate condition learning. Impressively, Simple-ControlNet requires fewer than 3 million parameters for the control mechanism, substantially less than the 300 million needed by ControlNet. Our extensive experiments confirm that Simple-ControlNet matches and surpasses ControlNet’s performance across a broad range of tasks and base diffusion models, showcasing its utility and efficiency. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Controllability

来源：评论

学校读者我要写书评

暂无评论

Friedkin-Johnsen Model for Opinion Dynamics on Signed Graphs

arXiv

引用

arXiv 2024年

作者： Zhou, Xiaotian Sun, Haoxin Xu, Wanyue Li, Wei Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China The Academy for Engineering and Technology Fudan University Shanghai200433 China

A signed graph offers richer information than an unsigned graph, since it describes both collaborative and competitive relationships in social networks. In this paper, we study opinion dynamics on a signed graph, based on the Friedkin-Johnsen model. We first interpret the equilibrium opinion in terms of a defined random walk on an augmented signed graph, by representing the equilibrium opinion of every node as a combination of all nodes’ internal opinions, with the coefficient of the internal opinion for each node being the difference of two absorbing probabilities. We then quantify some relevant social phenomena and express them in terms of the 2 norms of vectors. We also design a nearly-linear time signed Laplacian solver for assessing these quantities, by establishing a connection between the absorbing probability of random walks on a signed graph and that on an associated unsigned graph. We further study the opinion optimization problem by changing the initial opinions of a fixed number of nodes, which can be optimally solved in cubic time. We provide a nearly-linear time algorithm with error guarantee to approximately solve the problem. Finally, we execute extensive experiments on sixteen real-life signed networks, which show that both of our algorithms are effective and efficient, and are scalable to massive graphs with over 20 million nodes. Copyright © 2024, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

An Entity Alignment Algorithm Based on Ontology Enhancement and Multi-Feature Fusion

An Entity Alignment Algorithm Based on Ontology Enhancement ...

引用

Frontiers technology of information and computer (ICFTIC), IEEE International Conference on

作者： Hao Song Yuxia Lei Kangli Zi Fuyuan Quan Tianhang Zhang Qi Li School of Computer Science Qufu Normal University Rizhao Shandong China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (数字)9798331541750

ISBN: (纸本)9798331541767

Entity alignment plays a crucial role in the integration of knowledge graphs. However, current knowledge graphs often suffer from inconsistent construction standards, structural heterogeneity, and imprecise semantic representation of entities, which can lead to suboptimal embedding of structural information. Moreover, most existing entity alignment methods rely heavily on structural information, which limits alignment efficiency. To address these challenges, this paper presents Onto-IMF, an ontology-enhanced entity alignment method based on multi-feature fusion. This approach aims to enhance the semantic representation of entities by incorporating ontology information, thereby reducing structural discrepancies among heterogeneous graphs and improving the embedding of structural information. The multi-feature fusion entity alignment leverages diverse semantic features, including relations, attributes, and entity names, to achieve more accurate alignment. Experimental results on various DBP15K subsets indicate that the proposed method achieves Hits@l scores of 86.6%, 93.0%, and 97.7%, respectively, representing an average improvement of 7.9 % over the best-performing baseline models.

关键词： Accuracy Semantics Knowledge graphs Contrastive learning Ontologies Data models Standards

来源：评论

学校读者我要写书评

暂无评论

GALA3D: Towards Text-to-3D Complex Scene Generation via Layout-guided Generative Gaussian Splatting

arXiv

引用

arXiv 2024年

作者： Zhou, Xiaoyu Ran, Xingjian Xiong, Yajiao He, Jinlin Lin, Zhiwei Wang, Yongtao Sun, Deqing Yang, Ming-Hsuan Wangxuan Institute of Computer Technology Peking University China National Key Laboratory for Multimedia Information Processing Google DeepMind United Kingdom University of California Merced United States

We present GALA3D, generative 3D GAussians with LAyout-guided control, for effective compositional text-to-3D generation. We first utilize large language models (LLMs) to generate the initial layout and introduce a layout-guided 3D Gaussian representation for 3D content generation with adaptive geometric constraints. We then propose an instance-scene compositional optimization mechanism with conditioned diffusion to collaboratively generate realistic 3D scenes with consistent geometry, texture, scale, and accurate interactions among multiple objects while simultaneously adjusting the coarse layout priors extracted from the LLMs to align with the generated scene. Experiments show that GALA3D is a user-friendly, end-to-end framework for state-of-the-art scene-level 3D content generation and controllable editing while ensuring the high fidelity of object-level entities within the scene. The source codes and models will be available at ***. Copyright © 2024, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

Improved Res2Net Based on Multi-scale Attention Mechanism for Breast Cancer Image Classification 12th

Improved Res2Net Based on Multi-scale Attention Mechanism fo...

引用

12th International Conference on computer Engineering and Networks, CENet 2022

作者： Lei, Suqin Deng, Xing Shao, Haijian Xia, Wang Department of Computer Jiangsu University of Science and Technology Jiangsu Zhenjiang212003 China College of Automation Key Laboratory of Ministry of Education of Complex Engineering System Measurement and Control Southeast University Jiangsu Nanjing210009 China School of Information Science and Technology Nantong University Nantong Jiangsu226019 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore

ISBN: (纸本)9789811969003

Breast cancer is one of the most common cancers among female diseases. Since the classification accuracy of pathological images is crucial to the diagnosis of breast cancer, in order to reduce the error of manual diagnosis and improve the automatic classification accuracy of pathological images, this paper proposes a high-accuracy breast cancer classification method based on multi-scale attention mechanism enhanced Res2Net. By constructing a multi-channel residual connection in the residual block, and introducing a convolutional attention mechanism to enhance the feature extraction ability of Res2Net, and using group convolution to replace part of the ordinary convolution. In addition, since the channel information interaction across groups cannot be realized in the group convolution, which reduces the feature extraction ability. In this paper, the channel shuffling operation is used to reorganize the feature maps after the group convolution to achieve the information interaction between different groups. The evaluation results on the BreaKHis dataset show that, the accuracy and precision of the method in this paper have reached 98.5% and 98.9% respectively, in binary classification of histopathological images compared with the benchmark method, and the advantages of recall rate and F1 value are also more obvious. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：