Local sparse coding methods have been shown to lead to increased performance in image classification when it takes histograms as inputs. These methods often use Euclidean ( l 2 ) distance to learn the dictionary and encode the histograms. However, it has been shown that Histogram Intersection Kernel (HIK) is more effective to compare histograms. In this paper, we combine Histogram Intersection Kernel with local sparse coding. We implement dictionary learning and feature encoding on the mapping space that corresponds to the kernel. To encode the features, we propose two methods: one accurate method generating codes consisting of positive and negative values and one approximate method generating only non-negative values. Both of the two encoding methods run very fast. To verify our method, we conduct some experiments on two popular datasets: Caltech-101 and Caltech-256. The results show that the features extracted by our method are more discriminative than other methods and it reaches state-of-the-art result on Caltech-101 when taking single descriptor HOG as input. In addition, it shows that the codes with non-negative constraint are more effective than that without the constraint.