메뉴 건너뛰기




Volumn 35, Issue 1, 2013, Pages 92-104

Laplacian sparse coding, Hypergraph Laplacian sparse coding, and applications

Author keywords

hypergraph Laplacian sparse coding; image classification; Laplacian sparse coding; locality preserving; semi auto image tagging

Indexed keywords

A-LAPLACIAN; BAG OF WORDS; CODEBOOKS; CODING PROCESS; COMPUTER VISION APPLICATIONS; HYPERGRAPH; IMAGE REPRESENTATIONS; LAPLACIANS; LOCALITY PRESERVING; OVER-COMPLETE; SEMI-AUTO IMAGE TAGGING; SPARSE CODES; SPARSE CODING; TAGGING PROBLEM;

EID: 84870191664     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2012.63     Document Type: Article
Times cited : (357)

References (54)
  • 1
    • 29144489844 scopus 로고    scopus 로고
    • For most large underdetermined systems of linear equations, the minimal l1-norm solution is also the sparsest solution
    • Stanford Univ.
    • D. Donoho, "For Most Large Underdetermined Systems of Linear Equations, the Minimal l1-Norm Solution Is Also the Sparsest Solution," technical report, Stanford Univ., 2004.
    • (2004) Technical Report
    • Donoho, D.1
  • 2
    • 29144489844 scopus 로고    scopus 로고
    • For most large underdetermined systems of linear equations, the minimal l1-norm near-solution approximates the sparsest near-solution
    • Stanford Univ.
    • D. Donoho, "For Most Large Underdetermined Systems of Linear Equations, the Minimal l1-Norm Near-Solution Approximates the Sparsest Near-Solution," technical report, Stanford Univ., 2004.
    • (2004) Technical Report
    • Donoho, D.1
  • 3
    • 33745604236 scopus 로고    scopus 로고
    • Stable signal recovery from incomplete and inaccurate measurements
    • DOI 10.1002/cpa.20124
    • E. Candès, J. Romberg, and T. Tao, "Stable Signal Recovery from Incomplete and Inaccurate Measurements," Comm. Pure and Applied Math., vol. 59, no. 8, pp. 1207-1223, 2006. (Pubitemid 43988295)
    • (2006) Communications on Pure and Applied Mathematics , vol.59 , Issue.8 , pp. 1207-1223
    • Candes, E.J.1    Romberg, J.K.2    Tao, T.3
  • 4
    • 77955994778 scopus 로고    scopus 로고
    • Efficient computation of robust low-rank matrix approximations in the presence of missing data using the l1 norm
    • A. Eriksson and A. van den Hengel, "Efficient Computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data Using the l1 Norm," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010.
    • (2010) Proc. IEEE Conf. Computer Vision and Pattern Recognition
    • Eriksson, A.1    Hengel Den A.Van2
  • 6
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • DOI 10.1109/TSP.2006.881199
    • M. Aharon, M. Elad, and A. Bruckstein, "K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation," IEEE Trans. Signal Processing, vol. 54, no. 11, pp. 4311-4322, Nov. 2006. (Pubitemid 44637761)
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.11 , pp. 4311-4322
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 7
    • 33751379736 scopus 로고    scopus 로고
    • Image denoising via sparse and redundant representations over learned dictionaries
    • DOI 10.1109/TIP.2006.881969
    • M. Aharon and M. Elad, "Image Denoising via Sparse and Redundant Representations over Learned Dictionaries," IEEE Trans. Image Processing, vol. 15, no. 12, pp. 3736-3745, Dec. 2006. (Pubitemid 44811686)
    • (2006) IEEE Transactions on Image Processing , vol.15 , Issue.12 , pp. 3736-3745
    • Elad, M.1    Aharon, M.2
  • 16
  • 18
    • 77953694851 scopus 로고    scopus 로고
    • A note on the group lasso and a sparse group lasso
    • arXiv:1001.0736v1
    • J. Friedman, T. Hastie, and R. Tibshiraniz, "A Note on the Group Lasso and a Sparse Group Lasso," technical report, arXiv:1001.0736v1, 2010.
    • (2010) Technical Report
    • Friedman, J.1    Hastie, T.2    Tibshiraniz, R.3
  • 21
    • 77956548668 scopus 로고    scopus 로고
    • Tree-guided group lasso for multi-task regression with structured sparsity
    • S. Kim and E.P. Xing, "Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity," Proc. Int'l Conf. Machine Learning, 2010.
    • (2010) Proc. Int'l Conf. Machine Learning
    • Kim, S.1    Xing, E.P.2
  • 22
    • 80052232477 scopus 로고    scopus 로고
    • An efficient proximal-gradient method for single and multi-task regression with structured sparsity
    • arXiv: 1005.4717
    • X. Chen, Q. Lin, S. Kim, J. Peña, J.G. Carbonell, and E.P. Xing, "An Efficient Proximal-Gradient Method for Single and Multi-Task Regression with Structured Sparsity," technical report, arXiv:1005.4717, 2010.
    • (2010) Technical Report
    • Chen, X.1    Lin, Q.2    Kim, S.3    Peña, J.4    Carbonell, J.G.5    Xing, E.P.6
  • 24
    • 77953226691 scopus 로고    scopus 로고
    • Beyond the euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
    • J. Wu and J.M. Rehg, "Beyond the Euclidean Distance: Creating Effective Visual Codebooks Using the Histogram Intersection Kernel," Proc. IEEE Int'l Conf. Computer Vision, 2009.
    • (2009) Proc. IEEE Int'l Conf. Computer Vision
    • Wu, J.1    Rehg, J.M.2
  • 28
    • 33745855044 scopus 로고    scopus 로고
    • The pyramid match kernel: Discriminative classification with sets of image features
    • K. Grauman and T. Darrell, "The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features," Proc. IEEE Int'l Conf. Computer Vision, 2005.
    • (2005) Proc. IEEE Int'l Conf. Computer Vision
    • Grauman, K.1    Darrell, T.2
  • 35
    • 34548583274 scopus 로고    scopus 로고
    • A tutorial on spectral clustering
    • U. von Luxburg, "A Tutorial on Spectral Clustering," Statistics and Computing, vol. 14, no. 7, pp. 395-416, 2007.
    • (2007) Statistics and Computing , vol.14 , Issue.7 , pp. 395-416
    • Von Luxburg, U.1
  • 36
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed by V1?
    • DOI 10.1016/S0042-6989(97)00169-7, PII S0042698997001697
    • B.A. Olshausen and D.J. Fieldt, "Sparse Coding with an Overcomplete Basis Set: A Strategy Employed by v1," Vision Research, vol. 37, pp. 3311-3325, 1997. (Pubitemid 27493805)
    • (1997) Vision Research , vol.37 , Issue.23 , pp. 3311-3325
    • Olshausen, B.A.1    Field, D.J.2
  • 39
    • 76749107542 scopus 로고    scopus 로고
    • Online learning for matrix factorization and sparse coding
    • Mar.
    • J. Mairal, F. Bach, J. Ponce, and G. Sapiro, "Online Learning for Matrix Factorization and Sparse Coding," J. Machine Learning Research, vol. 11, pp. 19-60, Mar. 2010.
    • (2010) J. Machine Learning Research , vol.11 , pp. 19-60
    • Mairal, J.1    Bach, F.2    Ponce, J.3    Sapiro, G.4
  • 42
    • 3042535216 scopus 로고    scopus 로고
    • Distinctive image features from scale-invariant keypoints
    • D.G. Lowe, "Distinctive Image Features from Scale-Invariant Keypoints," Int'l J. Computer Vision, vol. 60, no. 2, pp. 91-110, 2004.
    • (2004) Int'l J. Computer Vision , vol.60 , Issue.2 , pp. 91-110
    • Lowe, D.G.1
  • 45
    • 50649103674 scopus 로고    scopus 로고
    • What, where and who? Classifying events by scene and object recognition
    • L.-J. Li and L. Fei-Fei, "What, Where and Who? Classifying Events by Scene and Object Recognition," Proc. IEEE Int'l Conf. Computer Vision, 2007.
    • (2007) Proc. IEEE Int'l Conf. Computer Vision
    • Li, L.-J.1    Fei-Fei, L.2
  • 48
    • 70049083257 scopus 로고    scopus 로고
    • Fast inference in sparse coding algorithms with applications to object recognition
    • arXiv:1010.3467v1
    • K. Kavukcuoglu, M. Ranzato, and Y. Lecun, "Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition," technical report, arXiv:1010.3467v1, 2008.
    • (2008) Technical Report
    • Kavukcuoglu, K.1    Ranzato, M.2    Lecun, Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.