An Image Classification Method Based on Locality-Constrained Sparse Coding with Ranking Locality Adaptor

被引:0
|
作者
Cao Y. [1 ]
机构
[1] Information Engineering School of NanChang University, Nanchang, 330031, Jiangxi
来源
关键词
Dictionary learning; Image classification; Locality-constrained; Neighborhood-ranking;
D O I
10.3969/j.issn.0372-2112.2019.04.010
中图分类号
学科分类号
摘要
Image classification is an important research direction in the field of computer vision analysis. The key to classification depends largely on the feature representation of the image. In order to be able to classify images better, this paper presents a locality-constrained sparse coding for image classification by introducing ranking locality adaptor as distance regularization. The proposed ranking locality adaptor has previously been used in Neural Gas (NG) method for vector quantization, which originally remedies the K-means by using this soft-competitive learning scheme. In the new proposed method, a closed-form solution can be derived at sparse coding step. In addition, dictionary updates are generally determined by the error term of the objective function. Some classical algorithms have used this method to update the dictionary. This paper uses the ORL database and COIL20 database to compare the proposed algorithm with the existing algorithm Locality-constrained Linear Coding, and Metaface Learning algorithm. The experimental results show that the proposed algorithm has an accuracy of more than 95% in image classification and has stronger performance than the current excellent algorithms. In addition, the recognition rate of the algorithm does not change greatly with the change of the data feature dimension. It can be seen that this paper provides a valuable solution for the classification of computer vision images. © 2019, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码:832 / 836
页数:4
相关论文
共 14 条
  • [1] Turk M., Pentland A., Eigenfaces for recognition, J Cogn Neurosci, 3, 1, pp. 71-86, (1991)
  • [2] Roweis S.T., Saul L.K., Nonlinear dimensionality reduction by locally linear embedding, Science, 290, 5500, pp. 2323-2326, (2000)
  • [3] Wright J., Yang A.Y., Ganesh A., Et al., Robust face recognition via sparse representation, IEEE Transactions on Pattern Analysis & Machine Intelligence, 31, 2, pp. 210-227, (2009)
  • [4] Olshausen B.A., Field D.J., Emergence of simple-cell receptive field properties by learning a sparse code for natural images, Nature, 381, 6583, pp. 607-609, (1996)
  • [5] Yang M., Zhang L., Yang J., Et al., Metaface learning for sparse representation based face recognition, IEEE International Conference on Image Processing, pp. 1601-1604, (2010)
  • [6] Wang J., Yang J., Yu K., Et al., Locality-constrained linear coding for image classification, Computer Vision and Pattern Recognition, pp. 3360-3367, (2010)
  • [7] Wei C.P., Chao Y.W., Yeh Y.R., Et al., Locality-sensitive dictionary learning for sparse representation based classification, Pattern Recognition, 46, 5, pp. 1277-1287, (2013)
  • [8] Martinetz T.M., Berkovich S.G., Schulten K.J., `Neural-gas' network for vector quantization and its application to time-series prediction, IEEE Trans Neural Netw, 4, 4, pp. 558-569, (1993)
  • [9] Engan K., Aase S.O., Husoy J.H., Frame based signal compression using method of optimal directions (MOD), IEEE International Symposium on Circuits and Systems, pp. 1-4, (1999)
  • [10] Aharon M., Elad M., Bruckstein A., K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation, IEEE Transactions on Signal Processing, 54, 11, pp. 4311-4322, (2006)