메뉴 건너뛰기




Volumn 19, Issue 4, 2010, Pages 858-866

Learning with ℓ1-graph for image analysis

Author keywords

Graph embedding; Semi supervised learning; Sparse representation; Spectral clustering; Subspace learning

Indexed keywords

GRAPH EMBEDDINGS; SEMI-SUPERVISED LEARNING; SPARSE REPRESENTATION; SPECTRAL CLUSTERING; SUBSPACE LEARNING;

EID: 77949722130     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2009.2038764     Document Type: Article
Times cited : (623)

References (22)
  • 1
    • 77949742193 scopus 로고    scopus 로고
    • [Online]. Available
    • [Online]. Available: http://kdd.ics.uci.edu/databases/covertype/ covertype. data.html/
  • 2
    • 77949694235 scopus 로고    scopus 로고
    • [Online]. Available
    • [Online]. Available: http://sparselab.stanford.edu
  • 3
    • 0031185845 scopus 로고    scopus 로고
    • Eigenfaces vs. fisherfaces: Recognition using class specific linear projection
    • Jul.
    • P. Belhumeur, J. Hespanda, and D. Kiregeman, "Eigenfaces vs. fisherfaces: Recognition using class specific linear projection," IEEE Trans. Pattern Anal. Mach. Intell., vol.19, no.7, pp. 711-720, Jul. 1997.
    • (1997) IEEE Trans. Pattern Anal. Mach. Intell. , vol.19 , Issue.7 , pp. 711-720
    • Belhumeur, P.1    Hespanda, J.2    Kiregeman, D.3
  • 4
    • 9444289383 scopus 로고    scopus 로고
    • Regularization and semi-supervised learning on large graphs
    • M. Belkin, I. Matveeva, and P. Niyogi, "Regularization and semi-supervised learning on large graphs," in Proc. Int. Conf. Learning Theory, 2004, vol.3120, pp. 624-638.
    • (2004) Proc. Int. Conf. Learning Theory , vol.3120 , pp. 624-638
    • Belkin, M.1    Matveeva, I.2    Niyogi, P.3
  • 5
    • 0042378381 scopus 로고    scopus 로고
    • Laplacian eigenmaps for dimensionality reduction and data representation
    • M. Belkin and P. Niyogi, "Laplacian eigenmaps for dimensionality reduction and data representation," Neural Comput., vol.15, no.6, pp. 1373-1396, 2002.
    • (2002) Neural Comput. , vol.15 , Issue.6 , pp. 1373-1396
    • Belkin, M.1    Niyogi, P.2
  • 7
    • 0035273106 scopus 로고    scopus 로고
    • Atomic decomposition by basis pursuit
    • S. Chen, D. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," Soc. Ind. Appl. Math. Rev., vol.43, no.1, pp. 129-159, 2001.
    • (2001) Soc. Ind. Appl. Math. Rev. , vol.43 , Issue.1 , pp. 129-159
    • Chen, S.1    Donoho, D.2    Saunders, M.3
  • 8
    • 33646365077 scopus 로고    scopus 로고
    • For most large underdetermined systems of linear equations the minimal norm solution is also the sparsest solution
    • D. Donoho, "For most large underdetermined systems of linear equations the minimal norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol.59, no.7, pp. 797-829, 2004.
    • (2004) Commun. Pure Appl. Math. , vol.59 , Issue.7 , pp. 797-829
    • Donoho, D.1
  • 10
  • 11
    • 0028428774 scopus 로고
    • A database for handwritten text recognition research
    • May
    • J. Hull, "A database for handwritten text recognition research," IEEE Trans. Pattern Anal. Mach. Intell., vol.16, no.5, pp. 550-554, May 1994.
    • (1994) IEEE Trans. Pattern Anal. Mach. Intell. , vol.16 , Issue.5 , pp. 550-554
    • Hull, J.1
  • 13
    • 18144420071 scopus 로고    scopus 로고
    • Acquiring linear subspaces for face recognition under variable lighting
    • May
    • K. Lee, J. Ho, and D. Kriegman, "Acquiring linear subspaces for face recognition under variable lighting," IEEE Trans. Pattern Anal. Mach. Intell., vol.27, no.5, pp. 684-698, May 2005.
    • (2005) IEEE Trans. Pattern Anal. Mach. Intell. , vol.27 , Issue.5 , pp. 684-698
    • Lee, K.1    Ho, J.2    Kriegman, D.3
  • 14
    • 33747163541 scopus 로고    scopus 로고
    • High-dimensional graphs and variable selection with the lasso
    • N. Meinshausen and P. Bühlmann, "High-dimensional graphs and variable selection with the lasso," Ann. Statist., vol.34, no.3, pp. 1436-1462, 2006.
    • (2006) Ann. Statist. , vol.34 , Issue.3 , pp. 1436-1462
    • Meinshausen, N.1    Bühlmann, P.2
  • 15
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed by v1?
    • B. Olshausen and D. Field, "Sparse coding with an overcomplete basis set: A strategy employed by v1?," Vis. Res., vol.37, no.23, pp. 3311-3325, 1998.
    • (1998) Vis. Res. , vol.37 , Issue.23 , pp. 3311-3325
    • Olshausen, B.1    Field, D.2
  • 16
    • 0034704222 scopus 로고    scopus 로고
    • Nonlinear dimensionality reduction by locally linear embedding
    • S. Roweis and L. Saul, "Nonlinear dimensionality reduction by locally linear embedding," Science, vol.290, no.5500, pp. 2323-2326, 2000.
    • (2000) Science , vol.290 , Issue.5500 , pp. 2323-2326
    • Roweis, S.1    Saul, L.2
  • 17
    • 0034244751 scopus 로고    scopus 로고
    • Normalized cuts and image segmentation
    • Aug.
    • J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol.22, no.8, pp. 888-905, Aug. 2000.
    • (2000) IEEE Trans. Pattern Anal. Mach. Intell. , vol.22 , Issue.8 , pp. 888-905
    • Shi, J.1    Malik, J.2
  • 18
    • 0034704229 scopus 로고    scopus 로고
    • A global geometric framework for nonlinear dimensionality reduction
    • J. Tenenbaum, V. Silva, and J. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol.290, no.5500, pp. 2319-2323, 2000.
    • (2000) Science , vol.290 , Issue.5500 , pp. 2319-2323
    • Tenenbaum, J.1    Silva, V.2    Langford, J.3
  • 20
    • 33947194180 scopus 로고    scopus 로고
    • Graph embedding and extensions: A general framework for dimensionality reduction
    • Jan.
    • S. Yan, D. Xu, B. Zhang, Q. Yang, H. Zhang, and S. Lin, "Graph embedding and extensions: A general framework for dimensionality reduction," IEEE Trans. Pattern Anal. Mach. Intell., vol.29, no.1, pp. 40-51, Jan. 2007.
    • (2007) IEEE Trans. Pattern Anal. Mach. Intell. , vol.29 , Issue.1 , pp. 40-51
    • Yan, S.1    Xu, D.2    Zhang, B.3    Yang, Q.4    Zhang, H.5    Lin, S.6


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