메뉴 건너뛰기




Volumn 5, Issue , 2006, Pages

Random projections of signal manifolds

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SENSING (CS); RANDOM BASIS FUNCTIONS; RANDOM PROJECTIONS;

EID: 33947665032     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (18)
  • 1
    • 0003733695 scopus 로고    scopus 로고
    • An elementary proof of the Johnson-Lindenstrauss lemma
    • Tech. Rep. TR-99-006, Berkeley, CA
    • S. Dasgupta and A. Gupta, "An elementary proof of the Johnson-Lindenstrauss lemma," Tech. Rep. TR-99-006, Berkeley, CA, 1999.
    • (1999)
    • Dasgupta, S.1    Gupta, A.2
  • 2
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • P. Indyk and R. Motwani, "Approximate nearest neighbors: Towards removing the curse of dimensionality," in Proc. 30th Ann. ACM Sympos. Theory Comput., 1998, pp. 604-613.
    • (1998) Proc. 30th Ann. ACM Sympos. Theory Comput , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 3
    • 27744588733 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • Preprint
    • E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," 2004, Preprint.
    • (2004)
    • Candès, E.1    Romberg, J.2    Tao, T.3
  • 6
    • 30844471849 scopus 로고    scopus 로고
    • Signal recovery from partial information via orthogonal matching pursuit
    • Preprint
    • J. Tropp and A. C. Gilbert, "Signal recovery from partial information via orthogonal matching pursuit," 2005, Preprint.
    • (2005)
    • Tropp, J.1    Gilbert, A.C.2
  • 7
    • 33646749072 scopus 로고    scopus 로고
    • The Dantzig selector: Statistical estimation when p is much larger than n
    • Preprint
    • E. Candès and T. Tao, "The Dantzig selector: Statistical estimation when p is much larger than n," 2005, Preprint.
    • (2005)
    • Candès, E.1    Tao, T.2
  • 13
    • 0033248623 scopus 로고    scopus 로고
    • Wedgelets: Nearly-minimax estimation of edges
    • D. L. Donoho, "Wedgelets: Nearly-minimax estimation of edges," Annals of Stat, vol. 27, pp. 859-897, 1999.
    • (1999) Annals of Stat , vol.27 , pp. 859-897
    • Donoho, D.L.1
  • 15
    • 0034476075 scopus 로고    scopus 로고
    • A new approach for dimensionality reduction: Theory and algorithms
    • D. S. Broomhead and M. Kirby, "A new approach for dimensionality reduction: Theory and algorithms," SIAM J. of Applied Mathematics, vol. 60, no. 6, 2000.
    • (2000) SIAM J. of Applied Mathematics , vol.60 , Issue.6
    • Broomhead, D.S.1    Kirby, M.2
  • 16
    • 0040927711 scopus 로고    scopus 로고
    • The Whitney Reduction Network: A method for computing autoassociative graphs
    • D. S. Broomhead and M. J. Kirby, "The Whitney Reduction Network: a method for computing autoassociative graphs," Neural Computation, vol. 13, pp. 2595-2616, 2001.
    • (2001) Neural Computation , vol.13 , pp. 2595-2616
    • Broomhead, D.S.1    Kirby, M.J.2


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