## Abstract

This paper investigates the use of feature dimensionality reduction approaches for high-dimensional data analysis. Most of the existing preserving projection methods are based on similarity, such as the well-known locality-preserving projections, neighborhood-preserving embedding, and sparsity-preserving projections. Here, we propose a simple yet very efficient preserving projection method based on sparsity and dissimilarity for feature extraction, named dissimilarity sparsity-preserving projections, which is an extended version of sparsity-preserving projections. Both projection coefficients and reconstructive residuals are considered in our proposed framework. We give an idea of a “dissimilarity metric” as the measurement of the relationship among the object data. If the value of the dissimilarity metric of two samples is large, the possibility of them belonging to the same class is small. The proposed methods do not have to preset the number of neighbors and heat kernel width, which is one of the important differences from other projection methods. In practical applications, an approximately direct and complete solution is obtained for the proposed algorithm. Experimental results on three widely used face datasets demonstrate that the proposed framework could achieve competitive performance in terms of accuracy and efficiency.

© 2013 Optical Society of America

Full Article | PDF Article**OSA Recommended Articles**

Haitao Gan, Nong Sang, and Rui Huang

J. Opt. Soc. Am. A **31**(1) 1-6 (2014)

Yi Jiang, Yong Liu, Yunqi Lei, and Qicong Wang

Appl. Opt. **52**(21) 5279-5288 (2013)

Ronald Wu and Henry Stark

Appl. Opt. **24**(2) 179-184 (1985)