journal
MENU ▼
Read by QxMD icon Read
search

IEEE Transactions on Cybernetics

journal
https://www.readbyqxmd.com/read/28500016/adaptive-graph-matching
#1
Xu Yang, Zhi-Yong Liu
Establishing correspondence between point sets lays the foundation for many computer vision and pattern recognition tasks. It can be well defined and solved by graph matching. However, outliers may significantly deteriorate its performance, especially when outliers exist in both point sets and meanwhile the inlier number is unknown. In this paper, we propose an adaptive graph matching algorithm to tackle this problem. Specifically, a novel formulation is proposed to make the graph matching model adaptively determine the number of inliers and match them, then by relaxing the discrete domain to its convex hull the discrete optimization problem is relaxed to be a continuous one, and finally a graduated projection scheme is used to get a discrete matching solution...
May 9, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28500015/social-synchrony-on-complex-networks
#2
Qi Xuan, Zhi-Yuan Zhang, Chenbo Fu, Hong-Xiang Hu, Vladimir Filkov
Social synchrony (SS) is an emergent phenomenon in human society. People often mimic others which, over time, can result in large groups behaving similarly. Drawing from prior empirical studies of SS in online communities, here we propose a discrete network model of SS based on four attributes: 1) depth of action; 2) breadth of impact, i.e., a large number of actions are performed with a large group of people involved; 3) heterogeneity of role, i.e., people of higher degree play more important roles; and 4) lastly, emergence of phenomenon, i...
May 9, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28475073/video-decolorization-using-visual-proximity-coherence-optimization
#3
Yizhang Tao, Yiyi Shen, Bin Sheng, Ping Li, Rynson W H Lau
Video decolorization is to filter out the color information while preserving the perceivable content in the video as much and correct as possible. Existing methods mainly apply image decolorization strategies on videos, which may be slow and produce incoherent results. In this paper, we propose a video decolorization framework that considers frame coherence and saves decolorization time by referring to the decolorized frames. It has three main contributions. First, we define decolorization proximity to measure the similarity of adjacent frames...
May 2, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28475072/clustering-by-local-gravitation
#4
Zhiqiang Wang, Zhiwen Yu, C L Philip Chen, Jane You, Tianlong Gu, Hau-San Wong, Jun Zhang
The objective of cluster analysis is to partition a set of data points into several groups based on a suitable distance measure. We first propose a model called local gravitation among data points. In this model, each data point is viewed as an object with mass, and associated with a local resultant force (LRF) generated by its neighbors. The motivation of this paper is that there exist distinct differences between the LRFs (including magnitudes and directions) of the data points close to the cluster centers and at the boundary of the clusters...
May 2, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28475071/robust-face-hallucination-via-locality-constrained-bi-layer-representation
#5
Licheng Liu, C L Philip Chen, Shutao Li, Yuan Yan Tang, Long Chen
Recently, locality-constrained linear coding (LLC) has been drawn great attentions and been widely used in image processing and computer vision tasks. However, the conventional LLC model is always fragile to outliers. In this paper, we present a robust locality-constrained bi-layer representation model to simultaneously hallucinate the face images and suppress noise and outliers with the assistant of a group of training samples. The proposed scheme is not only able to capture the nonlinear manifold structure but also robust to outliers by incorporating a weight vector into the objective function to subtly tune the contribution of each pixel offered in the objective...
May 2, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28459699/misaga-an-algorithm-for-mining-interesting-subgraphs-in-attributed-graphs
#6
Tiantian He, Keith C C Chan
An attributed graph contains vertices that are associated with a set of attribute values. Mining clusters or communities, which are interesting subgraphs in the attributed graph is one of the most important tasks of graph analytics. Many problems can be defined as the mining of interesting subgraphs in attributed graphs. Algorithms that discover subgraphs based on predefined topologies cannot be used to tackle these problems. To discover interesting subgraphs in the attributed graph, we propose an algorithm called mining interesting subgraphs in attributed graph algorithm (MISAGA)...
April 25, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28459698/fuzzy-adaptive-output-feedback-control-of-uncertain-nonlinear-systems-with-prescribed-performance
#7
Jin-Xi Zhang, Guang-Hong Yang
This paper investigates the tracking control problem for a family of strict-feedback systems in the presence of unknown nonlinearities and immeasurable system states. A low-complexity adaptive fuzzy output feedback control scheme is proposed, based on a backstepping method. In the control design, a fuzzy adaptive state observer is first employed to estimate the unmeasured states. Then, a novel error transformation approach together with a new modification mechanism is introduced to guarantee the finite-time convergence of the output error to a predefined region and ensure the closed-loop stability...
April 24, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28436917/fault-estimation-observer-design-for-discrete-time-takagi-sugeno-fuzzy-systems-based-on-homogenous-polynomially-parameter-dependent-lyapunov-functions
#8
Xiangpeng Xie, Dong Yue, Huaguang Zhang, Yusheng Xue
This paper investigates the problem of robust fault estimation (FE) observer design for discrete-time Takagi-Sugeno fuzzy systems via homogenous polynomially parameter-dependent Lyapunov functions. First, a novel framework of the fuzzy FE observer is established with the help of a maximum-minimum-priority-based switching mechanism. Then, for every activated switching case, a targeted result is achieved by the aid of exploring an important property of improved homogenous polynomials. Since the helpful information of the underlying system can be duly updated and effectively utilized at every sampled point, the conservatism of previous results is availably reduced...
April 24, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28436916/a-new-differential-evolution-algorithm-for-minimax-optimization-in-robust-design
#9
Xin Qiu, Jian-Xin Xu, Yinghao Xu, Kay Chen Tan
Minimax optimization, which is actively involved in numerous robust design problems, aims at pursuing the solutions with best worst-case performances. Although considerable research has been devoted to the development of minimax optimization algorithms, there still exist several fundamental limitations for existing approaches, e.g., restriction on problem types, excessively high computational cost, and low optimization efficiency. To address these issues, a minimax differential evolution algorithm is proposed in this paper...
April 24, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28436912/distributed-position-based-consensus-of-second-order-multiagent-systems-with-continuous-intermittent-communication
#10
Qiang Song, Fang Liu, Guanghui Wen, Jinde Cao, Xinsong Yang
This paper considers the position-based consensus in a network of agents with double-integrator dynamics and directed topology. Two types of distributed observer algorithms are proposed to solve the consensus problem by utilizing continuous and intermittent position measurements, respectively, where each observer does not interact with any other observers. For the case of continuous communication between network agents, some convergence conditions are derived for reaching consensus in the network with a single constant delay or multiple time-varying delays on the basis of the eigenvalue analysis and the descriptor method...
April 24, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28436910/discovering-the-relationship-between-generalization-and-uncertainty-by-incorporating-complexity-of-classification
#11
Xi-Zhao Wang, Ran Wang, Chen Xu
The generalization ability of a classifier learned from a training set is usually dependent on the classifier's uncertainty, which is often described by the fuzziness of the classifier's outputs on the training set. Since the exact dependency relation between generalization and uncertainty of a classifier is quite complicated, it is difficult to clearly or explicitly express this relation in general. This paper shows a specific study on this relation from the viewpoint of complexity of classification by choosing extreme learning machines as the classification algorithms...
April 24, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28436914/a-time-variant-log-linear-learning-approach-to-the-set-k-cover-problem-in-wireless-sensor-networks
#12
Changhao Sun
Toward the global optimality of the SET K-COVER problem in wireless sensor networks, we view each sensor node as a rational player and propose a time variant log-linear learning algorithm (TVLLA) that relies on local information only. By defining the local utility as the normalized area covered by one node alone, we formulate the problem as a spatial potential game. The resulting optimal Nash equilibria correspond to the optimal partition. Such equilibria are obtained by designing a time varying parameter β that approaches infinity with time...
April 19, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28436915/an-adaptive-multiobjective-particle-swarm-optimization-based-on-multiple-adaptive-methods
#13
Honggui Han, Wei Lu, Junfei Qiao
Multiobjective particle swarm optimization (MOPSO) algorithms have attracted much attention for their promising performance in solving multiobjective optimization problems (MOPs). In this paper, an adaptive MOPSO (AMOPSO) algorithm, based on a hybrid framework of the solution distribution entropy and population spacing (SP) information, is developed to improve the search performance in terms of convergent speed and precision. First, an adaptive global best (gBest) selection mechanism, based on the solution distribution entropy, is introduced to analyze the evolutionary tendency and balance the diversity and convergence of nondominated solutions in the archive...
April 17, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28436913/synchronization-of-reaction-diffusion-neural-networks-with-dirichlet-boundary-conditions-and-infinite-delays
#14
Yin Sheng, Hao Zhang, Zhigang Zeng
This paper is concerned with synchronization for a class of reaction-diffusion neural networks with Dirichlet boundary conditions and infinite discrete time-varying delays. By utilizing theories of partial differential equations, Green's formula, inequality techniques, and the concept of comparison, algebraic criteria are presented to guarantee master-slave synchronization of the underlying reaction-diffusion neural networks via a designed controller. Additionally, sufficient conditions on exponential synchronization of reaction-diffusion neural networks with finite time-varying delays are established...
April 17, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28436911/sampled-data-fuzzy-control-for-nonlinear-coupled-parabolic-pde-ode-systems
#15
Zi-Peng Wang, Huai-Ning Wu, Han-Xiong Li
In this paper, a sampled-data fuzzy control problem is addressed for a class of nonlinear coupled systems, which are described by a parabolic partial differential equation (PDE) and an ordinary differential equation (ODE). Initially, the nonlinear coupled system is accurately represented by the Takagi-Sugeno (T-S) fuzzy coupled parabolic PDE-ODE model. Then, based on the T-S fuzzy model, a novel time-dependent Lyapunov functional is used to design a sampled-data fuzzy controller such that the closed-loop coupled system is exponentially stable, where the sampled-data fuzzy controller consists of the ODE state feedback and the PDE static output feedback under spatially averaged measurements...
April 17, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28422679/a-bio-inspired-approach-to-traffic-network-equilibrium-assignment-problem
#16
Xiaoge Zhang, Sankaran Mahadevan
Finding an equilibrium state of the traffic assignment plays a significant role in the design of transportation networks. We adapt the path finding mathematical model of slime mold Physarum polycephalum to solve the traffic equilibrium assignment problem. We make three contributions in this paper. First, we propose a generalized Physarum model to solve the shortest path problem in directed and asymmetric graphs. Second, we extend it further to resolve the network design problem with multiple source nodes and sink nodes...
April 14, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28422676/supervised-and-unsupervised-aspect-category-detection-for-sentiment-analysis-with-co-occurrence-data
#17
Kim Schouten, Onne van der Weijde, Flavius Frasincar, Rommert Dekker
Using online consumer reviews as electronic word of mouth to assist purchase-decision making has become increasingly popular. The Web provides an extensive source of consumer reviews, but one can hardly read all reviews to obtain a fair evaluation of a product or service. A text processing framework that can summarize reviews, would therefore be desirable. A subtask to be performed by such a framework would be to find the general aspect categories addressed in review sentences, for which this paper presents two methods...
April 14, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28422674/incorporation-of-efficient-second-order-solvers-into-latent-factor-models-for-accurate-prediction-of-missing-qos-data
#18
Xin Luo, MengChu Zhou, Shuai Li, YunNi Xia, Zhu-Hong You, QingSheng Zhu, Hareton Leung
Generating highly accurate predictions for missing quality-of-service (QoS) data is an important issue. Latent factor (LF)-based QoS-predictors have proven to be effective in dealing with it. However, they are based on first-order solvers that cannot well address their target problem that is inherently bilinear and nonconvex, thereby leaving a significant opportunity for accuracy improvement. This paper proposes to incorporate an efficient second-order solver into them to raise their accuracy. To do so, we adopt the principle of Hessian-free optimization and successfully avoid the direct manipulation of a Hessian matrix, by employing the efficiently obtainable product between its Gauss-Newton approximation and an arbitrary vector...
April 14, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28422673/a-two-phase-evolutionary-approach-for-compressive-sensing-reconstruction
#19
Yu Zhou, Sam Kwong, Hainan Guo, Xiao Zhang, Qingfu Zhang
Sparse signal reconstruction can be regarded as a problem of locating the nonzero entries of the signal. In presence of measurement noise, conventional methods such as l₁ norm relaxation methods and greedy algorithms, have shown their weakness in finding the nonzero entries accurately. In order to reduce the impact of noise and better locate the nonzero entries, in this paper, we propose a two-phase algorithm which works in a coarse-to-fine manner. In phase 1, a decomposition-based multiobjective evolutionary algorithm is applied to generate a group of robust solutions by optimizing l₁ norm of the solutions...
April 14, 2017: IEEE Transactions on Cybernetics
https://www.readbyqxmd.com/read/28422678/correlation-filter-learning-toward-peak-strength-for-visual-tracking
#20
Yao Sui, Guanghui Wang, Li Zhang
This paper presents a novel visual tracking approach to correlation filter learning toward peak strength of correlation response. Previous methods leverage all features of the target and the immediate background to learn a correlation filter. Some features, however, may be distractive to tracking, like those from occlusion and local deformation, resulting in unstable tracking performance. This paper aims at solving this issue and proposes a novel algorithm to learn the correlation filter. The proposed approach, by imposing an elastic net constraint on the filter, can adaptively eliminate those distractive features in the correlation filtering...
April 13, 2017: IEEE Transactions on Cybernetics
journal
journal
47672
1
2
Fetch more papers »
Fetching more papers... Fetching...
Read by QxMD. Sign in or create an account to discover new knowledge that matter to you.
Remove bar
Read by QxMD icon Read
×

Search Tips

Use Boolean operators: AND/OR

diabetic AND foot
diabetes OR diabetic

Exclude a word using the 'minus' sign

Virchow -triad

Use Parentheses

water AND (cup OR glass)

Add an asterisk (*) at end of a word to include word stems

Neuro* will search for Neurology, Neuroscientist, Neurological, and so on

Use quotes to search for an exact phrase

"primary prevention of cancer"
(heart or cardiac or cardio*) AND arrest -"American Heart Association"