TY - JOUR
T1 - Iterative Semi-Supervised Sparse Coding Model for Image Classification
AU - Zheng, Haixia
AU - Ip, Horace H. S.
PY - 2014/6/5
Y1 - 2014/6/5
N2 - The scarcity of labeled data and the high-dimensionality of multimedia data are the major obstacles for image classification. Due to these concerns, this paper proposes a novel algorithm, Iterative Semi-supervised Sparse Coding (ISSC), which jointly explores the advantages of both sparse coding and graph-based semi-supervised learning in order to learn discriminative sparse codes as well as an effective classification function. The ISSC algorithm fully exploits initial labels and the subsequently predicted labels for sparse codes learning. At the same time, during the graph-based semi-supervised learning stage, similarity matrix is firstly adjusted through the latest learned sparse codes, and then is utilized to obtain a better classification function. To make the ISSC scale up to larger databases, a novel online dictionary learning algorithm is also proposed to update the dictionary incrementally. In particular, by solving quadratic optimization, the ISSC approach can give rise to closed-form solutions for sparse codes and classification function, respectively. It has been extensively evaluated over three widely used datasets for image classification task. The experimental results in terms of classification accuracy demonstrate the proposed ISSC approach can achieve significant performance improvements with respect to the state-of-the-arts.
AB - The scarcity of labeled data and the high-dimensionality of multimedia data are the major obstacles for image classification. Due to these concerns, this paper proposes a novel algorithm, Iterative Semi-supervised Sparse Coding (ISSC), which jointly explores the advantages of both sparse coding and graph-based semi-supervised learning in order to learn discriminative sparse codes as well as an effective classification function. The ISSC algorithm fully exploits initial labels and the subsequently predicted labels for sparse codes learning. At the same time, during the graph-based semi-supervised learning stage, similarity matrix is firstly adjusted through the latest learned sparse codes, and then is utilized to obtain a better classification function. To make the ISSC scale up to larger databases, a novel online dictionary learning algorithm is also proposed to update the dictionary incrementally. In particular, by solving quadratic optimization, the ISSC approach can give rise to closed-form solutions for sparse codes and classification function, respectively. It has been extensively evaluated over three widely used datasets for image classification task. The experimental results in terms of classification accuracy demonstrate the proposed ISSC approach can achieve significant performance improvements with respect to the state-of-the-arts.
KW - Graph-based semi-supervised learning
KW - Image classification
KW - Incremental dictionary learning
KW - Sparse coding
UR - http://www.scopus.com/inward/record.url?scp=84937640177&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84937640177&origin=recordpage
U2 - 10.1007/s11265-014-0907-y
DO - 10.1007/s11265-014-0907-y
M3 - RGC 21 - Publication in refereed journal
SN - 1939-8018
VL - 81
SP - 99
EP - 110
JO - Journal of Signal Processing Systems
JF - Journal of Signal Processing Systems
IS - 1
ER -