14 September 2016 Sparse graph-based inductive learning with its application to image classification
Author Affiliations +
Abstract
We present a graph-based classification approach called sparse graph-based inductive learning (SGIL). Different to the conventional graph-based classifiers, which perform the classification in a semisupervised way, SGIL is a purely supervised method whose classifier is totally learned in an inductive fashion instead of transductive fashion. Similar to the idea of sparse graph-based classifier, SGIL constructs a sparse graph to encode the correlations of training samples, and considers the classification issue as a regularized sparse graph partition issue where the optimal graph cut should not only minimize the correlation loss of the training samples but also minimize the classification errors. Essentially, the learned graph cut plays a role as the predicted labels here. Thus, a linear classifier can be inductively derived by learning a mapping between the training samples and the graph cuts. Since SGIL is purely supervised, it enjoys several desirable properties over the semisupervised ones in graph construction and model training. We evaluate our work on several popular image datasets. The experimental results demonstrate its superiority.
© 2016 SPIE and IS&T
Qianying Huang, Xiaohong Zhang, Sheng Huang, Dan Yang, "Sparse graph-based inductive learning with its application to image classification," Journal of Electronic Imaging 25(5), 050502 (14 September 2016). https://doi.org/10.1117/1.JEI.25.5.050502 . Submission:
JOURNAL ARTICLE
4 PAGES


SHARE
RELATED CONTENT

Variational Bayesian level set for image segmentation
Proceedings of SPIE (December 24 2013)
Shape and Function
Proceedings of SPIE (March 27 1987)
Two-Dimensional Shape Recognition Using Redundant Hashing
Proceedings of SPIE (March 01 1990)
Recovery Of Superquadrics From 3-D Information
Proceedings of SPIE (February 19 1988)

Back to Top