期刊文献+

局部平衡的判别近邻嵌入算法 被引量:1

Locality-Balanced Discriminant Neighborhood Embedding
下载PDF
导出
摘要 判别近邻嵌入算法(discriminant neighborhood embedding,DNE)通过构造邻接图,使得在投影子空间中能够保持原始数据的局部结构,能有效地发现最佳判别方向。但是它有两方面的不足:一方面不能标识样本点的近邻样本点位置信息,从而不能更好地保持邻域结构;另一方面当数据不均衡时,不能实现子空间中类内聚合或者类间分离的目的,这不利于分类。为此提出了一种新的有监督子空间学习算法——局部平衡的判别近邻嵌入算法(locality-balanced DNE,LBDNE)。在构建邻接图时,局部平衡的判别近邻嵌入算法分别建立同类邻接图和异类邻接图,并通过引入一个控制参数,有效地平衡了类内与类间的关系。该算法与其他经典算法相比,在人脸识别问题上具有较高的识别率,充分说明了局部平衡的判别近邻嵌入算法能够有效地处理识别问题。 Discriminant neighborhood embedding (DNE) is one of methods for dimensionality reduction. By constructing an adjacency graph to keep the local structure of original data in the subspace, DNE can effectively find an optimal discriminant direction. However, there are two shortcomings. On the one hand, it cannot identify the detail location of neighbors, and thus cannot keep the neighborhood structure well. On the other hand, the adjacency relationship would be imbalanced, which may not achieve the goal of minimizing the inter-class scatter and maximizing the intra-class scatter. It is not useful for classification. In order to overcome the shortcomings of DNE, this paper proposes a novel supervised subspace learning method, called locality-balanced DNE (LBDNE). In LBDNE, the homogenous and heterogeneous adjacency graphs are constructed. By adjusting the value of control parameter, the intra-class and inter-class relations can be balanced effectively. This paper compares LBDNE with the other state-of-art methods for dimensionality reduction techniques on artificial dataset and real face datasets. The experi-mental results show the feasibility and effectiveness of LBDNE.
出处 《计算机科学与探索》 CSCD 2014年第7期877-885,共9页 Journal of Frontiers of Computer Science and Technology
基金 国家自然科学基金(61373093,61033013) 江苏省自然科学基金(BK2011284,BK201222725) 江苏省高校自然科学研究项目(13KJA520001) 江苏省青蓝工程~~
关键词 判别近邻嵌入(DNE) 邻接图 局部结构 人脸识别 discriminant neighborhood embedding (DNE) adjacency graph local structure face recognition
  • 相关文献

参考文献15

  • 1Tenenbaum J B, de Silva V, Langford J C. A global geometric framework for nonlinear dimensionality reduction[J]. Science, 2000, 290(5500): 2319-2323.
  • 2Roweis S T, Saul L K. Nonlinear dimensionality reduction by locally linear embedding[J]. Science, 2000, 290(5500): 2323-2326.
  • 3Belkin M, Niyogi P. Laplacian eigenmaps and spectral tech- niques for embedding and clustering[C]//Proceedings of the Conference on Advances in Neural Information Processing System, 2001: 585-591.
  • 4Joliffe I. Principal component analysis[M]. New York: Springer, 1986.
  • 5Martinez A M, Kak A C. PCA versus LDA[J]. IEEE Trans- actions on Pattem Analysis and Machine Intelligence, 2001, 23(2): 228-233.
  • 6Fukunnaga K. Introduction to statistical pattern recognition[M]. 2nd ed. San Diego, CA, USA: Academic Press Professional, Inc, 1991.
  • 7Yan Shuicheng, Xu Dong, Zhang Benyu, et al. Graph em- bedding: a general framework for dimensionality reduction[C]// Proceedings of the 2005 IEEE Computer Society Confer- ence on Computer Vision and Pattem Recognition (CVPR '05). Piscataway, NJ, USA: IEEE, 2005: 830-837.
  • 8Yan Shuicheng, Xu Dong, Zhang Benyu, et al. Graph em- bedding and extensions: a general framework for dimen-sionality reduction[J]. IEEE Transactions on Pattern Analy- sis and Machine Intelligence, 2007, 29(1): 40-51.
  • 9He Xiaofei, Cai Deng, Yan Shuicheng, et al. Neighborhood preserving embedding[C]//Proceedings of the 10th IEEE International Conference on Computer Vision (ICCV '05). Piscataway, NJ, USA: IEEE, 2005: 1208-1213.
  • 10He Xiaofei, Yah Shuicheng, Hu Yuxiao, et al. Face recognition using Laplacian faces[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27(3): 328-340.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部