Sparse representation is a mathematical model for data representation that has proved to be a powerful tool for solving problems in various fields such as patte recognition, machine leaing, and computer vision. As one of the building blocks of the sparse representation method, dictionary leaing plays an important role in the minimization of the reconstruction error between the original signal and its sparse representation in the space of the leaed dictionary. Although using training samples directly as dictionary bases can achieve good performance, the main drawback of this method is that it may result in a very large and inef-ficient dictionary due to noisy training instances. To obtain a smaller and more representative dictionary, in this paper, we propose an approach called Laplacian sparse dictionary (LSD) leaing. Our method is based on manifold leaing and double sparsity. We incorporate the Laplacian weighted graph in the sparse representation model and impose the l1-norm sparsity on the dictionary. An LSD is a sparse overcomplete dictionary that can preserve the intrinsic structure of the data and lea a smaller dictionary for each class. The leaed LSD can be easily integrated into a classification framework based on sparse representation. We compare the proposed method with other methods using three benchmark-controlled face image databases, Extended Yale B, ORL, and AR, and one uncontrolled person image dataset, i-LIDS-MA. Results show the advantages of the proposed LSD algorithm over state-of-the-art sparse representation based classification methods.