메뉴 건너뛰기




Volumn , Issue , 2010, Pages 3618-3625

Fast sparse representation with prototypes

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX RELAXATION; LARGE-SCALE PROBLEM; MEMORY REQUIREMENTS; MINIMIZATION PROBLEMS; SPARSE CODING; SPARSE REPRESENTATION; SPEED-UPS; STATE-OF-THE-ART ALGORITHMS; TIME AND SPACE;

EID: 77955985602     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5539919     Document Type: Conference Paper
Times cited : (43)

References (34)
  • 2
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • 1, 3
    • M. Aharon, M. Elad, and A. Bruckstein. K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing, 54(11):4311, 2006. 1, 3
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.11 , pp. 4311
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 3
    • 0032114647 scopus 로고    scopus 로고
    • What is the set of images of an object under all possible illumination conditions
    • 1
    • P. N. Belhumeur and D. J. Kriegman. What is the set of images of an object under all possible illumination conditions. International Journal of Computer Vision, 28(3):1-16, 1998. 1
    • (1998) International Journal of Computer Vision , vol.28 , Issue.3 , pp. 1-16
    • Belhumeur, P.N.1    Kriegman, D.J.2
  • 5
    • 59749104367 scopus 로고    scopus 로고
    • From sparse solutions of systems of equations to sparse modeling of signals and images
    • 1, 2, 3, 5
    • A. Bruckstein, D. Donoho, and M. Elad. From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Review, 51(1):34-81, 2009. 1, 2, 3, 5
    • (2009) SIAM Review , vol.51 , Issue.1 , pp. 34-81
    • Bruckstein, A.1    Donoho, D.2    Elad, M.3
  • 9
    • 33947416035 scopus 로고    scopus 로고
    • Near-optimal signal recovery from random projections: Universal encoding strategies?
    • 1, 2, 4
    • E. Candes and T. Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Transactions on Information Theory, 52(12):5406-5425, 2006. 1, 2, 4
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.12 , pp. 5406-5425
    • Candes, E.1    Tao, T.2
  • 10
    • 0024771664 scopus 로고
    • Orthogonal least squares methods and their application to non-linear system identification
    • 1
    • S. Chen, S. Billings, and W. Luo. Orthogonal least squares methods and their application to non-linear system identification. International Journal of Control, 50(5):1873-1896, 1989. 1
    • (1989) International Journal of Control , vol.50 , Issue.5 , pp. 1873-1896
    • Chen, S.1    Billings, S.2    Luo, W.3
  • 12
    • 55349134896 scopus 로고    scopus 로고
    • 1-norm minimization problems when the solution may be sparse
    • 1, 5
    • 1-norm minimization problems when the solution may be sparse. IEEE Transactions on Information Theory, 54(11):4789-4812, 2008. 1, 5
    • (2008) IEEE Transactions on Information Theory , vol.54 , Issue.11 , pp. 4789-4812
    • Donoho, D.1    Tsaig, Y.2
  • 14
    • 33751379736 scopus 로고    scopus 로고
    • Image denoising via sparse and redundant representations over learned dictionaries
    • 1, 3
    • M. Elad and M. Aharon. Image denoising via sparse and redundant representations over learned dictionaries. IEEE Transactions on Image Processing, 15(12):3736-3745, 2006. 1, 3
    • (2006) IEEE Transactions on Image Processing , vol.15 , Issue.12 , pp. 3736-3745
    • Elad, M.1    Aharon, M.2
  • 17
    • 84864043302 scopus 로고    scopus 로고
    • Sparse representation for signal classification
    • 3
    • K. Huang and S. Aviyente. Sparse representation for signal classification. In NIPS, volume 19, pages 609-616, 2006. 3
    • (2006) NIPS , vol.19 , pp. 609-616
    • Huang, K.1    Aviyente, S.2
  • 21
    • 0034133184 scopus 로고    scopus 로고
    • Learning overcomplete representations
    • 1, 3
    • M. S. Lewicki and T. J. Sejnowski. Learning overcomplete representations. Neural Computation, 12(2):337-365, 2000. 1, 3
    • (2000) Neural Computation , vol.12 , Issue.2 , pp. 337-365
    • Lewicki, M.S.1    Sejnowski, T.J.2
  • 24
    • 55149117992 scopus 로고    scopus 로고
    • Learning multiscale sparse representations for image and video restoration
    • 3
    • J. Mairal, G. Sapiro, and M. Elad. Learning multiscale sparse representations for image and video restoration. SIAM Multiscale Modeling and Simulation, 7(1):214-241, 2008. 3
    • (2008) SIAM Multiscale Modeling and Simulation , vol.7 , Issue.1 , pp. 214-241
    • Mairal, J.1    Sapiro, G.2    Elad, M.3
  • 25
    • 0027842081 scopus 로고
    • Matching pursuits with time-frequency dictionaries
    • 1
    • S. G. Mallat and Z. Zhang. Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing, 41(12):3397-3415, 1993. 1
    • (1993) IEEE Transactions on Signal Processing , vol.41 , Issue.12 , pp. 3397-3415
    • Mallat, S.G.1    Zhang, Z.2
  • 26
    • 0029220876 scopus 로고
    • Visual learning and recognition of 3-D objects from appearance
    • 1, 7
    • H. Murase and S. Nayar. Visual learning and recognition of 3-D objects from appearance. International Journal of Computer Vision, 14(1):5-24, 1995. 1, 7
    • (1995) International Journal of Computer Vision , vol.14 , Issue.1 , pp. 5-24
    • Murase, H.1    Nayar, S.2
  • 27
    • 0029938380 scopus 로고    scopus 로고
    • Emergence of simple-cell receptive field properties by learning a sparse code for natural images
    • 1, 3
    • B. A. Olshausen and D. J. Field. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature, 381(6583):607-609, 1996. 1, 3
    • (1996) Nature , vol.381 , Issue.6583 , pp. 607-609
    • Olshausen, B.A.1    Field, D.J.2
  • 28
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed by V1?
    • 3
    • B. A. Olshausen and D. J. Field. Sparse coding with an overcomplete basis set: A strategy employed by V1? Vision Research, 37(23):3311-3325, 1997. 3
    • (1997) Vision Research , vol.37 , Issue.23 , pp. 3311-3325
    • Olshausen, B.A.1    Field, D.J.2


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