Lasso screening for object categories recognition using multi-directional context features

Image representation using local features and sparse coding (SC) plays a very important role in image classification when the dataset is fairly large. Despite of its worldwide popularity, there are still some improving space in classification efficiency and computational investment in training and coding phrase of SC. In this paper, we put forward a novel object categories recognition method from two aspects. First, the contextual relevance between image patches are fully utilized by merging local feature of every sub-patch with its neighboring ones into strong context features to generate the multiple sparse representations, which are received by the SC and multi-scale max pooling SPM(Spatial Pyramid Matching), respectively. Second, while calculating the sparse coefficients of SC, we need to solve L1-regularized least square problem. Screening out the zero coefficients and discarding the corresponding inactive codewords before solving Lasso problem can remarkably speed up the optimization. The proposed method outperforms state-of-the-art performancein a large number of image categorization experiments on several benchmarks: the ground truth dataset (21 Land-Use database), the event dataset (UIUC-Sport dataset), and the object recognition dataset (Caltech101 dataset).