메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1809-1816

A non-convex relaxation approach to sparse dictionary learning

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; IMAGE DENOISING;

EID: 80052910914     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2011.5995592     Document Type: Conference Paper
Times cited : (58)

References (21)
  • 1
    • 67349251766 scopus 로고    scopus 로고
    • Sparse and redundant modeling of image content using an image-signature dictionary
    • July, 1810
    • M. Aharon and M. Elad. Sparse and redundant modeling of image content using an image-signature dictionary. SIAM Journal on Imaging Sciences, 1(3):228-247, July 2008. 1810
    • (2008) SIAM Journal on Imaging Sciences , vol.1 , Issue.3 , pp. 228-247
    • Aharon, M.1    Elad, M.2
  • 2
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation
    • November, 1810
    • M. Aharon, M. Elad, and A. Bruckstein. K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing, 54(11):4311-4322, November 2006. 1810
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.11 , pp. 4311-4322
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 4
    • 80052848936 scopus 로고    scopus 로고
    • Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
    • 1809, 1811, 1812
    • P. Breheny and J. Huang. Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection. To appear in Annals of Applied Statistics. 1809, 1811, 1812
    • To Appear in Annals of Applied Statistics
    • Breheny, P.1    Huang, J.2
  • 5
    • 1542784498 scopus 로고    scopus 로고
    • Variable selection via nonconcave penalized likelihood and its oracle properties
    • 1809
    • J. Fan and R. Li. Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association, 96:1348-1360, 2001. 1809
    • (2001) Journal of the American Statistical Association , vol.96 , pp. 1348-1360
    • Fan, J.1    Li, R.2
  • 11
    • 76749107542 scopus 로고    scopus 로고
    • Online learning for matrix factorization and sparse coding
    • 1810, 1811, 1812
    • J. Mairal, F. Bach, J. Ponce, and G. Sapiro. Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research, 11:19-60, 2010. 1810, 1811, 1812
    • (2010) Journal of Machine Learning Research , vol.11 , pp. 19-60
    • Mairal, J.1    Bach, F.2    Ponce, J.3    Sapiro, G.4
  • 13
    • 39149089704 scopus 로고    scopus 로고
    • Sparse representation for color image restoration
    • 1814, 1815
    • J. Mairal, M. Elad, and G. Sapiro. Sparse representation for color image restoration. IEEE Transactions on Image Processing, 17(1):53-69, 2008. 1814, 1815
    • (2008) IEEE Transactions on Image Processing , vol.17 , Issue.1 , pp. 53-69
    • Mairal, J.1    Elad, M.2    Sapiro, G.3
  • 14
    • 27744548818 scopus 로고    scopus 로고
    • A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics
    • EECS Department, University of California, Berkeley, Jan, 1813
    • D. R. Martin, C. Fowlkes, D. Tal, and J. Malik. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. Technical Report UCB/CSD-01-1133, EECS Department, University of California, Berkeley, Jan 2001. 1813
    • (2001) Technical Report UCB/CSD-01-1133
    • Martin, D.R.1    Fowlkes, C.2    Tal, D.3    Malik, J.4
  • 16
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed by v1
    • 1809, 1810
    • B. A. Olshausen and D. J. Fieldt. Sparse coding with an overcomplete basis set: a strategy employed by v1. Vision Research, 37:3311-3325, 1997. 1809, 1810
    • (1997) Vision Research , vol.37 , pp. 3311-3325
    • Olshausen, B.A.1    Fieldt, D.J.2
  • 17
  • 20
    • 77649284492 scopus 로고    scopus 로고
    • Nearly unbiased variable selection under minimax concave penalty
    • February, 1809
    • C. H. Zhang. Nearly unbiased variable selection under minimax concave penalty. Annals of Statistics, 38:894-942, February 2010. 1809
    • (2010) Annals of Statistics , vol.38 , pp. 894-942
    • Zhang, C.H.1


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