Nonnegative Sparse Locally Linear Coding
Author:
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [21]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    Feature quantization is an important component in Bag of word model. This paper proposes a novel method called nonnegative sparse locally linear coding (NSLLC) to improve the performance of locally linear coding. The core ides of NSLLC is to use nonnegative sparse representation to select the nearest neighbors in the same subspace and then encode the local feature with respect to the local coordinate consisting of these nearest neighbors. Experimental results have shown NSLLC has outperformed state-of-the-art local feature coding methods and is in favor of image classification problem.

    Reference
    [1] Sivic J, Zisserman A. Video Google: A text retrieval approach to object matching in videos. In: Proc. of the ICCV 2003. 2003. 1470?1477.
    [2] Lazebnik S, Schmid C, Ponce J. Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition (CVPR). 2006.
    [3] Yang L, Jin R, Sukthankar R, Jurie F. Unifying discriminative visual codebook generation with classifier training for object category recognition. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition (CVPR). 2008.
    [4] Coates A, Ng AY. The importance of encoding versus training with sparse coding and vector quantization. In: Proc. of the ICML. 2011.
    [5] Boiman O, Shechtman E, Irani M. In defense of nearest-neighbor based image classification. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition (CVPR). Anchorage, 2008.
    [6] Philbin J, Chum O, Isard M, Sivic J, Zisserman A. Object retrieval with large vocabularies and fast spatial matching. In: Proc. of the CVPR. Minneapolis, 2007.
    [7] Yang J, Yu K, Gong Y, Huang T. Linear spatial pyramid matching using sparse coding for image classification. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition (CVPR). 2009.
    [8] Wang J, Yang J, Yu K, Lü F, Huang T, Gong Y. Locality-Constrained linear coding for image classification. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition (CVPR). 2010. 3360?3367.
    [9] Yu K, Zhang T, Gong YH. Nolinear learning using local coordinate coding. In: Proc. of the NIPS 2009. 2009.
    [10] Roweis S, Saul L. Nonlinear dimensionality reduction by locally linear embedding. Science, 2000,290(5500):2323?2326.
    [11] Elhamifar E, Vidal R. Sparse subspace clustering. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition (CVPR). 2009.
    [12] Lee DD, Seung HS. Learning the parts of objects by non-negative matrix factorization. Nature, 1999,401:788?791.
    [13] Hoyer PO. Non-Negative sparse coding. In: Proc. of 2002 the 12th IEEE Workshop on Neural Networks for Signal Processing. 2002. 557?565.
    [14] He R, Zheng WS, Hu BG, Kong XW. Nonnegative sparse coding for discriminative semi-supervised learning. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition (CVPR). 2011.
    [15] Candes E, Tao T. Near-Optimal signal recovery from random projections: Universal encoding strategies. IEEE Trans. on Information Theory, 2006,52(12):5406?5425.
    [16] Donoho D. For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics, 2006,59(6):797?829.
    [17] Yang A, Ganesh A, Sastry S, Ma Y. Fast l1-minimization algorithms and an application in robust face recognition: A review. In: Proc. of the ICIP 2010. 2010.
    [18] Wright J, Yang A, Ganesh A, Sastry S, Ma Y. Robust face recognition via sparse representation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2009,31(2):210?227.
    [19] Lin ZC, Chen MM, Ma Y, The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrix. Technical Report, UILU-ENG-09-2215, UIUC, 2009.
    [20] http://www.ifp.illinois.edu/~jyang29/ScSPM.htm
    [21] http://www.ifp.illinois.edu/~jyang29/LLC.htm
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

庄连生,高浩渊,刘超,俞能海.非负稀疏局部线性编码.软件学报,2011,22(zk2):89-95

Copy
Share
Article Metrics
  • Abstract:3402
  • PDF: 7622
  • HTML: 0
  • Cited by: 0
History
  • Received:July 20,2011
  • Revised:December 01,2011
  • Online: March 30,2012
You are the first2032512Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063