# IEEE Transactions on Cybernetics

## Volume 47 Issue 6 • June 2017

Full text access may be available.

The purchase and pricing options for this item are unavailable. Select items are only available as part of a subscription package. You may try again later or contact us for more information.

## Filter Results

Displaying Results 1 - 25 of 25

Publication Year: 2017, Page(s):C1 - 1353
| PDF (168 KB)
• ### IEEE Transactions on Cybernetics

Publication Year: 2017, Page(s): C2
| PDF (91 KB)
• ### Correntropy Matching Pursuit With Application to Robust Digit and Face Recognition

Publication Year: 2017, Page(s):1354 - 1366
Cited by:  Papers (2)
| | PDF (1872 KB) | HTML

As an efficient sparse representation algorithm, orthogonal matching pursuit (OMP) has attracted massive attention in recent years. However, OMP and most of its variants estimate the sparse vector using the mean square error criterion, which depends on the Gaussianity assumption of the error distribution. A violation of this assumption, e.g., non-Gaussian noise, may lead to performance degradation... View full abstract»

• ### FMRQ—A Multiagent Reinforcement Learning Algorithm for Fully Cooperative Tasks

Publication Year: 2017, Page(s):1367 - 1379
Cited by:  Papers (3)
| | PDF (1809 KB) | HTML

In this paper, we propose a multiagent reinforcement learning algorithm dealing with fully cooperative tasks. The algorithm is called frequency of the maximum reward Q-learning (FMRQ). FMRQ aims to achieve one of the optimal Nash equilibria so as to optimize the performance index in multiagent systems. The frequency of obtaining the highest global immediate reward instead of immediate reward is us... View full abstract»

• ### A Recommendation System to Facilitate Business Process Modeling

Publication Year: 2017, Page(s):1380 - 1394
Cited by:  Papers (1)
| | PDF (2379 KB) | HTML

This paper presents a system that utilizes process recommendation technology to help design new business processes from scratch in an efficient and accurate way. The proposed system consists of two phases: 1) offline mining and 2) online recommendation. At the first phase, it mines relations among activity nodes from existing processes in repository, and then stores the extracted relations as patt... View full abstract»

• ### A Grassmannian Approach to Address View Change Problem in Gait Recognition

Publication Year: 2017, Page(s):1395 - 1408
Cited by:  Papers (1)
| | PDF (1725 KB) | HTML

Gait recognition appears to be a valuable asset when conventional biometrics cannot be employed. Nonetheless, recognizing human by gait is not a trivial task due to the complex human kinematic structure and other external factors affecting human locomotion. A major challenge in gait recognition is view variation. A large difference between the views in the query and reference sets often leads to p... View full abstract»

• ### Construction of Barrier in a Fishing Game With Point Capture

Publication Year: 2017, Page(s):1409 - 1422
Cited by:  Papers (2)
| | PDF (1349 KB) | HTML

This paper addresses a particular pursuit-evasion game, called as “fishing game” where a faster evader attempts to pass the gap between two pursuers. We are concerned with the conditions under which the evader or pursuers can win the game. This is a game of kind in which an essential aspect, barrier, separates the state space into disjoint parts associated with each player's winning ... View full abstract»

• ### Nonsmooth Penalized Clustering via $ell _{p}$ Regularized Sparse Regression

Publication Year: 2017, Page(s):1423 - 1433
Cited by:  Papers (1)
| | PDF (1917 KB) | HTML Media

Clustering has been widely used in data analysis. A majority of existing clustering approaches assume that the number of clusters is given in advance. Recently, a novel clustering framework is proposed which can automatically learn the number of clusters from training data. Based on these works, we propose a nonsmooth penalized clustering model via ℓp (0 <; p <; 1) regulari... View full abstract»

• ### Discriminant Kernel Assignment for Image Coding

Publication Year: 2017, Page(s):1434 - 1445
Cited by:  Papers (1)
| | PDF (1277 KB) | HTML

This paper proposes discriminant kernel assignment (DKA) in the bag-of-features framework for image representation. DKA slightly modifies existing kernel assignment to learn width-variant Gaussian kernel functions to perform discriminant local feature assignment. When directly applying gradient-descent method to solve DKA, the optimization may contain multiple time-consuming reassignment implement... View full abstract»

• ### Many-Objective Particle Swarm Optimization Using Two-Stage Strategy and Parallel Cell Coordinate System

Publication Year: 2017, Page(s):1446 - 1459
Cited by:  Papers (1)
| | PDF (2275 KB) | HTML

It is a daunting challenge to balance the convergence and diversity of an approximate Pareto front in a many-objective optimization evolutionary algorithm. A novel algorithm, named many-objective particle swarm optimization with the two-stage strategy and parallel cell coordinate system (PCCS), is proposed in this paper to improve the comprehensive performance in terms of the convergence and diver... View full abstract»

• ### Data-Driven Tracking Control With Adaptive Dynamic Programming for a Class of Continuous-Time Nonlinear Systems

Publication Year: 2017, Page(s):1460 - 1470
Cited by:  Papers (13)
| | PDF (1243 KB) | HTML

A data-driven adaptive tracking control approach is proposed for a class of continuous-time nonlinear systems using a recent developed goal representation heuristic dynamic programming (GrHDP) architecture. The major focus of this paper is on designing a multivariable tracking scheme, including the filter-based action network (FAN) architecture, and the stability analysis in continuous-time fashio... View full abstract»

• ### A New Perspective to Graphical Characterization of Multiagent Controllability

Publication Year: 2017, Page(s):1471 - 1483
Cited by:  Papers (8)
| | PDF (1306 KB) | HTML

Recently, graphical characterization of multiagent controllability has been studied extensively. A major effort in the study is to determine controllability directly from topology structures of communication graphs. In this paper, we proposed the concept of controllability destructive nodes, which indicates that the difficulty in graphical characterization turns out to be the identification of top... View full abstract»

• ### Cooperative Control of Heterogeneous Uncertain Dynamical Networks: An Adaptive Explicit Synchronization Framework

Publication Year: 2017, Page(s):1484 - 1495
Cited by:  Papers (3)
| | PDF (1163 KB) | HTML

This paper proposes an adaptive explicit synchronization framework to address the cooperative control for heterogeneous uncertain dynamical networks under switching communication topologies. The main contribution is to develop an adaptive explicit synchronization algorithm, in which the synchronization state can be completely tracked by each agent in real time rather than only be measured after th... View full abstract»

• ### A Micro-GA Embedded PSO Feature Selection Approach to Intelligent Facial Emotion Recognition

Publication Year: 2017, Page(s):1496 - 1509
Cited by:  Papers (7)
| | PDF (1816 KB) | HTML

This paper proposes a facial expression recognition system using evolutionary particle swarm optimization (PSO)-based feature optimization. The system first employs modified local binary patterns, which conduct horizontal and vertical neighborhood pixel comparison, to generate a discriminative initial facial representation. Then, a PSO variant embedded with the concept of a micro genetic algorithm... View full abstract»

• ### Diversity Assessment in Many-Objective Optimization

Publication Year: 2017, Page(s):1510 - 1522
Cited by:  Papers (7)
| | PDF (2080 KB) | HTML

Maintaining diversity is one important aim of multiobjective optimization. However, diversity for manyobjective optimization problems is less straightforward to define than for multiobjective optimization problems. Inspired by measures for biodiversity, we propose a new diversity metric for many-objective optimization, which is an accumulation of the dissimilarity in the population, where an Lp-no... View full abstract»

• ### Sampled-Data-Based Consensus and $L_{2}$ -Gain Analysis for Heterogeneous Multiagent Systems

Publication Year: 2017, Page(s):1523 - 1531
Cited by:  Papers (5)
| | PDF (609 KB) | HTML

This paper is concerned with the sampled-data-based consensus problem of heterogeneous multiagent systems under directed graph topology with communication failure. The heterogeneous multiagent system consists of first-order and second-order integrators. Consensus of the heterogeneous multiagent system may not be guaranteed if the communication failure always happens. However, if the frequency and ... View full abstract»

• ### Adaptive Leader-Following Consensus for Second-Order Time-Varying Nonlinear Multiagent Systems

Publication Year: 2017, Page(s):1532 - 1539
Cited by:  Papers (2)
| | PDF (577 KB) | HTML

The leader-following consensus problem is investigated for second-order time-varying nonlinear multiagent systems with unmodeled dynamics and unknown parameters over directed communication topology. Under the assumption that the unknown nonlinearities satisfy Lipschitz conditions with time-varying gains, a local adaptive law is introduced for the design of consensus protocol that enable all follow... View full abstract»

• ### Maximum Margin of Twin Spheres Support Vector Machine for Imbalanced Data Classification

Publication Year: 2017, Page(s):1540 - 1550
Cited by:  Papers (1)
| | PDF (1055 KB) | HTML

Twin support vector machine (TSVM) finds two nonparallel planes by solving a pair of smaller-sized quadratic programming problems (QPPs) rather than a single large one as in the conventional support vector machine (SVM); this makes the learning speed of TSVM approximately four times faster than that of the standard SVM. One major limitation of TSVM is that it involves an expensive matrix inverse o... View full abstract»

• ### Geospatial Modeling Using Dempster–Shafer Theory

Publication Year: 2017, Page(s):1551 - 1561
Cited by:  Papers (2)
| | PDF (903 KB) | HTML

Uncertainty in spatial geometrical issues is represented using Dempster-Shafer (D-S) theory. Interval approaches are used for D-S uncertainty of spatial locations and the associated arithmetic operations on such intervals described. Categories of uncertainty for points and lines are defined using interval formulations. Based on these, approaches for calculation of geometric areas, line length and ... View full abstract»

• ### Submodular Memetic Approximation for Multiobjective Parallel Test Paper Generation

Publication Year: 2017, Page(s):1562 - 1575
| | PDF (1413 KB) | HTML

Parallel test paper generation is a biobjective distributed resource optimization problem, which aims to generate multiple similarly optimal test papers automatically according to multiple user-specified assessment criteria. Generating high-quality parallel test papers is challenging due to its NP-hardness in both of the collective objective functions. In this paper, we propose a submodular memeti... View full abstract»

• ### Ultrasound Standard Plane Detection Using a Composite Neural Network Framework

Publication Year: 2017, Page(s):1576 - 1586
Cited by:  Papers (1)
| | PDF (5124 KB) | HTML

Ultrasound (US) imaging is a widely used screening tool for obstetric examination and diagnosis. Accurate acquisition of fetal standard planes with key anatomical structures is very crucial for substantial biometric measurement and diagnosis. However, the standard plane acquisition is a labor-intensive task and requires operator equipped with a thorough knowledge of fetal anatomy. Therefore, autom... View full abstract»

• ### Introducing IEEE Collabratec

Publication Year: 2017, Page(s): 1587
| PDF (2186 KB)
• ### Member Get-A-Member (MGM) Program

Publication Year: 2017, Page(s): 1588
| PDF (3489 KB)
• ### IEEE Transactions on Cybernetics

Publication Year: 2017, Page(s): C3
| PDF (206 KB)
• ### IEEE Transactions on Cybernetics

Publication Year: 2017, Page(s): C4
| PDF (91 KB)

## Aims & Scope

The scope of the IEEE Transactions on Cybernetics includes computational approaches to the field of cybernetics.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Prof. Jun Wang
Dept. of Computer Science
City University of Hong Kong
Kowloon Tong, Kowloon, Hong Kong
Tel: +852 34429701
Email: jwang.cs@cityu.edu.hk