首页 > 最新文献

IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics最新文献

英文 中文
Dynamic Features for Iris Recognition. 虹膜识别的动态特征。
Pub Date : 2012-08-01 Epub Date: 2012-02-29 DOI: 10.1109/TSMCB.2012.2186125
R M da Costa, A Gonzaga

The human eye is sensitive to visible light. Increasing illumination on the eye causes the pupil of the eye to contract, while decreasing illumination causes the pupil to dilate. Visible light causes specular reflections inside the iris ring. On the other hand, the human retina is less sensitive to near infra-red (NIR) radiation in the wavelength range from 800 nm to 1400 nm, but iris detail can still be imaged with NIR illumination. In order to measure the dynamic movement of the human pupil and iris while keeping the light-induced reflexes from affecting the quality of the digitalized image, this paper describes a device based on the consensual reflex. This biological phenomenon contracts and dilates the two pupils synchronously when illuminating one of the eyes by visible light. In this paper, we propose to capture images of the pupil of one eye using NIR illumination while illuminating the other eye using a visible-light pulse. This new approach extracts iris features called "dynamic features (DFs)." This innovative methodology proposes the extraction of information about the way the human eye reacts to light, and to use such information for biometric recognition purposes. The results demonstrate that these features are discriminating features, and, even using the Euclidean distance measure, an average accuracy of recognition of 99.1% was obtained. The proposed methodology has the potential to be "fraud-proof," because these DFs can only be extracted from living irises.

人眼对可见光很敏感。眼睛上的光照增加会使瞳孔收缩,而光照减少则会使瞳孔扩大。可见光在虹膜环内引起镜面反射。另一方面,人类视网膜对800 nm至1400 nm波长范围内的近红外(NIR)辐射不太敏感,但在近红外照明下仍然可以成像虹膜细节。为了测量人体瞳孔和虹膜的动态运动,同时避免光致反射对数字图像质量的影响,本文设计了一种基于共识反射的装置。当一只眼睛被可见光照射时,这一生物现象会使两只瞳孔同步收缩和扩张。在本文中,我们建议使用近红外照明捕获一只眼睛的瞳孔图像,同时使用可见光脉冲照射另一只眼睛。这种新方法提取虹膜特征称为“动态特征(DFs)”。这种创新的方法提出了提取有关人眼对光的反应方式的信息,并将这些信息用于生物识别目的。结果表明,这些特征是判别特征,即使使用欧几里得距离度量,也能获得99.1%的平均识别准确率。所提出的方法具有“防欺诈”的潜力,因为这些df只能从活的虹膜中提取。
{"title":"Dynamic Features for Iris Recognition.","authors":"R M da Costa,&nbsp;A Gonzaga","doi":"10.1109/TSMCB.2012.2186125","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2186125","url":null,"abstract":"<p><p>The human eye is sensitive to visible light. Increasing illumination on the eye causes the pupil of the eye to contract, while decreasing illumination causes the pupil to dilate. Visible light causes specular reflections inside the iris ring. On the other hand, the human retina is less sensitive to near infra-red (NIR) radiation in the wavelength range from 800 nm to 1400 nm, but iris detail can still be imaged with NIR illumination. In order to measure the dynamic movement of the human pupil and iris while keeping the light-induced reflexes from affecting the quality of the digitalized image, this paper describes a device based on the consensual reflex. This biological phenomenon contracts and dilates the two pupils synchronously when illuminating one of the eyes by visible light. In this paper, we propose to capture images of the pupil of one eye using NIR illumination while illuminating the other eye using a visible-light pulse. This new approach extracts iris features called \"dynamic features (DFs).\" This innovative methodology proposes the extraction of information about the way the human eye reacts to light, and to use such information for biometric recognition purposes. The results demonstrate that these features are discriminating features, and, even using the Euclidean distance measure, an average accuracy of recognition of 99.1% was obtained. The proposed methodology has the potential to be \"fraud-proof,\" because these DFs can only be extracted from living irises. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1072-82"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2186125","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30505061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 65
In the Pursuit of Effective Affective Computing: The Relationship Between Features and Registration. 追求有效的情感计算:特征与配准之间的关系。
Pub Date : 2012-08-01 Epub Date: 2012-05-07 DOI: 10.1109/TSMCB.2012.2194485
S W Chew, P Lucey, S Lucey, J Saragih, J F Cohn, I Matthews, S Sridharan

For facial expression recognition systems to be applicable in the real world, they need to be able to detect and track a previously unseen person's face and its facial movements accurately in realistic environments. A highly plausible solution involves performing a "dense" form of alignment, where 60-70 fiducial facial points are tracked with high accuracy. The problem is that, in practice, this type of dense alignment had so far been impossible to achieve in a generic sense, mainly due to poor reliability and robustness. Instead, many expression detection methods have opted for a "coarse" form of face alignment, followed by an application of a biologically inspired appearance descriptor such as the histogram of oriented gradients or Gabor magnitudes. Encouragingly, recent advances to a number of dense alignment algorithms have demonstrated both high reliability and accuracy for unseen subjects [e.g., constrained local models (CLMs)]. This begs the question: Aside from countering against illumination variation, what do these appearance descriptors do that standard pixel representations do not? In this paper, we show that, when close to perfect alignment is obtained, there is no real benefit in employing these different appearance-based representations (under consistent illumination conditions). In fact, when misalignment does occur, we show that these appearance descriptors do work well by encoding robustness to alignment error. For this work, we compared two popular methods for dense alignment-subject-dependent active appearance models versus subject-independent CLMs-on the task of action-unit detection. These comparisons were conducted through a battery of experiments across various publicly available data sets (i.e., CK+, Pain, M3, and GEMEP-FERA). We also report our performance in the recent 2011 Facial Expression Recognition and Analysis Challenge for the subject-independent task.

面部表情识别系统要应用于现实世界,就需要能够在现实环境中准确地检测和跟踪以前未见过的人的面部及其面部运动。一个非常合理的解决方案涉及执行“密集”形式的对齐,其中60-70个基准面部点被高精度地跟踪。问题是,在实践中,这种类型的密集对齐到目前为止在一般意义上是不可能实现的,主要是由于可靠性和健壮性差。相反,许多表情检测方法选择了一种“粗糙”的面部排列形式,然后应用生物学启发的外观描述符,如定向梯度直方图或Gabor幅度。令人鼓舞的是,最近许多密集对齐算法的进展表明,对于看不见的对象(例如,约束局部模型(CLMs)),它们具有高可靠性和准确性。这就引出了一个问题:除了对抗光照变化之外,这些外观描述符做了什么标准像素表示没有做的事情?在本文中,我们表明,当获得接近完美的对齐时,使用这些不同的基于外观的表示(在一致的照明条件下)并没有真正的好处。事实上,当不对齐确实发生时,我们通过编码对对齐错误的鲁棒性来证明这些外观描述符确实工作得很好。在这项工作中,我们比较了两种流行的密集对齐方法——主体依赖的活跃外观模型和主体独立的clms——在动作单元检测任务上的差异。这些比较是通过在各种公开可用的数据集(即CK+、Pain、M3和GEMEP-FERA)上进行的一系列实验进行的。我们还报告了我们在最近的2011面部表情识别和分析挑战中独立于主题任务的表现。
{"title":"In the Pursuit of Effective Affective Computing: The Relationship Between Features and Registration.","authors":"S W Chew,&nbsp;P Lucey,&nbsp;S Lucey,&nbsp;J Saragih,&nbsp;J F Cohn,&nbsp;I Matthews,&nbsp;S Sridharan","doi":"10.1109/TSMCB.2012.2194485","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2194485","url":null,"abstract":"<p><p>For facial expression recognition systems to be applicable in the real world, they need to be able to detect and track a previously unseen person's face and its facial movements accurately in realistic environments. A highly plausible solution involves performing a \"dense\" form of alignment, where 60-70 fiducial facial points are tracked with high accuracy. The problem is that, in practice, this type of dense alignment had so far been impossible to achieve in a generic sense, mainly due to poor reliability and robustness. Instead, many expression detection methods have opted for a \"coarse\" form of face alignment, followed by an application of a biologically inspired appearance descriptor such as the histogram of oriented gradients or Gabor magnitudes. Encouragingly, recent advances to a number of dense alignment algorithms have demonstrated both high reliability and accuracy for unseen subjects [e.g., constrained local models (CLMs)]. This begs the question: Aside from countering against illumination variation, what do these appearance descriptors do that standard pixel representations do not? In this paper, we show that, when close to perfect alignment is obtained, there is no real benefit in employing these different appearance-based representations (under consistent illumination conditions). In fact, when misalignment does occur, we show that these appearance descriptors do work well by encoding robustness to alignment error. For this work, we compared two popular methods for dense alignment-subject-dependent active appearance models versus subject-independent CLMs-on the task of action-unit detection. These comparisons were conducted through a battery of experiments across various publicly available data sets (i.e., CK+, Pain, M3, and GEMEP-FERA). We also report our performance in the recent 2011 Facial Expression Recognition and Analysis Challenge for the subject-independent task. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1006-16"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2194485","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30613393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 67
Multiclass Imbalance Problems: Analysis and Potential Solutions. 多类失衡问题:分析与可能的解决方案。
Pub Date : 2012-08-01 Epub Date: 2012-03-16 DOI: 10.1109/TSMCB.2012.2187280
Shuo Wang, Xin Yao

Class imbalance problems have drawn growing interest recently because of their classification difficulty caused by the imbalanced class distributions. In particular, many ensemble methods have been proposed to deal with such imbalance. However, most efforts so far are only focused on two-class imbalance problems. There are unsolved issues in multiclass imbalance problems, which exist in real-world applications. This paper studies the challenges posed by the multiclass imbalance problems and investigates the generalization ability of some ensemble solutions, including our recently proposed algorithm AdaBoost.NC, with the aim of handling multiclass and imbalance effectively and directly. We first study the impact of multiminority and multimajority on the performance of two basic resampling techniques. They both present strong negative effects. "Multimajority" tends to be more harmful to the generalization performance. Motivated by the results, we then apply AdaBoost.NC to several real-world multiclass imbalance tasks and compare it to other popular ensemble methods. AdaBoost.NC is shown to be better at recognizing minority class examples and balancing the performance among classes in terms of G-mean without using any class decomposition.

由于班级分布不平衡导致班级分类困难,班级不平衡问题近年来引起了人们越来越多的关注。特别是,许多集成方法被提出来处理这种不平衡。然而,到目前为止,大多数努力只集中在两级失衡问题上。在实际应用中存在的多类不平衡问题中,有一些尚未解决的问题。本文研究了多类不平衡问题带来的挑战,并研究了一些集成解的泛化能力,包括我们最近提出的算法AdaBoost。数控,目的是有效、直接地处理多类和不平衡。我们首先研究了多少数和多多数对两种基本重采样技术性能的影响。它们都呈现出强烈的负面影响。“多多数”倾向于对泛化性能更有害。受到结果的激励,我们然后应用AdaBoost。NC应用于几个现实世界的多类不平衡任务,并将其与其他流行的集成方法进行比较。演算法。NC在识别少数类示例方面表现得更好,并且在不使用任何类分解的情况下,根据g均值平衡类之间的性能。
{"title":"Multiclass Imbalance Problems: Analysis and Potential Solutions.","authors":"Shuo Wang,&nbsp;Xin Yao","doi":"10.1109/TSMCB.2012.2187280","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2187280","url":null,"abstract":"<p><p>Class imbalance problems have drawn growing interest recently because of their classification difficulty caused by the imbalanced class distributions. In particular, many ensemble methods have been proposed to deal with such imbalance. However, most efforts so far are only focused on two-class imbalance problems. There are unsolved issues in multiclass imbalance problems, which exist in real-world applications. This paper studies the challenges posed by the multiclass imbalance problems and investigates the generalization ability of some ensemble solutions, including our recently proposed algorithm AdaBoost.NC, with the aim of handling multiclass and imbalance effectively and directly. We first study the impact of multiminority and multimajority on the performance of two basic resampling techniques. They both present strong negative effects. \"Multimajority\" tends to be more harmful to the generalization performance. Motivated by the results, we then apply AdaBoost.NC to several real-world multiclass imbalance tasks and compare it to other popular ensemble methods. AdaBoost.NC is shown to be better at recognizing minority class examples and balancing the performance among classes in terms of G-mean without using any class decomposition. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1119-30"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2187280","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30519103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 440
A Comparison Study of Validity Indices on Swarm-Intelligence-Based Clustering. 基于群体智能聚类的有效性指标比较研究。
Pub Date : 2012-08-01 Epub Date: 2012-03-15 DOI: 10.1109/TSMCB.2012.2188509
Rui Xu, Jie Xu, D C Wunsch

Swarm intelligence has emerged as a worthwhile class of clustering methods due to its convenient implementation, parallel capability, ability to avoid local minima, and other advantages. In such applications, clustering validity indices usually operate as fitness functions to evaluate the qualities of the obtained clusters. However, as the validity indices are usually data dependent and are designed to address certain types of data, the selection of different indices as the fitness functions may critically affect cluster quality. Here, we compare the performances of eight well-known and widely used clustering validity indices, namely, the Caliński-Harabasz index, the CS index, the Davies-Bouldin index, the Dunn index with two of its generalized versions, the I index, and the silhouette statistic index, on both synthetic and real data sets in the framework of differential-evolution-particle-swarm-optimization (DEPSO)-based clustering. DEPSO is a hybrid evolutionary algorithm of the stochastic optimization approach (differential evolution) and the swarm intelligence method (particle swarm optimization) that further increases the search capability and achieves higher flexibility in exploring the problem space. According to the experimental results, we find that the silhouette statistic index stands out in most of the data sets that we examined. Meanwhile, we suggest that users reach their conclusions not just based on only one index, but after considering the results of several indices to achieve reliable clustering structures.

群体智能由于其实现方便、并行能力、避免局部极小值等优点而成为一类有价值的聚类方法。在这类应用中,聚类有效性指标通常作为适应度函数来评价得到的聚类的质量。然而,由于有效性指标通常依赖于数据,并且设计用于处理特定类型的数据,因此选择不同的指标作为适应度函数可能会严重影响聚类质量。本文在基于差分进化-粒子群优化(DEPSO)的聚类框架下,比较了8种常用的聚类有效性指标(Caliński-Harabasz指数、CS指数、Davies-Bouldin指数、Dunn指数及其两种广义版本I指数和轮廓统计指数)在合成数据集和真实数据集上的表现。DEPSO是随机优化方法(差分进化)和群体智能方法(粒子群优化)的混合进化算法,进一步提高了搜索能力,在探索问题空间方面具有更高的灵活性。根据实验结果,我们发现轮廓统计指标在我们检查的大多数数据集中都很突出。同时,我们建议用户不要只根据一个指标得出结论,而是综合考虑多个指标的结果,以实现可靠的聚类结构。
{"title":"A Comparison Study of Validity Indices on Swarm-Intelligence-Based Clustering.","authors":"Rui Xu,&nbsp;Jie Xu,&nbsp;D C Wunsch","doi":"10.1109/TSMCB.2012.2188509","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2188509","url":null,"abstract":"<p><p>Swarm intelligence has emerged as a worthwhile class of clustering methods due to its convenient implementation, parallel capability, ability to avoid local minima, and other advantages. In such applications, clustering validity indices usually operate as fitness functions to evaluate the qualities of the obtained clusters. However, as the validity indices are usually data dependent and are designed to address certain types of data, the selection of different indices as the fitness functions may critically affect cluster quality. Here, we compare the performances of eight well-known and widely used clustering validity indices, namely, the Caliński-Harabasz index, the CS index, the Davies-Bouldin index, the Dunn index with two of its generalized versions, the I index, and the silhouette statistic index, on both synthetic and real data sets in the framework of differential-evolution-particle-swarm-optimization (DEPSO)-based clustering. DEPSO is a hybrid evolutionary algorithm of the stochastic optimization approach (differential evolution) and the swarm intelligence method (particle swarm optimization) that further increases the search capability and achieves higher flexibility in exploring the problem space. According to the experimental results, we find that the silhouette statistic index stands out in most of the data sets that we examined. Meanwhile, we suggest that users reach their conclusions not just based on only one index, but after considering the results of several indices to achieve reliable clustering structures. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1243-56"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2188509","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30519104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 122
Kinematic Bézier Maps. 动态bsamzier地图。
Pub Date : 2012-08-01 Epub Date: 2012-04-03 DOI: 10.1109/TSMCB.2012.2188507
S Ulbrich, V R de Angulo, T Asfour, C Torras, R Dillmann

The kinematics of a robot with many degrees of freedom is a very complex function. Learning this function for a large workspace with a good precision requires a huge number of training samples, i.e., robot movements. In this paper, we introduce the Kinematic Bézier Map (KB-Map), a parameterizable model without the generality of other systems but whose structure readily incorporates some of the geometric constraints of a kinematic function. In this way, the number of training samples required is drastically reduced. Moreover, the simplicity of the model reduces learning to solving a linear least squares problem. Systematic experiments have been carried out showing the excellent interpolation and extrapolation capabilities of KB-Maps and their relatively low sensitivity to noise.

多自由度机器人的运动学是一个非常复杂的函数。对于一个大的工作空间,以良好的精度学习这个函数需要大量的训练样本,即机器人的运动。在本文中,我们介绍了运动学bsamizier映射(KB-Map),这是一种可参数化的模型,没有其他系统的一般性,但其结构很容易包含运动函数的一些几何约束。这样,所需的训练样本数量就大大减少了。此外,该模型的简单性将学习简化为求解线性最小二乘问题。系统的实验表明,KB-Maps具有良好的插值和外推能力,对噪声的敏感性相对较低。
{"title":"Kinematic Bézier Maps.","authors":"S Ulbrich,&nbsp;V R de Angulo,&nbsp;T Asfour,&nbsp;C Torras,&nbsp;R Dillmann","doi":"10.1109/TSMCB.2012.2188507","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2188507","url":null,"abstract":"<p><p>The kinematics of a robot with many degrees of freedom is a very complex function. Learning this function for a large workspace with a good precision requires a huge number of training samples, i.e., robot movements. In this paper, we introduce the Kinematic Bézier Map (KB-Map), a parameterizable model without the generality of other systems but whose structure readily incorporates some of the geometric constraints of a kinematic function. In this way, the number of training samples required is drastically reduced. Moreover, the simplicity of the model reduces learning to solving a linear least squares problem. Systematic experiments have been carried out showing the excellent interpolation and extrapolation capabilities of KB-Maps and their relatively low sensitivity to noise. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1215-30"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2188507","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30557112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Understanding Discrete Facial Expressions in Video Using an Emotion Avatar Image. 使用情感化身图像理解视频中的离散面部表情。
Pub Date : 2012-08-01 Epub Date: 2012-05-07 DOI: 10.1109/TSMCB.2012.2192269
Songfan Yang, B Bhanu

Existing video-based facial expression recognition techniques analyze the geometry-based and appearance-based information in every frame as well as explore the temporal relation among frames. On the contrary, we present a new image-based representation and an associated reference image called the emotion avatar image (EAI), and the avatar reference, respectively. This representation leverages the out-of-plane head rotation. It is not only robust to outliers but also provides a method to aggregate dynamic information from expressions with various lengths. The approach to facial expression analysis consists of the following steps: 1) face detection; 2) face registration of video frames with the avatar reference to form the EAI representation; 3) computation of features from EAIs using both local binary patterns and local phase quantization; and 4) the classification of the feature as one of the emotion type by using a linear support vector machine classifier. Our system is tested on the Facial Expression Recognition and Analysis Challenge (FERA2011) data, i.e., the Geneva Multimodal Emotion Portrayal-Facial Expression Recognition and Analysis Challenge (GEMEP-FERA) data set. The experimental results demonstrate that the information captured in an EAI for a facial expression is a very strong cue for emotion inference. Moreover, our method suppresses the person-specific information for emotion and performs well on unseen data.

现有的基于视频的面部表情识别技术分析了每一帧中基于几何和基于外观的信息,并探索了帧间的时间关系。相反,我们提出了一种新的基于图像的表示和一个相关的参考图像,分别称为情感化身图像(EAI)和化身参考。这种表示利用了面外头部旋转。它不仅对异常值具有鲁棒性,而且还提供了一种从不同长度的表达式中聚合动态信息的方法。面部表情分析的方法包括以下几个步骤:1)人脸检测;2)视频帧的人脸配准与化身参考形成EAI表示;3)利用局部二值模式和局部相位量化计算EAIs的特征;4)利用线性支持向量机分类器将特征分类为情感类型之一。我们的系统在面部表情识别和分析挑战(FERA2011)数据上进行了测试,即日内瓦多模态情绪描述-面部表情识别和分析挑战(GEMEP-FERA)数据集。实验结果表明,EAI捕捉到的面部表情信息是一种非常强的情感推断线索。此外,我们的方法抑制了个人特定的情感信息,并在未见过的数据上表现良好。
{"title":"Understanding Discrete Facial Expressions in Video Using an Emotion Avatar Image.","authors":"Songfan Yang,&nbsp;B Bhanu","doi":"10.1109/TSMCB.2012.2192269","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2192269","url":null,"abstract":"<p><p>Existing video-based facial expression recognition techniques analyze the geometry-based and appearance-based information in every frame as well as explore the temporal relation among frames. On the contrary, we present a new image-based representation and an associated reference image called the emotion avatar image (EAI), and the avatar reference, respectively. This representation leverages the out-of-plane head rotation. It is not only robust to outliers but also provides a method to aggregate dynamic information from expressions with various lengths. The approach to facial expression analysis consists of the following steps: 1) face detection; 2) face registration of video frames with the avatar reference to form the EAI representation; 3) computation of features from EAIs using both local binary patterns and local phase quantization; and 4) the classification of the feature as one of the emotion type by using a linear support vector machine classifier. Our system is tested on the Facial Expression Recognition and Analysis Challenge (FERA2011) data, i.e., the Geneva Multimodal Emotion Portrayal-Facial Expression Recognition and Analysis Challenge (GEMEP-FERA) data set. The experimental results demonstrate that the information captured in an EAI for a facial expression is a very strong cue for emotion inference. Moreover, our method suppresses the person-specific information for emotion and performs well on unseen data. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"980-92"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2192269","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30613391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 108
Trajectory Learning for Robot Programming by Demonstration Using Hidden Markov Model and Dynamic Time Warping. 基于隐马尔可夫模型和动态时间翘曲的轨迹学习在机器人编程中的应用。
Pub Date : 2012-08-01 Epub Date: 2012-03-09 DOI: 10.1109/TSMCB.2012.2185694
A Vakanski, I Mantegh, A Irish, F Janabi-Sharifi
The main objective of this paper is to develop an efficient method for learning and reproduction of complex trajectories for robot programming by demonstration. Encoding of the demonstrated trajectories is performed with hidden Markov model, and generation of a generalized trajectory is achieved by using the concept of key points. Identification of the key points is based on significant changes in position and velocity in the demonstrated trajectories. The resulting sequences of trajectory key points are temporally aligned using the multidimensional dynamic time warping algorithm, and a generalized trajectory is obtained by smoothing spline interpolation of the clustered key points. The principal advantage of our proposed approach is utilization of the trajectory key points from all demonstrations for generation of a generalized trajectory. In addition, variability of the key points' clusters across the demonstrated set is employed for assigning weighting coefficients, resulting in a generalization procedure which accounts for the relevance of reproduction of different parts of the trajectories. The approach is verified experimentally for trajectories with two different levels of complexity.
本文的主要目的是开发一种用于机器人编程的复杂轨迹学习和复制的有效方法。利用隐马尔可夫模型对所演示的轨迹进行编码,利用关键点的概念生成广义轨迹。关键点的识别是基于演示轨迹中位置和速度的显著变化。利用多维动态时间规整算法对得到的轨迹关键点序列进行时间对齐,并对聚类关键点进行平滑样条插值得到广义轨迹。我们提出的方法的主要优点是利用了所有演示的轨迹关键点来生成广义轨迹。此外,在整个演示集中,关键点聚类的可变性被用于分配权重系数,从而产生一个泛化过程,该过程考虑了轨迹不同部分再现的相关性。该方法在两种不同复杂程度的轨迹上进行了实验验证。
{"title":"Trajectory Learning for Robot Programming by Demonstration Using Hidden Markov Model and Dynamic Time Warping.","authors":"A Vakanski,&nbsp;I Mantegh,&nbsp;A Irish,&nbsp;F Janabi-Sharifi","doi":"10.1109/TSMCB.2012.2185694","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2185694","url":null,"abstract":"The main objective of this paper is to develop an efficient method for learning and reproduction of complex trajectories for robot programming by demonstration. Encoding of the demonstrated trajectories is performed with hidden Markov model, and generation of a generalized trajectory is achieved by using the concept of key points. Identification of the key points is based on significant changes in position and velocity in the demonstrated trajectories. The resulting sequences of trajectory key points are temporally aligned using the multidimensional dynamic time warping algorithm, and a generalized trajectory is obtained by smoothing spline interpolation of the clustered key points. The principal advantage of our proposed approach is utilization of the trajectory key points from all demonstrations for generation of a generalized trajectory. In addition, variability of the key points' clusters across the demonstrated set is employed for assigning weighting coefficients, resulting in a generalization procedure which accounts for the relevance of reproduction of different parts of the trajectories. The approach is verified experimentally for trajectories with two different levels of complexity.","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1039-52"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2185694","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40159260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 148
Statistical Mechanics-Inspired Modeling of Heterogeneous Packet Transmission in Communication Networks. 通信网络中异构分组传输的统计力学建模。
Pub Date : 2012-08-01 Epub Date: 2012-03-09 DOI: 10.1109/TSMCB.2012.2186611
S Sarkar, K Mukherjee, A Ray, A Srivastav, T A Wettergren

This paper presents the qualitative nature of communication network operations as abstraction of typical thermodynamic parameters (e.g., order parameter, temperature, and pressure). Specifically, statistical mechanics-inspired models of critical phenomena (e.g., phase transitions and size scaling) for heterogeneous packet transmission are developed in terms of multiple intensive parameters, namely, the external packet load on the network system and the packet transmission probabilities of heterogeneous packet types. Network phase diagrams are constructed based on these traffic parameters, and decision and control strategies are formulated for heterogeneous packet transmission in the network system. In this context, decision functions and control objectives are derived in closed forms, and the pertinent results of test and validation on a simulated network system are presented.

本文提出了通信网络运行的定性本质,作为典型热力学参数(如顺序参数、温度和压力)的抽象。具体来说,异构数据包传输的关键现象(例如,相变和大小缩放)的统计力学启发模型是根据多个密集参数开发的,即网络系统上的外部数据包负载和异构数据包类型的数据包传输概率。根据这些流量参数构建网络相位图,制定网络系统中异构分组传输的决策和控制策略。在此背景下,以封闭形式推导了决策函数和控制目标,并给出了仿真网络系统的相关测试和验证结果。
{"title":"Statistical Mechanics-Inspired Modeling of Heterogeneous Packet Transmission in Communication Networks.","authors":"S Sarkar,&nbsp;K Mukherjee,&nbsp;A Ray,&nbsp;A Srivastav,&nbsp;T A Wettergren","doi":"10.1109/TSMCB.2012.2186611","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2186611","url":null,"abstract":"<p><p>This paper presents the qualitative nature of communication network operations as abstraction of typical thermodynamic parameters (e.g., order parameter, temperature, and pressure). Specifically, statistical mechanics-inspired models of critical phenomena (e.g., phase transitions and size scaling) for heterogeneous packet transmission are developed in terms of multiple intensive parameters, namely, the external packet load on the network system and the packet transmission probabilities of heterogeneous packet types. Network phase diagrams are constructed based on these traffic parameters, and decision and control strategies are formulated for heterogeneous packet transmission in the network system. In this context, decision functions and control objectives are derived in closed forms, and the pertinent results of test and validation on a simulated network system are presented. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1083-94"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2186611","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40159263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
T-S-Fuzzy-Model-Based Approximation and Controller Design for General Nonlinear Systems. 一般非线性系统的t - s模糊逼近与控制器设计。
Pub Date : 2012-08-01 Epub Date: 2012-03-14 DOI: 10.1109/TSMCB.2012.2187442
Qing Gao, Xiao-Jun Zeng, Gang Feng, Yong Wang, Jianbin Qiu

This paper presents a novel approach to control general nonlinear systems based on Takagi-Sugeno (T-S) fuzzy dynamic models. It is first shown that a general nonlinear system can be approximated by a generalized T-S fuzzy model to any degree of accuracy on any compact set. It is then shown that the stabilization problem of the general nonlinear system can be solved as a robust stabilization problem of the developed T-S fuzzy system with the approximation errors as the uncertainty term. Based on a piecewise quadratic Lyapunov function, the robust semiglobal stabilization and H∞ control of the general nonlinear system are formulated in the form of linear matrix inequalities. Simulation results are provided to illustrate the effectiveness of the proposed approaches.

本文提出了一种基于Takagi-Sugeno (T-S)模糊动态模型控制一般非线性系统的新方法。首先证明了广义T-S模糊模型可以在任意紧集上以任意精度逼近一般非线性系统。结果表明,一般非线性系统的镇定问题可求解为以逼近误差为不确定性项的T-S模糊系统的鲁棒镇定问题。基于分段二次Lyapunov函数,用线性矩阵不等式的形式给出了一般非线性系统的鲁棒半全局镇定和H∞控制。仿真结果验证了所提方法的有效性。
{"title":"T-S-Fuzzy-Model-Based Approximation and Controller Design for General Nonlinear Systems.","authors":"Qing Gao,&nbsp;Xiao-Jun Zeng,&nbsp;Gang Feng,&nbsp;Yong Wang,&nbsp;Jianbin Qiu","doi":"10.1109/TSMCB.2012.2187442","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2187442","url":null,"abstract":"<p><p>This paper presents a novel approach to control general nonlinear systems based on Takagi-Sugeno (T-S) fuzzy dynamic models. It is first shown that a general nonlinear system can be approximated by a generalized T-S fuzzy model to any degree of accuracy on any compact set. It is then shown that the stabilization problem of the general nonlinear system can be solved as a robust stabilization problem of the developed T-S fuzzy system with the approximation errors as the uncertainty term. Based on a piecewise quadratic Lyapunov function, the robust semiglobal stabilization and H∞ control of the general nonlinear system are formulated in the form of linear matrix inequalities. Simulation results are provided to illustrate the effectiveness of the proposed approaches. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1143-54"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2187442","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30516844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
An EMG-Based Control for an Upper-Limb Power-Assist Exoskeleton Robot. 基于肌电图的上肢助力外骨骼机器人控制。
Pub Date : 2012-08-01 Epub Date: 2012-02-10 DOI: 10.1109/TSMCB.2012.2185843
K Kiguchi, Y Hayashi

Many kinds of power-assist robots have been developed in order to assist self-rehabilitation and/or daily life motions of physically weak persons. Several kinds of control methods have been proposed to control the power-assist robots according to user's motion intention. In this paper, an electromyogram (EMG)-based impedance control method for an upper-limb power-assist exoskeleton robot is proposed to control the robot in accordance with the user's motion intention. The proposed method is simple, easy to design, humanlike, and adaptable to any user. A neurofuzzy matrix modifier is applied to make the controller adaptable to any users. Not only the characteristics of EMG signals but also the characteristics of human body are taken into account in the proposed method. The effectiveness of the proposed method was evaluated by the experiments.

为了帮助身体虚弱的人进行自我康复和/或日常生活活动,已经开发了多种动力辅助机器人。根据用户的运动意图,提出了多种控制方法来控制助力机器人。本文提出了一种基于肌电图(electromyogram, EMG)的上肢助力外骨骼机器人阻抗控制方法,根据用户的运动意图对机器人进行控制。该方法具有简单、易设计、人性化、可适应任何用户的特点。采用神经模糊矩阵修正器使控制器适应于任意用户。该方法不仅考虑了肌电信号的特点,而且考虑了人体的特点。通过实验验证了该方法的有效性。
{"title":"An EMG-Based Control for an Upper-Limb Power-Assist Exoskeleton Robot.","authors":"K Kiguchi,&nbsp;Y Hayashi","doi":"10.1109/TSMCB.2012.2185843","DOIUrl":"https://doi.org/10.1109/TSMCB.2012.2185843","url":null,"abstract":"<p><p>Many kinds of power-assist robots have been developed in order to assist self-rehabilitation and/or daily life motions of physically weak persons. Several kinds of control methods have been proposed to control the power-assist robots according to user's motion intention. In this paper, an electromyogram (EMG)-based impedance control method for an upper-limb power-assist exoskeleton robot is proposed to control the robot in accordance with the user's motion intention. The proposed method is simple, easy to design, humanlike, and adaptable to any user. A neurofuzzy matrix modifier is applied to make the controller adaptable to any users. Not only the characteristics of EMG signals but also the characteristics of human body are taken into account in the proposed method. The effectiveness of the proposed method was evaluated by the experiments. </p>","PeriodicalId":55006,"journal":{"name":"IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics","volume":" ","pages":"1064-71"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TSMCB.2012.2185843","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"30459271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 465
期刊
IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1