...
首页> 外文期刊>Chaos, Solitons and Fractals: Applications in Science and Engineering: An Interdisciplinary Journal of Nonlinear Science >Effective and efficient Grassfinch kernel for SVM classification and its application to recognition based on image set
【24h】

Effective and efficient Grassfinch kernel for SVM classification and its application to recognition based on image set

机译:高效的Grassfinch SVM分类内核及其在基于图像集的识别中的应用

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

This paper presents an effective and efficient kernel approach to recognize image set which is represented as a point on extended Grassmannian manifold. Several recent studies focus on the applicability of discriminant analysis on Grassmannian manifold and suffer from not obtaining the inherent nonlinear structure of the data itself. Therefore, we propose an extension of Grassmannian manifold to address this issue. Instead of using a linear data embedding with PCA, we develop a non-linear data embedding of such manifold using kernel PCA. This paper mainly consider three folds: 1) introduce a non-linear data embedding of extended Grassmannian manifold, 2) derive a distance metric of Grassmannian manifold, 3) develop an effective and efficient Grassmannian kernel for SVM classification. The extended Grassmannian manifold naturally arises in the application to recognition based on image set, such as face and object recognition. Experiments on several standard databases show better classification accuracy. Furthermore, experimental results indicate that our proposed approach significantly reduces time complexity in comparison to graph embedding discriminant analysis. (C) 2015 Elsevier Ltd. All rights reserved.
机译:本文提出了一种有效而有效的核方法来识别图像集,该图像集表示为扩展的格拉斯曼流形上的一个点。最近的一些研究集中在判别分析在格拉斯曼流形上的适用性,并且遭受了无法获得数据本身固有的非线性结构的困扰。因此,我们建议扩展Grassmannian流形以解决此问题。代替使用PCA嵌入线性数据,我们使用内核PCA开发了这种流形的非线性数据嵌入。本文主要考虑三个方面:1)引入扩展的Grassmannian流形的非线性数据嵌入; 2)推导Grassmannian流形的距离度量; 3)开发用于SVM分类的有效和高效的Grassmannian核。扩展的格拉斯曼流形自然地出现在基于图像集的识别应用中,例如面部和物体识别。在几个标准数据库上进行的实验显示出更好的分类准确性。此外,实验结果表明,与图嵌入判别分析相比,我们提出的方法大大降低了时间复杂度。 (C)2015 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号