메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1545-1553

Asymptotic analysis of MAP estimation via the replica method and compressed sensing

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SENSING; ESTIMATION; GAUSSIAN NOISE (ELECTRONIC); MEAN SQUARE ERROR; REGRESSION ANALYSIS; STATISTICAL PHYSICS;

EID: 84858722178     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (49)

References (19)
  • 3
    • 0003689287 scopus 로고    scopus 로고
    • Statistical physics of spin glasses and information processing: An introduction
    • Oxford Univ. Press, Oxford, UK
    • H. Nishimori. Statistical physics of spin glasses and information processing: An introduction. International Series of Monographs on Physics. Oxford Univ. Press, Oxford, UK, 2001.
    • (2001) International Series of Monographs on Physics
    • Nishimori, H.1
  • 4
    • 0036846395 scopus 로고    scopus 로고
    • A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors
    • November
    • T. Tanaka. A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors. IEEE Trans. Inform. Theory, 48(11):2888-2910, November 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , Issue.11 , pp. 2888-2910
    • Tanaka, T.1
  • 5
    • 17644431522 scopus 로고    scopus 로고
    • Channel capacity and minimum probability of error in large dual antenna array systems with binary modulation
    • November
    • R. R. Müller. Channel capacity and minimum probability of error in large dual antenna array systems with binary modulation. IEEE Trans. Signal Process., 51(11):2821-2828, November 2003.
    • (2003) IEEE Trans. Signal Process. , vol.51 , Issue.11 , pp. 2821-2828
    • Müller, R.R.1
  • 6
    • 20544442268 scopus 로고    scopus 로고
    • Randomly spread CDMA: Asymptotics via statistical physics
    • June
    • D. Guo and S. Verdú. Randomly spread CDMA: Asymptotics via statistical physics. IEEE Trans. Inform. Theory, 51(6):1983-2010, June 2005.
    • (2005) IEEE Trans. Inform. Theory , vol.51 , Issue.6 , pp. 1983-2010
    • Guo, D.1    Verdú, S.2
  • 9
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • February
    • E. J. Candès, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory, 52(2):489-509, February 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.2 , pp. 489-509
    • Candès, E.J.1    Romberg, J.2    Tao, T.3
  • 10
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • April
    • D. L. Donoho. Compressed sensing. IEEE Trans. Inform. Theory, 52(4):1289-1306, April 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.4 , pp. 1289-1306
    • Donoho, D.L.1
  • 11
    • 33947416035 scopus 로고    scopus 로고
    • Near-optimal signal recovery from random projections: Universal encoding strategies?
    • December
    • E. J. Candès and T. Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inform. Theory, 52(12):5406-5425, December 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.12 , pp. 5406-5425
    • Candès, E.J.1    Tao, T.2
  • 12
    • 0029291966 scopus 로고
    • Sparse approximate solutions to linear systems
    • April
    • B. K. Natarajan. Sparse approximate solutions to linear systems. SIAM J. Computing, 24(2):227-234, April 1995.
    • (1995) SIAM J. Computing , vol.24 , Issue.2 , pp. 227-234
    • Natarajan, B.K.1
  • 14
    • 0001287271 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the lasso
    • R. Tibshirani. Regression shrinkage and selection via the lasso. J. Royal Stat. Soc., Ser. B, 58(1):267-288, 1996.
    • (1996) J. Royal Stat. Soc., ser. B , vol.58 , Issue.1 , pp. 267-288
    • Tibshirani, R.1
  • 15
    • 33144483155 scopus 로고    scopus 로고
    • Stable recovery of sparse overcomplete representations in the presence of noise
    • January
    • D. L. Donoho, M. Elad, and V. N. Temlyakov. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory, 52(1):6-18, January 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.1 , pp. 6-18
    • Donoho, D.L.1    Elad, M.2    Temlyakov, V.N.3
  • 16
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • October
    • J. A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory, 50(10):2231-2242, October 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.10 , pp. 2231-2242
    • Tropp, J.A.1
  • 17
    • 33645712308 scopus 로고    scopus 로고
    • Just relax: Convex programming methods for identifying sparse signals in noise
    • March
    • J. A. Tropp. Just relax: Convex programming methods for identifying sparse signals in noise. IEEE Trans. Inform. Theory, 52(3):1030-1051, March 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.3 , pp. 1030-1051
    • Tropp, J.A.1
  • 18
    • 65749083666 scopus 로고    scopus 로고
    • 1-constrained quadratic programming (lasso)
    • May
    • 1-constrained quadratic programming (lasso). IEEE Trans. Inform. Theory, 55(5):2183-2202, May 2009.
    • (2009) IEEE Trans. Inform. Theory , vol.55 , Issue.5 , pp. 2183-2202
    • Wainwright, M.J.1
  • 19
    • 57349138185 scopus 로고    scopus 로고
    • Counting faces of randomly-projected polytopes when the projection radically lowers dimension
    • January
    • D. L. Donoho and J. Tanner. Counting faces of randomly-projected polytopes when the projection radically lowers dimension. J. Amer. Math. Soc., 22(1):1-53, January 2009.
    • (2009) J. Amer. Math. Soc. , vol.22 , Issue.1 , pp. 1-53
    • Donoho, D.L.1    Tanner, J.2


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