Asymptotic MMSE analysis under sparse representation modeling
暂无分享,去创建一个
[1] Shlomo Shamai,et al. Statistical Physics of Signal Estimation in Gaussian Noise: Theory and Examples of Phase Transitions , 2008, IEEE Transactions on Information Theory.
[2] Imre Csisźar,et al. The Method of Types , 1998, IEEE Trans. Inf. Theory.
[3] J R FRAZER,et al. Methods analysis. , 1953, Journal of the American Dietetic Association.
[4] Shlomo Shamai,et al. Support Recovery With Sparsely Sampled Free Random Matrices , 2011, IEEE Transactions on Information Theory.
[5] Yihong Wu,et al. Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression , 2010, IEEE Transactions on Information Theory.
[6] Dongning Guo,et al. A single-letter characterization of optimal noisy compressed sensing , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[7] Florent Krzakala,et al. Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices , 2012, ArXiv.
[8] Mérouane Debbah,et al. A Deterministic Equivalent for the Analysis of Correlated MIMO Multiple Access Channels , 2009, IEEE Transactions on Information Theory.
[9] Adel Javanmard,et al. Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing , 2011, IEEE Transactions on Information Theory.
[10] T. Shores. Applied Linear Algebra And Matrix Analysis , 1999 .
[11] Andrea Montanari,et al. The LASSO Risk for Gaussian Matrices , 2010, IEEE Transactions on Information Theory.
[12] Martin J. Wainwright,et al. Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices , 2008, IEEE Transactions on Information Theory.
[13] Junan Zhu,et al. Performance regions in compressed sensing from noisy measurements , 2013, 2013 47th Annual Conference on Information Sciences and Systems (CISS).
[14] Andrea Montanari,et al. The dynamics of message passing on dense graphs, with applications to compressed sensing , 2010, ISIT.
[15] Iain B. Collings,et al. Eigenvalue Distributions of Sums and Products of Large Random Matrices Via Incremental Matrix Expansions , 2005, IEEE Transactions on Information Theory.
[16] David L. Donoho,et al. Precise Undersampling Theorems , 2010, Proceedings of the IEEE.
[17] Sergio Verdú,et al. Optimal Phase Transitions in Compressed Sensing , 2011, IEEE Transactions on Information Theory.
[18] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[19] Neri Merhav,et al. Statistical Physics and Information Theory , 2010, Found. Trends Commun. Inf. Theory.
[20] Gou Hosoya,et al. 国際会議参加報告:2014 IEEE International Symposium on Information Theory , 2014 .
[21] O. F. Cook. The Method of Types , 1898 .
[22] R. Couillet,et al. Random Matrix Methods for Wireless Communications , 2011 .
[23] Daniel Pérez Palomar,et al. Performance Analysis and Optimal Selection of Large Minimum Variance Portfolios Under Estimation Risk , 2011, IEEE Journal of Selected Topics in Signal Processing.
[24] Neri Merhav. Optimum Estimation via Gradients of Partition Functions and Information Measures: A Statistical-Mechanical Perspective , 2011, IEEE Transactions on Information Theory.
[25] Andrea Montanari,et al. Universality in Polytope Phase Transitions and Message Passing Algorithms , 2012, ArXiv.
[26] Andrea Montanari,et al. The dynamics of message passing on dense graphs, with applications to compressed sensing , 2010, 2010 IEEE International Symposium on Information Theory.
[27] Vahid Tarokh,et al. Shannon-Theoretic Limits on Noisy Compressive Sampling , 2007, IEEE Transactions on Information Theory.
[28] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[29] Florent Krzakala,et al. Statistical physics-based reconstruction in compressed sensing , 2011, ArXiv.
[30] M. Mézard,et al. Information, Physics, and Computation , 2009 .
[31] D. Donoho,et al. Counting faces of randomly-projected polytopes when the projection radically lowers dimension , 2006, math/0607364.
[32] Kai-Kit Wong,et al. A Deterministic Equivalent for the Analysis of Non-Gaussian Correlated MIMO Multiple Access Channels , 2011, IEEE Transactions on Information Theory.
[33] Daniel Pérez Palomar,et al. Gradient of mutual information in linear vector Gaussian channels , 2005, ISIT.
[34] James S. Harris,et al. Probability theory and mathematical statistics , 1998 .
[35] Yoshiyuki Kabashima,et al. Erratum: A typical reconstruction limit of compressed sensing based on Lp-norm minimization , 2009, ArXiv.
[36] Neri Merhav,et al. Analysis of Mismatched Estimation Errors Using Gradients of Partition Functions , 2013, IEEE Transactions on Information Theory.
[37] Martin J. Wainwright,et al. Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting , 2009, IEEE Trans. Inf. Theory.
[38] Venkatesh Saligrama,et al. Information Theoretic Bounds for Compressed Sensing , 2008, IEEE Transactions on Information Theory.
[39] Mérouane Debbah,et al. Large System Analysis of Linear Precoding in Correlated MISO Broadcast Channels Under Limited Feedback , 2009, IEEE Transactions on Information Theory.
[40] Galen Reeves,et al. The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing , 2010, IEEE Transactions on Information Theory.
[41] Kellen Petersen August. Real Analysis , 2009 .
[42] W. H. Williams,et al. Probability Theory and Mathematical Statistics , 1964 .
[43] Sundeep Rangan,et al. Necessary and Sufficient Conditions for Sparsity Pattern Recovery , 2008, IEEE Transactions on Information Theory.
[44] J. W. Silverstein,et al. On the empirical distribution of eigenvalues of a class of large dimensional random matrices , 1995 .
[45] Andrea Montanari,et al. Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.
[46] Daniel Pérez Palomar,et al. Gradient of mutual information in linear vector Gaussian channels , 2005, IEEE Transactions on Information Theory.
[47] Amir Dembo,et al. Large Deviations Techniques and Applications , 1998 .
[48] J. W. Silverstein,et al. Spectral Analysis of Large Dimensional Random Matrices , 2009 .
[49] Samuel Karlin,et al. A First Course on Stochastic Processes , 1968 .
[50] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[51] David Williams,et al. Probability with Martingales , 1991, Cambridge mathematical textbooks.
[52] J. W. Silverstein,et al. ON THE SIGNAL-TO-INTERFERENCE RATIO OF CDMA SYSTEMS IN WIRELESS COMMUNICATIONS , 2007, math/0702888.
[53] S. Frick,et al. Compressed Sensing , 2014, Computer Vision, A Reference Guide.
[54] Galen Reeves,et al. Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds , 2010, IEEE Transactions on Information Theory.
[55] Kamiar Rahnama Rad. Nearly Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery , 2009, IEEE Transactions on Information Theory.