Discriminant sparse coding with geometrical constraint

Recently, some sparse coding methods with geometrical constraint have been proposed, in which local geometrical structure of the data points was preserved during sparse coding process. These methods have been applied to classification problems and gained much success. However, they failed to use label information which has been proved to be useful in supervised sparse coding and discriminant manifold learning. In this paper, we propose a discriminant sparse coding approach with geometrical constraint. Labels are used to learn an intrinsic graph and a penalty graph, and these graphs are then embedded into sparse coding framework as constraints. The local geometric structure within each class is preserved and the separability between different classes is enforced. As a result, the discrimination of sparse coding will be improved. Experiments on benchmark databases demonstrate the effectiveness of the proposed method.