Sparsity preserving projection（SPP） is a popular graph-based dimensionality reduction（DR） method, which has been successfully applied to solve face recognition recently. SPP contains natural discriminating information by preserving sparse reconstruction relationship of data sets. However, SPP suffers from the fact that every new feature learned from data sets is linear combinations of all the original features, which often makes it difficult to interpret the results. To address this issue, a novel DR method called dual-sparsity preserving projection （DSPP） is proposed to further impose sparsity constraints on the projection directions of SPP. Specifically, the proposed method casts the projection function learning of SPP into a regression-type optimization problem, and then the sparse projections can be efficiently computed by the related lasso algorithm. Experimental results from face databases demonstrate the effectiveness of the proposed algorithm.
