Multi-level K-means clustering and group sparse coding with quasi-sift feature for image classification

被引：0

作者：

Lihe, Zhang ^{[1
]}

Chen, Ma ^{[1
]}

机构：

[1] School of Information and Communication Engineering, Dalian University of Technology, Liaoning

来源：

International Journal of Information and Communication Technology | 2015年 / 7卷 / 4-5期

基金：

中国国家自然科学基金;

关键词：

Clustering; Group sparse coding; Image classification;

D O I：

10.1504/IJICT.2015.070326

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Traditional sparse coding treats local descriptors separately, leading to random locations of non-zero coefficients. To overcome this problem, group sparse coding was proposed. By leveraging mixed-norm regularisation, the locations of non-zero coefficients tend to cluster into groups. However, how to rationally constitute 'a group' is still a problem, since forcing local descriptors in a group to have uniform sparse pattern may be too rigid and bring about larger reconstruction error and information loss, especially when descriptors in a group are not very similar. In this paper, we propose multi-level K-means clustering and group sparse coding to address this issue, which is called MK-GSC. Moreover, we present a novel local descriptor based on SIFT to further promote the power of representation for images. Our method is tested on two public benchmarks, and achieves competitive or better results than the state-of-the-art methods. Copyright © 2015 Inderscience Enterprises Ltd.

引用

页码：495 / 507

页数：12

共 29 条

[1]

Bengio S., Pereira F., Singer Y., Group sparse coding, Advances in Neural Information Processing Systems Conference, pp. 1-8, (2009)

[2]

Boiman O., Shechtman E., Irani M., In defense of nearest-neighbor based image classification, The IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8, (2008)

[3]

Buades A., Coll B., Morel J., A non-local algorithm for image denoising, The IEEE Conference on Computer Vision and Pattern Recognition, pp. 60-65, (2005)

[4]

Dabov K., Foi A., Katkovnik V., Egiazarian K., Image denoising with block-matching and 3D filtering, SPIE Conference on Electronic Imaging: Algorithms and Systems, Neural Networks, and Machine Learning, 6064, pp. 354-365, (2006)

[5]

Donoho D., For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution, Comm. Pure and Applied Math., 59, 6, pp. 797-829, (2006)

[6]

Gao S.H., Tsang I.W.H., Chia L.T., Kernel sparse representation for image classification and face recognition, European Conference on Computer Vision, pp. 1-14, (2010)

[7]

Gao S.H., Tsang I.W.H., Chia L.T., Zhao P.L., Local features are not lonely-Laplacian sparse coding for image classification, The IEEE Conference on Computer Vision and Pattern Recognition, pp. 3555-3561, (2010)

[8]

Huang Y.Z., Huang K.Q., Yu Y.N., Tan T.N., Salient coding for image classification, The IEEE Conference on Computer Vision and Pattern Recognition, pp. 1753-1760, (2011)

[9]

Jiang Z.L., Lin Z., Davis L.S., Learning a discriminative dictionary for sparse coding via label consistent K-SVD, The IEEE Conference on Computer Vision and Pattern Recognition, pp. 1697-1704, (2011)

[10]

Jiang Z.L., Zhang G.X., Davis L.S., Submodular dictionary learning for sparse coding, The IEEE Conference on Computer Vision and Pattern Recognition, pp. 3418-3425, (2012)

← 1 2 3 →