Message-passing algorithms for compressed sensing

Proceedings of the National Academy of Sciences of the United States of America

Volumn 106, Issue 45, 2009, Pages 18914-18919

  Donoho, David L ^a   Maleki, Arian ^b   Montanari, Andrea ^a,b  

^a STANFORD UNIVERSITY   (United States)

^b Stanford University   (United States)

Author keywords

Combinatorial geometry; Iterative thresholding algorithms; Linear programming; Phase transitions; State evolution

Indexed keywords

ALGORITHM; ARTICLE; COMPRESSED SENSING; CONTROLLED STUDY; PHASE TRANSITION; PRIORITY JOURNAL; SAMPLING;

ALGORITHMS; MODELS, STATISTICAL; SAMPLE SIZE; STATISTICS AS TOPIC;

EID: 73149095169     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.0909892106     Document Type: Article

References (23)

1. Baraniuk RG, Candès E, Nowak R, Vetterli M, eds (2008) Special Issue on Compressive Sampling. IEEE Signal Processing Magazine (IEEE, Los Alamitos, CA), Vol. 25, Issue 2.
2. Tropp J, Wright SJ (2009) Computational methods for sparse solution of linear inverse problems. arXiv:0907.3666v1.
3. Maleki A, Donoho DL (2009) Optimally tuned iterative thresholding algorithms for compressed sensing. arXiv:0909.0777.
4. Donoho DL (2006) High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension. Disc Comput Geom 35:617-652.
5. Donoho DL, Tanner J (2005) Neighborliness of randomly-projected simplices in high dimensions. Proc Natl Acad Sci USA 102:9452-9457.
6. Donoho DL, Tanner J (2008) Counting faces of randomly projected hypercubes and orthants with applications. arXiv:0807.3590.
7. Donoho DL, Tanner J (2009) Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing. Philos Trans R Soc London Ser A 367:4273-4293.
8. Herrity KK, Gilbert AC, Tropp JA (2006) Sparse approximation via iterative thresholding. Proc IEEE Int Conf Acoust Speech Signal Proc 3:624-627.
9. Tropp JA, Gilbert AC (2007) Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans Inf Theor 53:4655-4666.
10. 1 norm. Found Comput Sci 199-207.
11. Daubechies I, Defrise M, De Mol C (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm Pure Appl Math 75:1412-1457.
12. p balls. Prob Theor Rel Fields 99:277-303.
13. Needel D, Tropp J (2008) CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl Comp Harm Anal 26:301-321.
14. Dai W, Milenkovic O (2009) Subspace pursuit for compressive sensing signal reconstruction. arXiv:0803.0811v3.
15. Pearl J (1988) Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (Kaufmann, San Francisco).
16. Richardson TJ, Urbanke R (2008) Modern Coding Theory (Cambridge Univ Press, Cambridge, UK).
17. Lu Y, Montanari A, Prabhakar B, Dharmapurikar S, Kabbani A (2008) Counter braids: A novel counter architecture for per-flow measurement. Proc 2008 ACM SIGMETRICS Int Conf Measur Model Comput Syst, eds Liu Z, Misra V, Shenoy PJ (Assoc Comput Machinery, New York).
18. Sarvotham S, Baron D, Baraniuk R (2006) Compressed sensing reconstruction via belief propagation, preprint.
19. Zhang F, Pfister H (2009) On the iterative decoding of high-rate LDPC codes with applications in compressed sensing. arXiv:0903.2232v2.
20. Wainwright MJ, Jaakkola TS, Willsky AS (2005) MAP estimation via agreement on trees: Message-passing and linear programming. IEEE Trans Inf Theor 51:3697-3717.
21. Bayati M, Shah D, Sharma M (2008) Max-product for maximum weight matching: Convergence, correctness, and LP duality. IEEE Trans Inf Theor 54:1241-1251.
22. Thouless DJ, Anderson PW, Palmer RG (1977) Solution of 'Solvable model of a spin glass'. Philos Mag 35:593-601.
23. Jafarpour S, Xu W, Hassibi B, Calderbank AR (2008) Efficient and robust compressed sensing using high-quality expander graphs. Comput Res Reposit abs/0806.3802.