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

2006 International Conference on Computational Intelligence and Security, ICCIAS 2006

作者： Zhang, Wencong Chen, Hong Yao, Peng Li, Bin Zhuang, Zhenquan University of Science and Technology of China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication Hefei 230026 Anhui China

ISBN: (纸本)1424406056

The accuracy of face alignment affects greatly the performance of a face recognition system. Since the face alignment is usually conducted using eye positions, the algorithm for accurate eye localization is therefore essential for the accurate face recognition. In this paper, we propose a novel algorithm for eye localization. Based on the special gray distribution in the eye region, proper AdaBoost detection is adaptively trained to segment the eye region. After getting the region of eyes, a fast radial symmetry operator is used to precisely locate the center of eyes. Experimental results show that the method can accurately locate the eyes, and it is robust to the variations of face poses, expressions, accessions and illuminations. © 2006 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Address assignment in wireless sensor networks using game approach

Address assignment in wireless sensor networks using game ap...

引用

IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006

作者： Kim, Tu Naijie, Gu Kim, Bi Wanli, Dong Dept. of Comput. Sci. and Technol. Univ. of Sci. and Technol. of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0863416446

In this paper, we propose a game model to solve the MAC address assignment in sensor networks. Insufficiency of battery power of sensors makes the conservation of the energy be the main design issues for the sensor networks. Due to the small packet payload, the MAC header is a significant and energy-costly overhead. To remedy this, we propose a novel scheme for a MAC address assignment. The key feature which makes our approach unique is that we propose a mixed strategy game model to solve the address assignment problem. We prove that there is a mixed strategy Nash equilibrium in our game model. The model takes advantage of the exploitation of spatial address ruse to save energy. Our model is easy to implement, which makes it a potential candidate for practical implementations, even for very large networks.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Full-space LDA with evolutionary selection for face recognition

Full-space LDA with evolutionary selection for face recognit...

引用

2006 International Conference on Computational Intelligence and Security, ICCIAS 2006

作者： Li, Xin Li, Bin Chen, Hong Wang, XianJi Zhuang, ZhengQuan University of Science and Technology of China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication Hefei 230026 Anhui China

ISBN: (纸本)1424406056

Linear Discriminant Analysis (LDA) is a popular feature extraction technique for face recognition. However, it often suffers from the small sample size problem when dealing with the high dimensional face data. Some approaches have been proposed to overcome this problem, but they usually utilize all eigenvectors of null or range subspaces of within-class scatter matrix(S W). However, experimental results testified that not all the eigenvectors in the full space of SW. are positive to the classification performance, some of which might be negative. As far as we know, there have been no effective ways to determine which eigenvectors should be adopted. This paper proposes a new method EDA +Full-space LDA, which takes full advantage of the discriminative information of the null and range subspaces of SW by selecting an optimal subset of eigenvectors. An Estimation of Distribution Algorithm (EDA) is used to pursuit a subset of eigenvectors with significant discriminative information in full space of SW. EDA+Full-space LDA is tested on ORL face image database. Experimental results show that our method outperforms other LDA methods. © 2006 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Kurtosis normalization after short-time gaussianization for robust speaker verification

Kurtosis normalization after short-time gaussianization for ...

引用

6th World Congress on Intelligent Control and Automation, WCICA 2006

作者： Yanlu, Xie Beiqian, Dai Jun, Sun MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China HeifeiAnhui 230027 China

ISBN: (纸本)1424403324

Statistical normalization has been popularly used to transform the distribution of the speech feature to decrease the mismatch between the training and test environment in robust speaker verification. This paper presents a method to normalization kurtosis which can measure the non-Gaussianity in quantity. The kurtosis normalization method proposed here is based on the cumulative distribution function (CDF) of a sub-Gaussian function and used after the short-time Gaussianization normalization method in feature space. Thus the distribution of speech parameters becomes more approximate the normal one. Experimental results based on the 2001 NIST SRE database show that when the short-time non-Gaussianity and kurtosis are both normalized, significant improvement could be achieved in not only equal error rate but also minimum detection cost compared to baseline system. © 2006 IEEE.

关键词： Statistical process control

来源：评论

学校读者我要写书评

暂无评论

Neighborhood-based distributed topological hole detection algorithm in sensor networks

Neighborhood-based distributed topological hole detection al...

引用

IET International Conference on Wireless Mobile and Multimedia Networks Proceedings, ICWMMN 2006

作者： Kun, Bi Naijie, Gu Kun, Tu Wanli, Dong Dept. of Comput. Sci. and Technol. Univ. of Sci. and Technol. of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0863416446

Topological holes in sensor networks usually indicate the region where nodes are depleted or not dense enough due to kinds of reasons. In this paper, we study the problem of detecting topological holes in wireless sensor networks. Those sensor nodes have no geographic location information and have a limited communication range. We present a novel distributed topological holes detection algorithm which is based purely on the logical communication topology graph. By exchanging information with its 1-hop and 2-hop neighbors, each node can independently decide whether it is on the boundary of a hole. Those boundary sensor nodes together could describe the region of the topological hole. Experimental results show that our distributed algorithm is effective in exploiting those characteristics of those nodes on the boundaries of holes. And thus it could identify those holes in sensor networks of moderate node densities.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Games on Weighted Newman-Watts Small-World Networks

引用

Chinese Physics Letters 2009年第5期26卷 255-258页

作者：杜文博曹先彬赵琳周宏 Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230026 School of Life Sciences University of Science and Technology of China Hefei 230026

We investigate the evolutionary prisoner＇s dilemma game （PDG） on weighted Newman-Watts （NW） networks. In weighted NW networks, the link weight ωij is assigned to the link between the nodes i and j as： ωij = （ki · kj）^β, where ki（kj） is the degree of node i（j） and β represents the strength of the correlations. Obviously, the link weight can be tuned by only one parameter β. We focus on the cooperative behavior and wealth distribution in the system. Simulation results show that the cooperator frequency is promoted by a large range of β and there is a minimal cooperation frequency around β = -1. Moreover, we also employ the Gini coefficient to study the wealth distribution in the population. Numerical results show that the Gini coefficient reaches its minimum when β≈ -1. Our work may be helpful in understanding the emergence of cooperation and unequal wealth distribution in society.

关键词： PRISONER'S dilemma game COOPERATIVENESS INCOME distribution SIMULATION methods & models GINI coefficient NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

The g-dominance Relation for Preference-Based Evolutionary Multi-Objective Optimization

The g-dominance Relation for Preference-Based Evolutionary M...

引用

2019 IEEE Congress on Evolutionary Computation, CEC 2019

作者： Luo, Wenjian Shi, Luming Lin, Xin Coello Coello, Carlos A. Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei230027 China Departmento de Sistemas UAM-Azcapotzalco Mexico City Mexico

ISBN: (纸本)9781728121536

In evolutionary multi-objective optimization, the results generated by an evolutionary algorithm usually contain an approximation, as good as possible, of the entire Pareto-optimal front. However, sometimes the number of Pareto-optimal solutions may be so large that the decision maker (DM) is incapable of manipulating or understanding them. Methods for considering only the Pareto-optimal solutions that the DM prefers indeed constitute a hot research topic in the evolutionary computation field. In this paper, we introduce a new dominance relation called hat g-dominance, which is an improved version of the g-dominance relation and can be easily implemented in traditional multi-objective evolutionary algorithms. In this work, the proposed hat g-dominance is implemented in NSGA-II. Our experimental results show the effectiveness of hat g-NSGA-II with respect to the original g-NSGA-II. © 2019 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Uplink Supportive Number of Users in Massive MIMO Systems 9

Uplink Supportive Number of Users in Massive MIMO Systems

引用

2017 9th IEEE International Conference on communication software and Networks (ICCSN 2017)

作者： Jun Zhu Chao Wang Peng Ma Chaochao Jia Kai Li Key laboratory of Intelligent Computing & Signal Processing (Anhui University) Ministry of Education Technology and Innovation Department Shanghai Research Center for Wireless Communication

ISBN: (纸本)9781509038237;9781509038220

The supportive number of users achieving the maximum sum rate is studied in uplink massive MIMO systems for zero-forcing(ZF) and maximum-ratio combining(MRC). We obtain the lower bound of the achievable rate of each user for ZF and MRC receivers with any finite number of base station(BS) antennas, respectively. By this theoretical result, this paper will focus on the supportive number of users which was constrained with the minimum achievable rate. Through analyzing the optimal problem of maximizing the overall sum rate, we obtain the expression of optimal number of users and present the user scheduling algorithm for achieving the maximized sum rate. The numerical results show that the massive MIMO systems can improve the supportive number of users, and ZF receivers can support more number of users than MRC under the same condition.

关键词： large number of antennas achievable uplink rate supportive number of users massive MIMO

来源：评论

学校读者我要写书评

暂无评论

LMP-GAN: Out-Of-Distribution Detection For Non-Control Data Malware Attacks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Wood, David Kapp, David Kebede, Temesgen Hirakawa, Keigo Wuhan University School of Computer Science China Wuhan University National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering China Zhongguancun Academy China Wuhan University State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing China Sun Yat-sen University School of Geography and Planning China Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Chongqing University College of Computer Science China The University of Tokyo Japan RIKEN Center for Advanced Intelligence Project Japan Intelligent Science & Technology Academy Limited CASIC China iFlytek Company Ltd. National Engineering Research Center of Speech and Language Information Processing China Nanyang Technological University College of Computing & Data Science Singapore Henan Academy of Sciences Aerospace Information Research Institute China

Anomaly detection is a common application of machine learning. Out-of-distribution (OOD) detection in particular is a semi-supervised anomaly detection technique where the detection method is trained only on the inlier (in-distribution) samples - unlike the fully supervised variant, the distribution of the outlier samples are never explicitly modeled in OOD detection tasks. In this work, we design a novel GAN-based OOD detection network specifically designed to protect a cyber-physical signal systems from novel Trojan malware called non-control data (NCD) attack that evades conventional malware detection techniques. Inspired in part by the classical locally most powerful (LMP) test in statistical inferences, the proposed LMP-GAN trains the OOD detector (discriminator) by generating OOD samples that are aimed at making maximal alteration to the inlier samples while evading detection. We experimentally compare the results to the state-of-the-art anomaly detection methods to demonstrate the benefits and the appropriateness of the LMP-GAN OOD detector. © 2025 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

An adaptive strategy for updating the memory in evolutionary algorithms for dynamic optimization

An adaptive strategy for updating the memory in evolutionary...

引用

IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments

作者： Zhu, Tao Luo, Wenjian Li, Zhifang Nature Inspired Computation and Applications Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9781424499311

The memory scheme is one of the most widely employed techniques in Evolutionary Algorithms for solving dynamic optimization problems. The updating strategy is a key concern for the memory scheme. Unfortunately, the existent memory updating strategies neglect the characteristics of the memory updating behaviors, and sometimes this could lead results against the original intention. In this paper, a novel updating strategy is proposed, which can adaptively update the memory according to the characteristics of the memory updating behaviors. Experiments are carried out in different kinds of dynamic environments, and the experimental results show that the proposed strategy is better than the traditional strategies. © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：