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

arXiv 2018年

作者： Wu, Dongrui Huang, Jian Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

—Acquisition of labeled training samples for affective computing is usually costly and time-consuming, as affects are intrinsically subjective, subtle and uncertain, and hence multiple human assessors are needed to evaluate each affective sample. Particularly, for affect estimation in the 3D space of valence, arousal and dominance, each assessor has to perform the evaluations in three dimensions, which makes the labeling problem even more challenging. Many sophisticated machine learning approaches have been proposed to reduce the data labeling requirement in various other domains, but so far few have considered affective computing. This paper proposes two multi-task active learning for regression approaches, which select the most beneficial samples to label, by considering the three affect primitives simultaneously. Experimental results on the VAM corpus demonstrated that our optimal sample selection approaches can result in better estimation performance than random selection and several traditional single-task active learning approaches. Thus, they can help alleviate the data labeling problem in affective computing, i.e., better estimation performance can be obtained from fewer labeling queries. Copyright © 2018, The Authors. All rights reserved.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Tissue P systems with rule production/removal 18th

Tissue P systems with rule production/removal

引用

18th International Conference on Membrane Computing, CMC 1018

作者： Pan, Linqiang Song, Bosheng Zhang, Gexiang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology WuhanHubei430074 China School of Electric and Information Engineering Zhengzhou University of Light Industry ZhengzhouHenan450002 China Robotics Research Center and Key Laboratory of Fluid and Power Machinery Xihua University Chengdu610039 China

ISBN: (纸本)9783319733586

Tissue P systems are computational models inspired by the way of biochemical substance movement/exchange between two cells or between a cell and the environment, where all communication (symport/antiport) rules used in a system are initially set up and keep unchanged during any computation. In this work, a variant of tissue P systems, called tissue P systems with rule production/removal (abbreviated as TRPR P systems) is considered, where rules in a system are dynamically changed during a computation, that is, at any computation step new rules can be produced and some existing rules can be removed. The computation power of TRPR P systems is investigated. It is proved that Turing universality is achieved for TRPR P systems with one cell, and using symport rules of length at most 1, antiport rules of length at most 2 or symport rules of length at most 2 and working in a maximally parallel manner. We further show that TRPR P systems with two cells, using symport rules of length at most 1, and working in a flat maximally parallel manner, are Turing universal. © 2018, Springer International Publishing AG.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

Learning a discriminative feature network for semantic segmentation

arXiv

引用

arXiv 2018年

作者： Yu, Changqian Wang, Jingbo Peng, Chao Gao, Changxin Yu, Gang Sang, Nong Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Key Laboratory of Machine Perception Peking University Megvii Inc.

Most existing methods of semantic segmentation still suffer from two aspects of challenges: intra-class inconsistency and inter-class indistinction. To tackle these two problems, we propose a Discriminative Feature Network (DFN), which contains two sub-networks: Smooth Network and Border Network. Specifically, to handle the intra-class inconsistency problem, we specially design a Smooth Network with Channel Attention Block and global average pooling to select the more discriminative features. Furthermore, we propose a Border Network to make the bilateral features of boundary distinguishable with deep semantic boundary supervision. Based on our proposed DFN, we achieve stateof-the-art performance 86.2% mean IOU on PASCAL VOC 2012 and 80.3% mean IOU on Cityscapes dataset. Copyright © 2018, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Impulsive Multisynchronization of Coupled Multistable Neural Networks with Time-Varying Delay

引用

IEEE Transactions on Neural Networks and Learning Systems 2017年第7期28卷 1560-1571页

作者： Wang, Yan-Wu Yang, Wu Xiao, Jiang-Wen Zeng, Zhi-Gang School of Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China

This paper studies the synchronization problem of coupled delayed multistable neural networks (NNs) with directed topology. To begin with, several sufficient conditions are developed in terms of algebraic inequalities such that every subnetwork has multiple locally exponentially stable periodic orbits or equilibrium points. Then two new concepts named dynamical multisynchronization (DMS) and static multisynchronization (SMS) are introduced to describe the two novel kinds of synchronization manifolds. Using the impulsive control strategy and the Razumikhin-Type technique, some sufficient conditions for both the DMS and the SMS of the controlled coupled delayed multistable NNs with fixed and switching topologies are derived, respectively. Simulation examples are presented to illustrate the effectiveness of the proposed results. © 2012 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Dynamic vehicle scheduling based on HTN 36

Dynamic vehicle scheduling based on HTN

引用

第36届中国控制会议

作者： Yindong Shen Zhongyi Zeng Zhewei Wu School of Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control (Huazhong University of Science and Technology) Ministry of Education

ISBN: (纸本)9781538629185

Vehicle scheduling plays a crucial role in public transport bus companies. An efficient schedule can help bus companies reduce operating costs while being an essential guide to daily operations. However, the precompiled schedule is usually hard to be adhered to in practice due to the diversity of traffic and driving conditions. Therefore, dynamic vehicle scheduling becomes an important supplement to the daily operations. In this paper, a dynamic vehicle scheduling approach based on Hierarchical Task Network(HTN) is proposed. In the approach, two dynamic vehicle scheduling strategies are devised according to the practical scheduling philosophy. The first is to reschedule for individual vehicle independently, the objective is to maximize the execution of the precompiled schedule. The second is to reschedule for multiple vehicles simultaneously, which aims to maintain the scheduled headways. The two strategies are achieved in the HTN planning through different task decomposition processes, which are constrained by vehicle resources currently available. To verify the feasibility, this approach is implemented based on the Simple Hierarchical Ordered Planner 2(SHOP2), which is a domainindependent and state-based forward HTN planner. Experimental results show that the approach has good adaptability to solve dynamic vehicle schedule problem, meanwhile, it can be helpful to deal with the abnormal services agilely and hence to increase the service quality of public transit.

关键词： public transit dynamic vehicle scheduling scheduling strategies HTN planning SHOP2

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous belief formation method based on BP neural network

Heterogeneous belief formation method based on BP neural net...

引用

2018 2nd International Conference on Electronic Information Technology and Computer Engineering (EITCE 2018)

作者： Yifan Zhuang Hongwei Wang Xi Chen School of Automation Huazhong University of Science and Technology Image Processing and Intelligent Control Key Laboratory of Education Ministry of China School of Management Huazhong University of Science and Technology

The BDI model has always been the focus of subject modeling research, which includes three kinds of thinking states of the rational subject: Belief, Desire and Intention. Belief is the cognition of agent to the world;it is a collection of environmental information, other agent information, and its own information that the agent has;and it is also the basis of the agent's thinking activity. Due to differences in the individual's living environment and experience, the formation of heterogeneous beliefs is an important issue in the BDI model study. This article divides individual belief set into two parts: knowledge belief and achievable belief. This article proposes an overall framework for the formation of individual heterogeneity beliefs: First, the individual's knowledge experience is modeled, and the empirical knowledge is structured and quantified into binary propositions;then the BP neural network learn and memory propositions of different combinations to form heterogeneous beliefs. Experiments show that this method can simulate the heterogeneity of individual beliefs caused by the individual's own experience, and can realize the belief generation mechanism of gradual information flow, limited attention and heterogeneous priors.

关键词： agent Heterogeneous belief formation method based on BP neural network

来源：评论

学校读者我要写书评

暂无评论

IMPROVING PERSON RE-IDENTIFICATION BY ADAPTIVE HARD SAMPLE MINING

IMPROVING PERSON RE-IDENTIFICATION BY ADAPTIVE HARD SAMPLE M...

引用

IEEE International Conference on image processing

作者： Kezhou Chen Yang Chen Chuchu Han Nong Sang Changxin Gao Ruolin Wang Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan China School of Civil Engineering Wuhan University Wuhan China

The field of person re-identification has made significant advances riding on the wave of deep learning. However, owing to the fact that there are much more easy examples than those meaningful hard examples in dataset, the training tends to stagnate quickly and the model may suffer from over-fitting. Therefore, the hard sample mining method is fateful to optimize the model and improve the learning efficiency. In this paper, an Adaptive Hard Sample Mining algorithm is proposed for training a robust person re-identification model. No need for hand-picking the images in the batch or designing the loss function for both positive and negative pairs, we can briefly calculate the hard level by comparing the prediction result with the true label of the sample. Meanwhile, an adaptive threshold of hard level can make the algorithm not only stay in step with training process harmoniously but also alleviate the under-fitting and over-fitting problem simultaneously. Besides, the designed network to implement the approach has good generalization performance that can be combined with various of existing models readily. Experimental results on Market-1501 and DukeMTMC-reID datasets clearly demonstrate the effectiveness of the proposed algorithm.

关键词： Training Adaptation models Computational modeling Machine learning Robustness Cameras Task analysis

来源：评论

学校读者我要写书评

暂无评论

Event-Triggered Distributed Extended Kalman Filtering with Randomly Occurring Deception Attack: A Variance-Constrained Approach

Event-Triggered Distributed Extended Kalman Filtering with R...

引用

第37届中国控制会议

作者： Weihao Song Jianan Wang Jiayuan Shan Housheng Su School of Aerospace Engineering Beijing Institute of Technology School of Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology

In this paper, a distributed extended Kalman filtering algorithm is developed for a class of discrete-time nonlinear systems subject to stochastic disturbances and randomly occurring deception attacks. In order to utilize the limited communication and computation resources efficiently, the event-triggered communication scheme is introduced such that data transmission is executed only when the predefined condition is violated. Furthermore, a set of independent Bernoulli random variables with known statistical properties is defined to characterize the phenomenon of randomly occurring deception attacks. An upper bound for the estimation error covariance considering the event-triggered meachanism and linearization errors is derived via the varianceconstrained approach. The filter gain for each node can be calculated recursively by solving two Raccati-like difference equations to minimize such an upper bound, which is suitable for online application. Finally, an illustrative example is presented to verify the feasibility and effectiveness of the proposed algorithm.

关键词： Distributed filtering Event-triggered scheme Deception attacks Variance constraints

来源：评论

学校读者我要写书评

暂无评论

Universal enzymatic numerical P systems with small number of enzymatic variables

引用

Science China(Information Sciences) 2018年第9期61卷 38-49页

作者： Zhiqiang ZHANG Tingfang WU ANDrei P■UN Linqiang PAN Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology Department of Computer Science Faculty of Mathematics and Computer ScienceUniversity of Bucharest Bioinformatics Department National Institute of Research and Development for Biological Sciences School of Electric and Information Engineering Zhengzhou University of Light Industry

Numerical P systems(for short, NP systems) are distributed and parallel computing models inspired from the structure of living cells and economics. Enzymatic numerical P systems(for short, ENP systems) are a variant of NP systems, which have been successfully applied in designing and implementing controllers for mobile robots. Since ENP systems were proved to be Turing universal, there has been much work to simplify the universal systems, where the complexity parameters considered are the number of membranes, the degrees of polynomial production functions or the number of variables used in the *** the number of enzymatic variables, which is essential for ENP systems to reach universality, has not been investigated. Here we consider the problem of searching for the smallest number of enzymatic variables needed for universal ENP systems. We prove that for ENP systems as number acceptors working in the all-parallel or one-parallel mode, one enzymatic variable is sufficient to reach universality; while for the one-parallel ENP systems as number generators, two enzymatic variables are sufficient to reach *** results improve the best known results that the numbers of enzymatic variables are 13 and 52 for the all-parallel and one-parallel systems, respectively.

关键词： bio-inspired computing numerical P system mobile robot membrane controller universality

来源：评论

学校读者我要写书评

暂无评论

Multi-View broad learning system for primate oculomotor decision decoding

arXiv

引用

arXiv 2019年

作者： Shi, Zhenhua Chen, Xiaomo Zhao, Changming He, He Stuphorn, Veit Wu, Dongrui Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Zanvyl Krieger Mind and Brain Institute Johns Hopkins University School of Medicine Department of Neurobiology Stanford University StanfordCA United States Department of Neuroscience Johns Hopkins University BaltimoreMD United States

Multi-view learning improves the learning performance by utilizing multi-view data: data collected from multiple sources, or feature sets extracted from the same data source. This approach is suitable for primate brain state decoding using cortical neural signals. This is because the complementary components of simultaneously recorded neural signals, local field potentials (LFPs) and action potentials (spikes), can be treated as two views. In this paper, we extended broad learning system (BLS), a recently proposed wide neural network architecture, from single-view learning to multi-view learning, and validated its performance in monkey oculomotor decision decoding from medial frontal LFPs and spikes. We demonstrated that medial frontal LFPs and spikes in non-human primate do contain complementary information about the oculomotor decision, and that the proposed multi-view BLS is a more effective approach to classify the oculomotor decision, than several classical and state-of-the-art single-view and multi-view learning approaches. Copyright © 2019, The Authors. All rights reserved.

关键词： Electrophysiology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：