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

Congress on Evolutionary Computation

作者： Junchao Fang Wei Fang Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi China

In evolutionary many-objective optimization, achieving better balance between convergence and diversity of the population is a crucial way to improve the efficiency of the algorithm. However, diversity measure may select the individuals having good diversity but degrade the convergence process to a certain extent. If the convergence measure focuses on the convergence of the individuals too much, it may lead to local convergence. The selection pressure achieves a severe loss, especially when the Pareto dominance selection mechanism is difficult to select solutions. To address these issues, a many-objective evolutionary algorithm based on new angle penalized distance is proposed in this paper, which is termed MaOEA-NAPD. In MaOEA-NAPD, it could dynamically balance the convergence and diversity of the population concerning their importance degree during the evolutionary process based on new angle penalized distance. In order to enhance the selection probability of better solutions in the mating pool, new convergence measure and diversity measure are introduced according to the achievement scalarizing function and angle based crowding degree estimation, respectively. The performance of the proposed method is evaluated and compared with five state-of-the-art algorithms on the WFG test suites with up to 15 objectives. Experimental results show the superior performance of MaOEA-NAPD than the compared algorithms on all the considered test instances.

关键词： Heuristic algorithms Sociology Estimation Evolutionary computation Statistics Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

Spectral Efficiency for Multi-pair Massive MIMO Two-Way Relay Networks with Hybrid Processing 8th

Spectral Efficiency for Multi-pair Massive MIMO Two-Way Rela...

引用

8th International Conference on Communications, Signal Processing, and Systems, CSPS 2019

作者： Wang, Hongyan Li, Zhengquan Xue, Xiaomei Li, Baolong Liu, Yang Wu, Guilu Wu, Qiong Graduate School of Engineering Nagasaki University Nagasaki852-8521 Japan Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi214122 China National Mobile Communication Research Laboratory Southeast University Nanjing210096 China

ISBN: (纸本)9789811394089

In millimeter wave (mm-wave) communication systems, large antenna array can be employed for higher data rates. Hybrid digital and analogue beamforming design is adopted to reduce the digital signal processing (DSP) power consumption and the circuitry complexity. In this paper, we investigate the multi-pair massive MIMO two-way relay networks with hybrid processing architecture. Furthermore, the power scaling scheme is also considered. We got some conclusions that when the number of antennas at relay station M goes huge, the asymptotic spectral efficiency can be obtained. We also compared three cases of power scaling schemes and obtained the optimal case specially when M tends to considerable large. We can draw the conclusion that when, the Case 2 (only the transmit power of users scaled by M in power scaling schemes) is the optimal case compared with the other two cases. Finally, the Monte-Carlo is employed to demonstrate the validity of analytical results. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Spectrum efficiency

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Flexible Automatic Search Algorithm for Convolution Network Architectures

An Efficient and Flexible Automatic Search Algorithm for Con...

引用

Congress on Evolutionary Computation

作者： Liang Zhao Wei Fang Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi China

As many superior convolutional neural networks (CNNs) have been proposed in recent years, CNNs have played an important role in computer vision. However, manually-designing CNN architecture is difficult since expertise is required. Therefore, several automatic search algorithms have been proposed for neural architecture search, which usually have considerable computational complexity and the search space is limited. To address these problems, an efficient and flexible CNN architecture search algorithm (EF-CNN) is proposed in this paper. In EF-CNN, a flexible architecture search space is constructed by considering the depth, width, and lightweight blocks. In order to improve the reliability of the architecture while reducing the computational time, a multi-objective fitness correction method is proposed in EF-CNN based on the divided datasets, where the accuracy and computational complexity of architecture are considered simultaneously to design CNN. The experimental results on CIFAR-10 and CIFAR-100 indicate that the performance of CNN architecture designed by EF-CNN is very competitive while the computational time is greatly reduced.

关键词： Computer vision Convolution Computer architecture Manuals Evolutionary computation Network architecture Search problems

来源：评论

学校读者我要写书评

暂无评论

A Dual-Branch Network for Infrared and Visible Image Fusion

A Dual-Branch Network for Infrared and Visible Image Fusion

引用

International Conference on pattern recognition

作者： Yu Fu Xiao-Jun Wu Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi China

In recent years, deep learning has been used extensively in the field of image fusion. In this article, we propose a new image fusion method by designing a new structure and a new loss function for a deep learning model. Our backbone network is an autoencoder, in which the encoder has a dual branch structure. We input infrared images and visible light images to the encoder to extract detailed information and semantic information respectively. The fusion layer fuses two sets of features to get fused features. The decoder reconstructs the fusion features to obtain the fused image. We design a new loss function to reconstruct the image effectively. Experiments show that our proposed method achieves state-of-the-art performance.

关键词： Deep learning Fuses Image synthesis Semantics Feature extraction Decoding Data mining

来源：评论

学校读者我要写书评

暂无评论

A Grassmannian Manifold Self-Attention Network for Signal Classification 33

A Grassmannian Manifold Self-Attention Network for Signal Cl...

引用

33rd International Joint Conference on Artificial Intelligence, IJCAI 2024

作者： Wang, Rui Hu, Chen Chen, Ziheng Wu, Xiao-Jun Song, Xiaoning School of Artificial Intelligence and Computer Science Jiangnan University Wuxi China Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi China Department of Information Engineering and Computer Science University of Trento Trento Italy

ISBN: (纸本)9781956792041

In the community of artificial intelligence, significant progress has been made in encoding sequential data using deep learning techniques. Nevertheless, how to effectively mine useful information from channel dimensions remains a major challenge, as these features have a submanifold structure. Linear subspace, the basic element of the Grassmannian manifold, has proven to be an effective manifold-valued feature descriptor in statistical representation. Besides, the Euclidean self-attention mechanism has shown great success in capturing long-range relationships of data. Inspired by these facts, we extend the self-attention mechanism to the Grassmannian manifold. Our framework can effectively characterize the spatiotemporal fluctuations of sequential data encoded in the Grassmannian manifold. Extensive experimental results on three benchmarking datasets (a drone recognition dataset and two EEG signal classification datasets) demonstrate the superiority of our method over the state-of-the-art. The code and supplementary material for this work can be found at https://***/ChenHu-ML/GDLNet. © 2024 International Joint Conferences on Artificial Intelligence. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Editorial

引用

International Journal of Bio-Inspired Computation 2020年第2期16卷 67-67页

作者： Fang, Wei Wu, Xiaojun Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Department of Computer Science and Technology Jiangnan University 214122 China

来源：评论

学校读者我要写书评

暂无评论

A dual-branch network for infrared and visible image fusion

arXiv

引用

arXiv 2021年

作者： Fu, Yu Wu, Xiao-Jun Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi214122 China

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

A Parallel High-Utility Itemset Mining Algorithm Based on Hadoop

引用

Complex System Modeling and Simulation 2023年第1期3卷 47-58页

作者： Zaihe Cheng Wei Shen Wei Fang Jerry Chun-Wei Lin School of Internet of Things Wuxi Institute of TechnologyWuxi 214121China School of Artificial Intelligence and Computer Science Jiangnan UniversityWuxi 214122China Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan UniversityWuxi 214122China Department of Computer Science Electrical Engineering and Mathematical SciencesWestern Norway University of Applied SciencesBergen 5020Norway

High-utility itemset mining(HUIM)can consider not only the profit factor but also the profitable factor,which is an essential task in data ***,most HUIM algorithms are mainly developed on a single machine,which is inefficient for big data since limited memory and processing capacities are available.A parallel efficient high-utility itemset mining(P-EFIM)algorithm is proposed based on the Hadoop platform to solve this problem in this *** P-EFIM,the transaction-weighted utilization values are calculated and ordered for the itemsets with the MapReduce *** the ordered itemsets are renumbered,and the low-utility itemsets are pruned to improve the dataset *** the Map phase,the P-EFIM algorithm divides the task into multiple independent *** uses the proposed S-style distribution strategy to distribute the subtasks evenly across all nodes to ensure ***,the P-EFIM uses the EFIM algorithm to mine each subtask dataset to enhance the performance in the Reduce *** are performed on eight datasets,and the results show that the runtime performance of P-EFIM is significantly higher than that of the PHUI-Growth,which is also HUIM algorithm based on the Hadoop framework.

关键词： pattern mining data mining Hadoop parallel high-utility itemset mining big data

来源：评论

学校读者我要写书评

暂无评论

Infrared and visible image fusion using Latent Low-Rank Representation

arXiv

引用

arXiv 2018年

作者： Li, Hui Wu, Xiao-Jun Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence School of IoT engineering Jiangnan University Wuxi China

Infrared and visible image fusion is an important problem in the field of image fusion which has been applied widely in many fields. To better preserve the useful information from source images, in this paper, we propose a novel image fusion method based on latent low-rank representation(LatLRR) which is simple and effective. Firstly, the source images are decomposed into low-rank parts(global structure) and salient parts(local structure) by LatLRR. Then, the low-rank parts are fused by weighted-average strategy to preserve more contour information. Then, the salient parts are simply fused by sum strategy which is a efficient operation in this fusion framework. Finally, the fused image is obtained by combining the fused low-rank part and the fused salient part. Compared with other fusion methods experimentally, the proposed method has better fusion performance than state-of-the-art fusion methods in both subjective and objective evaluation. The Code of our fusion method is available at https://***/hli1221/imagefusion_Infrared_visible_latlrr. Copyright © 2018, The Authors. All rights reserved.

关键词： Infrared imaging

来源：评论

学校读者我要写书评

暂无评论

Feature Space Renormalization for Semi-supervised Learning

arXiv

引用

arXiv 2023年

作者： Sun, Jun Mao, Zhongjie Li, Chao Zhou, Chao Wu, Xiao-Jun The School of Artificial Intelligence and Computer Science Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University 1800 Lihu Avenue Jiangsu Wuxi214122 China The Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University 1800 Lihu Avenue Jiangsu Wuxi214122 China

Semi-supervised learning (SSL) has been proven to be a powerful method for leveraging unlabelled data to alleviate models' dependence on large labelled datasets. The common framework among recent approaches is to train the model on a large amount of unlabelled data with consistency regularization to constrain the model predictions to be invariant to input perturbation. However, the existing SSL frameworks still have room for improvement in the consistency regularization method. Instead of regularizing category predictions in the label space as in existing frameworks, this paper proposes a feature space renormalization (FSR) mechanism for SSL. First, we propose a feature space renormalization mechanism to substitute for the commonly used consistency regularization mechanism to learn better discriminative features. To apply this mechanism, we start by building a basic model and an empirical model and then introduce our mechanism to renormalize the feature learning of the basic model with the guidance of the empirical model. Second, we combine the proposed mechanism with pseudo-labelling to obtain a novel effective SSL model named FreMatch. The experimental results show that our method can achieve better performance on a variety of standard SSL benchmark datasets, and the proposed feature space renormalization mechanism can also enhance the performance of other SSL approaches. Copyright © 2023, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：