Image classification based on global dictionary learning method with sparse representation
PU Guolin1, QIU Yuhui2
1. School of Computer Science, Sichuan University of Arts and Science, Dazhou Sichuan 635000, China;
2. College of Computer and Information Science, Southwest University, Chongqing 400715, China
To address the problem of low efficiency for traditional massive image classification, a sparse representation based global dictionary learning method was designed. The traditional dictionary learning steps were distributed to parallel nodes, local dictionaries were first learnt in local nodes and then a global dictionary was updated in real time by those local dictionaries and variables through using convex optimization method, thereby enhancing the efficiency of dictionary learning and classification of massive data. Experiments on the MapReduce platform show that the new algorithm has better performance than classical image classification methods without affecting the classification accuracy, and the new algorithm can be widely used in massive and distributed image classification tasks.
蒲国林, 邱玉辉. 基于稀疏表示全局字典学习的图像分类方法[J]. 计算机应用, 2015, 35(2): 499-501.
PU Guolin, QIU Yuhui. Image classification based on global dictionary learning method with sparse representation. Journal of Computer Applications, 2015, 35(2): 499-501.
WRIGHT J, YANG A Y, GANESH A, et al. Robust face recognition via sparse representation [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31(2): 210-227.
[2]
YANG M, ZHANG D, FENG X, et al. Fisher discrimination dictionary learning for sparse representation [C]// Proceedings of the 2011 IEEE International Conference on Computer Vision. Piscataway: IEEE, 2011: 543-550.
[3]
WRIGHT J, YANG A Y, GANESH A, et al. Robust face recognition via sparse representation [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31(2): 210-227.
[4]
TROPP J A, WRIGHT S J. Computational methods for sparse solution of linear inverse problems [J]. Proceedings of the IEEE, 2010, 98(6): 948-958.
[5]
AHARON M, ELAD M, BRUCKSTEIN A. K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation [J]. IEEE Transactions on Signal Processing, 2006, 54(11): 4311-4322.
[6]
JIANG Z, LIN Z, DAVIS L S. Learning a discriminative dictionary for sparse coding via label consistent K-SVD [C]// Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition. Piscataway: IEEE, 2011: 1697-1704.
[7]
MAIRAL J, PONCE J, SAPIRO G, et al. Supervised dictionary learning [C]// Proceedings of the 2009 Neural Information Processing Systems Conference. [S.l.]: NIPS, 2009: 1033-1040.
[8]
SINDHWANI V, GHOTING A. Large-scale distributed non-negative sparse coding and sparse dictionary learning [C]// KDD '12: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2012: 489-497.
[9]
ZHANG Q. The research and implementation of MapReduce-based distributed rule matching system [D]. Hangzhou: Zhejiang University, 2011: 1-5. (张琦.基于MapReduce的分布式规则匹配系统的研究与实现[D].杭州:浙江大学,2011: 1-5.)
[10]
DEAN J, GHEMAWAT S. MapReduce: Simplified data processing on large clusters [J]. Communications of the ACM, 2008, 51(1): 107-113.
[11]
BERTESEKAS D P, TSITSIKLIS J N. Parallel and distributed computation: numerical methods [M]. Upper Saddle River: Prentlce-Hall, 1997: 19-27.
[12]
WANG J. Discriminative sparse coding on multi-manifold for data representation and classification [J]. arXiv preprint arXiv: 2012, 1208.3839.
[13]
LEE K-C, HO J, KRIEGMAN D. Acquiring linear subspaces for face recognition under variable lighting [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27(5): 684-698.
[14]
SHVACHKO K, KUANG H, RADIA S, et al. The Hadoop distributed file system [C]// Proceedings of the IEEE 26th Symposium on Mass Storage Systems and Technologies. Piscataway: IEEE, 2010: 1-10.
2015, Vol. 35 
