<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 3477 </description>
		<year>2013</year>
		<month>May      </month>
		<day>16</day>
		<item>
			<title><![CDATA[Table of Contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6353147]]></link>
			<description><![CDATA[Presents the cover/table of contents for this issue of the periodical.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6353147]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>C1</startPage>
			<endPage>C1</endPage>
			<fileSize>142</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics&#x2014;Part B: Cybernetics publication information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6353153]]></link>
			<description><![CDATA[Provides a listing of current staff, committee members and society officers.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6353153]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>C2</startPage>
			<endPage>C2</endPage>
			<fileSize>135</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Feature Selection With Harmony Search]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6204102]]></link>
			<description><![CDATA[Many search strategies have been exploited for the task of feature selection (FS), in an effort to identify more compact and better quality subsets. Such work typically involves the use of greedy hill climbing (HC), or nature-inspired heuristics, in order to discover the optimal solution without going through exhaustive search. In this paper, a novel FS approach based on harmony search (HS) is presented. It is a general approach that can be used in conjunction with many subset evaluation techniques. The simplicity of HS is exploited to reduce the overall complexity of the search process. The proposed approach is able to escape from local solutions and identify multiple solutions owing to the stochastic nature of HS. Additional parameter control schemes are introduced to reduce the effort and impact of parameter configuration. These can be further combined with the iterative refinement strategy, tailored to enforce the discovery of quality subsets. The resulting approach is compared with those that rely on HC, genetic algorithms, and particle swarm optimization, accompanied by in-depth studies of the suggested improvements.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6204102]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1509</startPage>
			<endPage>1523</endPage>
			<fileSize>731</fileSize>
			<authors><![CDATA[Ren Diao;Qiang Shen;]]></authors>
		</item>
		<item>
			<title><![CDATA[Reverse Control for Humanoid Robot Task Recognition]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6190761]]></link>
			<description><![CDATA[Efficient methods to perform motion recognition have been developed using statistical tools. Those methods rely on primitive learning in a suitable space, for example, the latent space of the joint angle and/or adequate task spaces. Learned primitives are often sequential: A motion is segmented according to the time axis. When working with a humanoid robot, a motion can be decomposed into parallel subtasks. For example, in a waiter scenario, the robot has to keep some plates horizontal with one of its arms while placing a plate on the table with its free hand. Recognition can thus not be limited to one task per consecutive segment of time. The method presented in this paper takes advantage of the knowledge of what tasks the robot is able to do and how the motion is generated from this set of known controllers, to perform a reverse engineering of an observed motion. This analysis is intended to recognize parallel tasks that have been used to generate a motion. The method relies on the task-function formalism and the projection operation into the null space of a task to decouple the controllers. The approach is successfully applied on a real robot to disambiguate motion in different scenarios where two motions look similar but have different purposes.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6190761]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1524</startPage>
			<endPage>1537</endPage>
			<fileSize>1629</fileSize>
			<authors><![CDATA[Hak, S.;Mansard, N.;Stasse, O.;Laumond, J.P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Approximate Optimal Control Design for Nonlinear One-Dimensional Parabolic PDE Systems Using Empirical Eigenfunctions and Neural Network]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6198365]]></link>
			<description><![CDATA[This paper addresses the approximate optimal control problem for a class of parabolic partial differential equation (PDE) systems with nonlinear spatial differential operators. An approximate optimal control design method is proposed on the basis of the empirical eigenfunctions (EEFs) and neural network (NN). First, based on the data collected from the PDE system, the Karhunen-Loe&#x0300;ve decomposition is used to compute the EEFs. With those EEFs, the PDE system is formulated as a high-order ordinary differential equation (ODE) system. To further reduce its dimension, the singular perturbation (SP) technique is employed to derive a reduced-order model (ROM), which can accurately describe the dominant dynamics of the PDE system. Second, the Hamilton-Jacobi-Bellman (HJB) method is applied to synthesize an optimal controller based on the ROM, where the closed-loop asymptotic stability of the high-order ODE system can be guaranteed by the SP theory. By dividing the optimal control law into two parts, the linear part is obtained by solving an algebraic Riccati equation, and a new type of HJB-like equation is derived for designing the nonlinear part. Third, a control update strategy based on successive approximation is proposed to solve the HJB-like equation, and its convergence is proved. Furthermore, an NN approach is used to approximate the cost function. Finally, we apply the developed approximate optimal control method to a diffusion-reaction process with a nonlinear spatial operator, and the simulation results illustrate its effectiveness.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6198365]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1538</startPage>
			<endPage>1549</endPage>
			<fileSize>436</fileSize>
			<authors><![CDATA[Biao Luo;Huai-Ning Wu;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Effective Feature Selection Method via Mutual Information Estimation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6196239]]></link>
			<description><![CDATA[This paper proposes a new feature selection method using a mutual information-based criterion that measures the importance of a feature in a backward selection framework. It considers the dependency among many features and uses either one of two well-known probability density function estimation methods when computing the criterion. The proposed approach is compared with existing mutual information-based methods and another sophisticated filter method on many artificial and real-world problems. The numerical results show that the proposed method can effectively identify the important features in data sets having dependency among many features and is superior, in almost all cases, to the benchmark methods.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6196239]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1550</startPage>
			<endPage>1559</endPage>
			<fileSize>1317</fileSize>
			<authors><![CDATA[Jian-Bo Yang;Chong-Jin Ong;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multivariate Multilinear Regression]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6209443]]></link>
			<description><![CDATA[Conventional regression methods, such as multivariate linear regression (MLR) and its extension principal component regression (PCR), deal well with the situations that the data are of the form of low-dimensional vector. When the dimension grows higher, it leads to the under sample problem (USP): the dimensionality of the feature space is much higher than the number of training samples. However, little attention has been paid to such a problem. This paper first adopts an in-depth investigation to the USP in PCR, which answers three questions: 1) Why is USP produced? 2) What is the condition for USP, and 3) How is the influence of USP on regression. With the help of the above analysis, the principal components selection problem of PCR is presented. Subsequently, to address the problem of PCR, a multivariate multilinear regression (MMR) model is proposed which gives a substitutive solution to MLR, under the condition of multilinear objects. The basic idea of MMR is to transfer the multilinear structure of objects into the regression coefficients as a constraint. As a result, the regression problem is reduced to find two low-dimensional coefficients so that the principal components selection problem is avoided. Moreover, the sample size needed for solving MMR is greatly reduced so that USP is alleviated. As there is no closed-form solution for MMR, an alternative projection procedure is designed to obtain the regression matrices. For the sake of completeness, the analysis of computational cost and the proof of convergence are studied subsequently. Furthermore, MMR is applied to model the fitting procedure in the active appearance model (AAM). Experiments are conducted on both the carefully designed synthesizing data set and AAM fitting databases verified the theoretical analysis.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6209443]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1560</startPage>
			<endPage>1573</endPage>
			<fileSize>1052</fileSize>
			<authors><![CDATA[Ya Su;Xinbo Gao;Xuelong Li;Dacheng Tao;]]></authors>
		</item>
		<item>
			<title><![CDATA[<formula formulatype="inline"> <img src="/images/tex/518.gif" alt="{cal H}_{\infty }"> </formula> Model Reduction of Takagi&#x2013;Sugeno Fuzzy Stochastic Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6202714]]></link>
			<description><![CDATA[This paper is concerned with the problem of <i>H</i><sub>&#x221E;</sub> model reduction for Takagi-Sugeno (T-S) fuzzy stochastic systems. For a given mean-square stable T-S fuzzy stochastic system, our attention is focused on the construction of a reduced-order model, which not only approximates the original system well with an <i>H</i><sub>&#x221E;</sub> performance but also translates it into a linear lower dimensional system. Then, the model reduction is converted into a convex optimization problem by using a linearization procedure, and a projection approach is also presented, which casts the model reduction into a sequential minimization problem subject to linear matrix inequality constraints by employing the cone complementary linearization algorithm. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed methods.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6202714]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1574</startPage>
			<endPage>1585</endPage>
			<fileSize>297</fileSize>
			<authors><![CDATA[Xiaojie Su;Ligang Wu;Peng Shi;Yong-Duan Song;]]></authors>
		</item>
		<item>
			<title><![CDATA[Joint-Structured-Sparsity-Based Classification for Multiple-Measurement Transient Acoustic Signals]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6200352]]></link>
			<description><![CDATA[This paper investigates the joint-structured-sparsity-based methods for transient acoustic signal classification with multiple measurements. By joint structured sparsity, we not only use the sparsity prior for each measurement but we also exploit the structural information across the sparse representation vectors of multiple measurements. Several different sparse prior models are investigated in this paper to exploit the correlations among the multiple measurements with the notion of the joint structured sparsity for improving the classification accuracy. Specifically, we propose models with the joint structured sparsity under different assumptions: same sparse code model, common sparse pattern model, and a newly proposed joint dynamic sparse model. For the joint dynamic sparse model, we also develop an efficient greedy algorithm to solve it. Extensive experiments are carried out on real acoustic data sets, and the results are compared with the conventional discriminative classifiers in order to verify the effectiveness of the proposed method.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6200352]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1586</startPage>
			<endPage>1598</endPage>
			<fileSize>877</fileSize>
			<authors><![CDATA[Haichao Zhang;Yanning Zhang;Nasrabadi, N.M.;Huang, T.S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Robust Adaptive Control of MEMS Triaxial Gyroscope Using Fuzzy Compensator]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6194348]]></link>
			<description><![CDATA[In this paper, a robust adaptive control strategy using a fuzzy compensator for MEMS triaxial gyroscope, which has system nonlinearities, including model uncertainties and external disturbances, is proposed. A fuzzy logic controller that could compensate for the model uncertainties and external disturbances is incorporated into the adaptive control scheme in the Lyapunov framework. The proposed adaptive fuzzy controller can guarantee the convergence and asymptotical stability of the closed-loop system. The proposed adaptive fuzzy control strategy does not depend on accurate mathematical models, which simplifies the design procedure. The innovative development of intelligent control methods incorporated with conventional control for the MEMS gyroscope is derived with the strict theoretical proof of the Lyapunov stability. Numerical simulations are investigated to verify the effectiveness of the proposed adaptive fuzzy control scheme and demonstrate the satisfactory tracking performance and robustness against model uncertainties and external disturbances compared with conventional adaptive control method.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6194348]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1599</startPage>
			<endPage>1607</endPage>
			<fileSize>1314</fileSize>
			<authors><![CDATA[Juntao Fei;Jian Zhou;]]></authors>
		</item>
		<item>
			<title><![CDATA[Neural-Network-Based Decentralized Adaptive Output-Feedback Control for Large-Scale Stochastic Nonlinear Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6202351]]></link>
			<description><![CDATA[This paper focuses on the problem of neural-network-based decentralized adaptive output-feedback control for a class of nonlinear strict-feedback large-scale stochastic systems. The dynamic surface control technique is used to avoid the explosion of computational complexity in the backstepping design process. A novel direct adaptive neural network approximation method is proposed to approximate the unknown and desired control input signals instead of the unknown nonlinear functions. It is shown that the designed controller can guarantee all the signals in the closed-loop system to be semiglobally uniformly ultimately bounded in a mean square. Simulation results are provided to demonstrate the effectiveness of the developed control design approach.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6202351]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1608</startPage>
			<endPage>1619</endPage>
			<fileSize>264</fileSize>
			<authors><![CDATA[Qi Zhou;Peng Shi;Honghai Liu;Shengyuan Xu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Supervised Latent Linear Gaussian Process Latent Variable Model for Dimensionality Reduction]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6202350]]></link>
			<description><![CDATA[The Gaussian process (GP) latent variable model (GPLVM) has the capability of learning low-dimensional manifold from highly nonlinear data of high dimensionality. As an unsupervised dimensionality reduction (DR) algorithm, the GPLVM has been successfully applied in many areas. However, in its current setting, GPLVM is unable to use label information, which is available for many tasks; therefore, researchers proposed many kinds of extensions to the GPLVM in order to utilize extra information, among which the supervised GPLVM (SGPLVM) has shown better performance compared with other SGPLVM extensions. However, the SGPLVM suffers in its high computational complexity. Bearing in mind the issues of the complexity and the need of incorporating additionally available information, in this paper, we propose a novel SGPLVM, called supervised latent linear GPLVM (SLLGPLVM). Our approach is motivated by both SGPLVM and supervised probabilistic principal component analysis (SPPCA). The proposed SLLGPLVM can be viewed as an appropriate compromise between the SGPLVM and the SPPCA. Furthermore, it is also appropriate to interpret the SLLGPLVM as a semiparametric regression model for supervised DR by making use of the GP to model the unknown smooth link function. Complexity analysis and experiments show that the developed SLLGPLVM outperforms the SGPLVM not only in the computational complexity but also in its accuracy. We also compared the SLLGPLVM with two classical supervised classifiers, i.e., a GP classifier and a support vector machine, to illustrate the advantages of the proposed model.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6202350]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1620</startPage>
			<endPage>1632</endPage>
			<fileSize>1078</fileSize>
			<authors><![CDATA[Xinwei Jiang;Junbin Gao;Tianjiang Wang;Lihong Zheng;]]></authors>
		</item>
		<item>
			<title><![CDATA[Human-Arm-and-Hand-Dynamic Model With Variability Analyses for a Stylus-Based Haptic Interface]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6212384]]></link>
			<description><![CDATA[Haptic interface research benefits from accurate human arm models for control and system design. The literature contains many human arm dynamic models but lacks detailed variability analyses. Without accurate measurements, variability is modeled in a very conservative manner, leading to less than optimal controller and system designs. This paper not only presents models for human arm dynamics but also develops inter- and intrasubject variability models for a stylus-based haptic device. Data from 15 human subjects (nine male, six female, ages 20-32) were collected using a Phantom Premium 1.5a haptic device for system identification. In this paper, grip-force-dependent models were identified for 1-3-N grip forces in the three spatial axes. Also, variability due to human subjects and grip-force variation were modeled as both structured and unstructured uncertainties. For both forms of variability, the maximum variation, 95%, and 67% confidence interval limits were examined. All models were in the frequency domain with force as input and position as output. The identified models enable precise controllers targeted to a subset of possible human operator dynamics.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6212384]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1633</startPage>
			<endPage>1644</endPage>
			<fileSize>1299</fileSize>
			<authors><![CDATA[Fu, M.J.;Cavusoglu, M.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimization of Neural Networks Using Variable Structure Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6205653]]></link>
			<description><![CDATA[This paper proposes a new mixed training algorithm consisting of error backpropagation (EBP) and variable structure systems (VSSs) to optimize parameter updating of neural networks. For the optimization of the number of neurons in the hidden layer, a new term based on the output of the hidden layer is added to the cost function as a penalty term to make optimal use of hidden units related to weights corresponding to each unit in the hidden layer. VSS is used to control the dynamic model of the training process, whereas EBP attempts to minimize the cost function. In addition to the analysis of the imposed dynamics of the EBP technique, the global stability of the mixed training methodology and constraints on the design parameters are considered. The advantages of the proposed technique are guaranteed convergence, improved robustness, and lower sensitivity to initial weights of the neural network.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6205653]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1645</startPage>
			<endPage>1653</endPage>
			<fileSize>296</fileSize>
			<authors><![CDATA[Mohseni, S.A.;Ai Hui Tan;]]></authors>
		</item>
		<item>
			<title><![CDATA[Gait Recognition Across Various Walking Speeds Using Higher Order Shape Configuration Based on a Differential Composition Model]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6205650]]></link>
			<description><![CDATA[Gait has been known as an effective biometric feature to identify a person at a distance. However, variation of walking speeds may lead to significant changes to human walking patterns. It causes many difficulties for gait recognition. A comprehensive analysis has been carried out in this paper to identify such effects. Based on the analysis, Procrustes shape analysis is adopted for gait signature description and relevant similarity measurement. To tackle the challenges raised by speed change, this paper proposes a higher order shape configuration for gait shape description, which deliberately conserves discriminative information in the gait signatures and is still able to tolerate the varying walking speed. Instead of simply measuring the similarity between two gaits by treating them as two unified objects, a differential composition model (DCM) is constructed. The DCM differentiates the different effects caused by walking speed changes on various human body parts. In the meantime, it also balances well the different discriminabilities of each body part on the overall gait similarity measurements. In this model, the Fisher discriminant ratio is adopted to calculate weights for each body part. Comprehensive experiments based on widely adopted gait databases demonstrate that our proposed method is efficient for cross-speed gait recognition and outperforms other state-of-the-art methods.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6205650]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1654</startPage>
			<endPage>1668</endPage>
			<fileSize>1136</fileSize>
			<authors><![CDATA[Kusakunniran, W.;Qiang Wu;Jian Zhang;Hongdong Li;]]></authors>
		</item>
		<item>
			<title><![CDATA[Linearithmic Time Sparse and Convex Maximum Margin Clustering]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6204103]]></link>
			<description><![CDATA[Recently, a new clustering method called maximum margin clustering (MMC) was proposed and has shown promising performances. It was originally formulated as a difficult nonconvex integer problem. To make the MMC problem practical, the researchers either relaxed the original MMC problem to inefficient convex optimization problems or reformulated it to nonconvex optimization problems, which sacrifice the convexity for efficiency. However, no approaches can both hold the convexity and be efficient. In this paper, a new linearithmic time sparse and convex MMC algorithm, called support-vector-regression-based MMC (SVR-MMC), is proposed. Generally, it first uses the SVR as the core of the MMC. Then, it is relaxed as a convex optimization problem, which is iteratively solved by the cutting-plane algorithm. Each cutting-plane subproblem is further decomposed to a serial supervised SVR problem by a new global extended-level method (GELM). Finally, each supervised SVR problem is solved in a linear time complexity by a new sparse-kernel SVR (SKSVR) algorithm. We further extend the SVR-MMC algorithm to the multiple-kernel clustering (MKC) problem and the multiclass MMC (M3C) problem, which are denoted as SVR-MKC and SVR-M3C, respectively. One key point of the algorithms is the utilization of the SVR. It can prevent the MMC and its extensions meeting an integer matrix programming problem. Another key point is the new SKSVR. It provides a linear time interface to the nonlinear kernel scenarios, so that the SVR-MMC and its extensions can keep a linearthmic time complexity in nonlinear kernel scenarios. Our experimental results on various real-world data sets demonstrate the effectiveness and the efficiency of the SVR-MMC and its two extensions. Moreover, the unsupervised application of the SVR-MKC to the voice activity detection (VAD) shows that the SVR-MKC can achieve good performances that are close to its supervised counterpart, meet the real-time demand of the VAD, and need no-
labeling for model training.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6204103]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1669</startPage>
			<endPage>1692</endPage>
			<fileSize>877</fileSize>
			<authors><![CDATA[Xiao-Lei Zhang;Ji Wu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Adjustable Model-Based Fusion Method for Multispectral and Panchromatic Images]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6222015]]></link>
			<description><![CDATA[In this paper, an adjustable model-based image fusion method for multispectral (MS) and panchromatic (PAN) images is developed. The relationships of the desired high spatial resolution (HR) MS images to the observed low-spatial-resolution MS images and HR PAN image are formulated with image observation models. The maximum a posteriori framework is employed to describe the inverse problem of image fusion. By choosing particular probability density functions, the fused HR MS images are solved using a gradient descent algorithm. In particular, two functions are defined to adaptively determine most regularization parameters using the partially fused results at each iteration, retaining one parameter to adjust the tradeoff between the enhancement of spatial information and the maintenance of spectral information. The proposed method has been tested using QuickBird and IKONOS images and compared to several known fusion methods using quantitative evaluation indices. The experimental results verify the efficacy of this method.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6222015]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1693</startPage>
			<endPage>1704</endPage>
			<fileSize>1658</fileSize>
			<authors><![CDATA[Liangpei Zhang;Huanfeng Shen;Wei Gong;Hongyan Zhang;]]></authors>
		</item>
		<item>
			<title><![CDATA[2012 Index IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) Vol. 42]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6373921]]></link>
			<description><![CDATA[This index covers all technical items - papers, correspondence, reviews, etc. - that appeared in this periodical during the year, and items from previous years that were commented upon or corrected in this year. Departments and other items may also be covered if they have been judged to have archival value. The Author Index contains the primary entry for each item, listed under the first author's name. The primary entry includes the co-authors' names, the title of the paper or other item, and its location, specified by the publication abbreviation, year, month, and inclusive pagination. The Subject Index contains entries describing the item under all appropriate subject headings, plus the first author's name, the publication abbreviation, month, and year, and inclusive pages. Note that the item title is found only under the primary entry in the Author Index.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6373921]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1705</startPage>
			<endPage>1723</endPage>
			<fileSize>401</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Systems, Man, and Cybernetics Society Information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6353155]]></link>
			<description><![CDATA[Provides a listing of current committee members and society officers.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6353155]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>C3</startPage>
			<endPage>C3</endPage>
			<fileSize>29</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics&#x2014;Part B: Cybernetics information for authors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6353154]]></link>
			<description><![CDATA[Provides instructions and guidelines to prospective authors who wish to submit manuscripts.]]></description>
			<pubDate><![CDATA[Dec.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6353154]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>C4</startPage>
			<endPage>C4</endPage>
			<fileSize>107</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>