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

41st International Conference on Machine Learning, ICML 2024

作者： Hua, Cong Xu, Qianqian Bao, Shilong Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Object Detection Algorithm Based on Second-Order Pooling Network and Gaussian Mixture Attention 5

Object Detection Algorithm Based on Second-Order Pooling Net...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Ma, Sugang Li, Ningbo Yang, Xiaobao School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Shaanxi Xi'an China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an University of Posts and Telecommunications Shaanxi Xi'an China

ISBN: (纸本)9781450396899

To improve the feature representation ability of the YOLOX algorithm and obtain better detection performance, an object detection algorithm based on second-order pooling network and gaussian mixture attention is proposed. Firstly, the second-order pooling network is added after the PAFPN, and the higher-order statistical information is obtained by calculating the covariance matrix between different channels, to enhance the non-linear modeling capability. Secondly, the mixture attention based on the gaussian function is added after the SPP to model global contexts in the spatial and channel dimensions respectively, which improves the network performance with almost no extra parameters. The experimental results show that the detection accuracy of the proposed algorithm on the PASCAL VOC dataset reaches 82.6 %, which is 1.6 % higher than the YOLOX algorithm. © 2022 ACM.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

UAV Visual Tracking Algorithm Based on Feature Fusion of the Attention Mechanism 5

UAV Visual Tracking Algorithm Based on Feature Fusion of the...

引用

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Ma, Sugang Zhang, Zixian Zhao, Zhixian Yang, Xiaobao Hou, Zhiqiang School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Shaanxi Xi'an China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an University of Posts and Telecommunications Shaanxi Xi'an China

ISBN: (纸本)9781450396899

To enhance the expression ability of deep features and improve the tracking performance of the fully convolutional siamese network (SiamFC) in the UAV scene, we propose a UAV visual tracking algorithm based on feature fusion of the attention mechanism. By designing the local perception attention module and the global perception attention module to enhance the features extracted from the backbone network, a set of complementary local enhanced features and global enhanced features are obtained. And then, the tracking response map fused with the two features is then located, which effectively improves the tracking robustness of SiamFC in the UAV scene. The algorithm and nine other related algorithms such as SiamFC are tested on the DTB70 dataset. The experiments show that the algorithm has a good tracking performance and can adapt to the visual object tracking task in the UAV scene. © 2022 ACM.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Suppress Content Shift: Better Diffusion Features via Off-the-Shelf Generation Techniques 38

Suppress Content Shift: Better Diffusion Features via Off-th...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Yang, Zhiyong Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Computer Science and Tech. University of Chinese Academy of Sciences China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DGN-MEF:A DenseNet-Based Multi-Exposure Image Fusion Framework using Adaptive Gabor convolution

DGN-MEF:A DenseNet-Based Multi-Exposure Image Fusion Framewo...

引用

第43届中国控制会议

作者： Mei Zhang Ye Jin Jinhui Zhu School of Automation Science and Engineering South China University of Technology School of Software Engineering South China University of Technology Key Laboratory of Big Data and Intelligent Robot Ministry of Education

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

Multi-exposure image fusion is a cost-effective method to improve the dynamic range of images. For the problems of inadequate detail extraction in bright and dark areas and the over simplicity of existing fusion rules by current deep learning multi-exposure image fusion algorithms, we propose a DenseNet-based framework using adaptive Gabor convolution. Building on the Dense network architecture, we design an adaptive Gabor convolution module, which the parameters of the Gabor filter can be updated along with the network, enhancing the ability of Gabor to extract image features. Additionally, a cross-domain aggregation attention module is proposed, which effectively aggregates and enhances information. Comparing our method with seven advanced methods on the multi-exposure image fusion benchmark dataset, the subjective and objective evaluations outperform the other methods, proving the effectiveness and superiority of our method. The experiments of different exposure images fusion demonstrate the good generalization performance of our method.

关键词： Multi-exposure Image Fusion Adaptive Gabor Convolution Cross-domain Aggregation Attention

来源：评论

学校读者我要写书评

暂无评论

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features 38

Not All Diffusion Model Activations Have Been Evaluated as D...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Situation Awareness on Blockchain Based on Markov Game Model 4

Situation Awareness on Blockchain Based on Markov Game Model

引用

4th International Symposium on Smart and Healthy Cities, ISHC 2022

作者： Wang, Peng Qian, Baojian Yan, Yaoxi Sun, Jinyu Chen, Fubing Huaiyin Normal University Huai'an Key Laboratory of Big Data Intelligent Computing and Analysis Jiangsu Huaian223300 China School of Computer Science and Technology Huaiyin Normal University Jiangsu Huaian223300 China

ISBN: (纸本)9781665491808

Aiming at the network security problem of the blockchain system, the game model based on Markov is proposed. The model perceives the network security situation of the blockchain system, accurately and comprehensively evaluates the current security status of the system through clustering screening and attack game, dynamically evaluates the security situation of the system, and establishes an attack transfer network and the best reinforcement scheme. The experiment shows that the Markov game model based on 51% double spend attack can evaluate and predict the current and future security status of the blockchain system, and can reduce the asset loss caused by blockchain attacks to a certain extent. © 2022 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

A Region Enhanced Discrete Multi-Objective Fireworks Algorithm for Low-Carbon Vehicle Routing Problem

引用

Complex System Modeling and Simulation 2022年第2期2卷 142-155页

作者： Xiaoning Shen Jiaqi Lu Xuan You Liyan Song Zhongpei Ge Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Jiangsu Key Laboratory of Big Data Analysis TechnologySchool of AutomationNanjing University of Information Science and TechnologyNanjing 210044China School of Automation Nanjing University of Information Science and TechnologyNanjing 210044China Institute of Trustworthy Autonomous Systems and also with the Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent ComputationDepartment of Computer Science and EngineeringSouthern University of Science and TechnologyShenzhen 518055China

A constrained multi-objective optimization model for the low-carbon vehicle routing problem(VRP)is established.A carbon emission measurement method considering various practical factors is *** minimizes both the total carbon emissions and the longest time consumed by the sub-tours,subject to the limited number of available *** to the characteristics of the model,a region enhanced discrete multi-objective fireworks algorithm is proposed.A partial mapping explosion operator,a hybrid mutation for adjusting the sub-tours,and an objective-driven extending search are designed,which aim to improve the convergence,diversity,and spread of the non-dominated solutions produced by the algorithm,*** low-carbon VRP instances with different scales are used to verify the effectiveness of the new ***,comparison results with four state-of-the-art algorithms indicate that the proposed algorithm has better performance of convergence and distribution on the low-carbon *** provides a promising scalability to the problem size.

关键词： vehicle routing problem carbon emission multi-objective optimization fireworks algorithm region enhanced

来源：评论

学校读者我要写书评

暂无评论

Variable projection algorithms with sparse constraint for separable nonlinear models

引用

Control Theory and Technology 2024年第1期22卷 135-146页

作者： Hui-Lang Xu Guang-Yong Chen Si-Qing Cheng Min Gan Jing Chen College of Computer and Data Science Fuzhou UniversityFuzhou350116FujianChina Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350116FujianChina Key Laboratory of Intelligent Metro of Universities in Fujian Fuzhou UniversityFuzhou350116FujianChina Engineering Research Center of Big Data Intelligence Ministry of EducationFuzhou UniversityFuzhou350116FujianChina School of Science Jiangnan UniversityWuxi214122JiangsuChina

Separable nonlinear models are widely used in various fields such as time series analysis, system modeling, and machine learning, due to their flexible structures and ability to capture nonlinear behavior of data. However, identifying the parameters of these models is challenging, especially when sparse models with better interpretability are desired by practitioners. Previous theoretical and practical studies have shown that variable projection (VP) is an efficient method for identifying separable nonlinear models, but these are based on \(L_2\) penalty of model parameters, which cannot be directly extended to deal with sparse constraint. Based on the exploration of the structural characteristics of separable models, this paper proposes gradient-based and trust-region-based variable projection algorithms, which mainly solve two key problems: how to eliminate linear parameters under sparse constraint;and how to deal with the coupling relationship between linear and nonlinear parameters in the model. Finally, numerical experiments on synthetic data and real time series data are conducted to verify the effectiveness of the proposed algorithms.

关键词： Variable projection(VP) Non-smooth constraint Separable nonlinear models

来源：评论

学校读者我要写书评

暂无评论

DASCDC: Dual Attention-based Sparse Common Deep Clustering Method 9

DASCDC: Dual Attention-based Sparse Common Deep Clustering M...

引用

9th IEEE International Conference on Behavioural and Social computing, BESC 2022

作者： Dong, Yao Shi, Jin Deng, Yahan Dong, Yongfeng Wang, Ziqiu School of Artificial Intelligence Hebei University of Technology Tianjin300401 China Hebei Province Key Laboratory of Big Data Computing Tianjin300401 China Data Driven Industrial Intelligent Hebei Engineering Research Center Tianjin300401 China

ISBN: (数字)9798350398144

ISBN: (纸本)9798350398144

Graph convolutional network (GCN) has been successfully applied in deep clustering on the high dimensional dataset, which is usually processed by extracting the feature and structure information. However, it lacks an effective fusion mechanism of common information between the feature and structure information and does not perform well on the sparse dataset. Therefore, we propose a dual attention-based sparse common deep clustering method(DASCDC). Firstly, we advance a sparse feature representation method with an adversarial loss function to solve the data sparsity problem and improve the discriminator's performance. Then, an information interaction operator is designed to deeply mine the common information and enhance the information fusion capability. Finally, considering the different contribution degrees of various neighbour nodes and information, we promote a dual self-attention mechanism from the node and model levels. Experiment results indicate that the proposed DASCDC algorithm overperforms other state-of-art deep clustering algorithms on non-graph and graph datasets with high dimension and sparsity. © 2022 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：