Graph-preserving shortest feature line segment for dimensionality reduction

详细信息    查看全文

• 作者：Wei Li ; ^{vv706@sina.com}Author Vitae ; Qiuqi RuanAuthor Vitae ; Jun WanAuthor Vitae
• 关键词：Dimensionality reduction ; Feature extraction ; Graph embedding ; Nearest feature line ; Shortest feature line segment ; Face recognition
• 刊名：Neurocomputing
• 出版年：2013
• 出版时间：13 June, 2013
• 年：2013
• 卷：110
• 期：Complete
• 页码：80-91
• 全文大小：1652 K

文摘

Shortest feature line segment (SFLS) is a recently proposed classification approach based on nearest feature line (NFL). It naturally inherits the representational capacity enlargement property of NFL and offers many other benefits in accuracy and efficiency. However, SFLS still has several drawbacks, limiting its generalization ability. In this paper, we develop a manifold learning algorithm for dimensionality reduction based on a novel line-based metric derived by integrating SFLS and NFL, which takes advantage of the benefits of the two algorithms and avoids their disadvantages. Unlike the construction of a point-based relationship in traditional dimensionality reduction algorithms, the new measurement forms linear models of multiple feature points, which capture more information than individual prototype and serve to discover the intrinsic connection of nearby points. Moreover, to enhance the discriminating capability, the affinity matrix in graph embedding is designed in supervised manner by using class label information. Experimental results on four standard databases for face recognition confirm the effectiveness of our proposed method.