Locality-sensitive support vector machine by exploring local correlation and global regularization

Local classifiers have obtained great success in classification task due to its powerful discriminating ability on local regions. However, most of them still have restricted generalization in twofold: (1) each local classifier is sensitive to noise in local regions which leads to overfitting phenomenon in local classifiers; (2) the local classifiers also ignore the local correlation determined by the sample distribution in each local region. To overcome the above two problems, we present a novel locality-sensitive support vector machine (LSSVM) in this paper for image retrieval problem. This classifier applies locality-sensitive hashing (LSH) to divide the whole feature space into a number of local regions, on each of them a local model can be better constructed due to smaller within-class variation on it. To avoid these local models from overfitting into locality-sensitive structures, it imposes a global regularizer across local regions so that local classifiers are smoothly glued together to form a regularized overall classifier. local correlation is modeled to capture the sample distribution that determines the locality structure of each local region, which can increase the discriminating ability of the algorithm. To evaluate the performance, we apply the proposed algorithm into image retrieval task and competitive results are obtained on the real-world web image data set.

[1]  Jiri Matas,et al.  Geometric min-Hashing: Finding a (thick) needle in a haystack , 2009, CVPR.

[2]  Michael Isard,et al.  Bundling features for large scale partial-duplicate web image search , 2009, CVPR.

[3]  Léon Bottou,et al.  Local Learning Algorithms , 1992, Neural Computation.

[4]  Jitendra Malik,et al.  SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[5]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[6]  Nicole Immorlica,et al.  Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.

[7]  O. Chum,et al.  Geometric min-Hashing: Finding a (thick) needle in a haystack , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[8]  Tin Kam Ho,et al.  Building projectable classifiers of arbitrary complexity , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[9]  Alexandr Andoni,et al.  Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[10]  Tat-Seng Chua,et al.  NUS-WIDE: a real-world web image database from National University of Singapore , 2009, CIVR '09.

[11]  Xian-Sheng Hua,et al.  Learning semantic distance from community-tagged media collection , 2009, MM '09.

[12]  Massimiliano Pontil,et al.  Regularized multi--task learning , 2004, KDD.

[13]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[14]  Rong Jin,et al.  Localized Support Vector Machine and Its Efficient Algorithm , 2007, SDM.

[15]  J. Hanley,et al.  The meaning and use of the area under a receiver operating characteristic (ROC) curve. , 1982, Radiology.