Exploiting Prior Knowledge in The Recovery of Signals from Noisy Random Projections
作者： Javier Garcia-Frias , Inaki Esnaola
DOI: 10.1109/DCC.2007.37
关键词:
摘要: It has been recently shown that if a, signal can be compressed in some basis, then it reconstructed such basis from, a certain number of random, projections. By allowing additional distortion, this holds even the projections are corrupted by noise. We extend result showing is possible to exploit prior knowledge (e.g., realization stochastic process,) significantly improve reconstruction performance. This done fashion resembling standard joint source-channel coding digital sources. Moreover, exploitation allows for bases where not sparse
computer.org
sci-hub.se 参考文章(19)
Martin J. Wainwright, Sharp thresholds for high-dimensional and noisy recovery of sparsity arXiv: Statistics Theory. ,(2006)
Shriram Sarvotham, Richard G. Baraniuk, Dror Baron, Measurements vs. Bits: Compressed Sensing meets Information Theory allerton conference on communication, control, and computing. pp. 1419- 1423 ,(2006)
J. Garcia-Frias, J.D. Villasenor, Joint turbo decoding and estimation of hidden Markov sources IEEE Journal on Selected Areas in Communications. ,vol. 19, pp. 1671- 1679 ,(2001) , 10.1109/49.947032
I. Maravic, M. Vetterli, Sampling and reconstruction of signals with finite rate of innovation in the presence of noise IEEE Transactions on Signal Processing. ,vol. 53, pp. 2788- 2805 ,(2005) , 10.1109/TSP.2005.850321
J. Mammen, D. Donoho, H. Kakavand, The Simplest Solution to an Underdetermined System of Linear Equations international symposium on information theory. pp. 1924- 1928 ,(2006) , 10.1109/ISIT.2006.261816
R. Gray, Information rates of autoregressive processes IEEE Transactions on Information Theory. ,vol. 16, pp. 412- 421 ,(1970) , 10.1109/TIT.1970.1054470
T. Berger, Explicit bounds to R(D) for a binary symmetric Markov source IEEE Transactions on Information Theory. ,vol. 23, pp. 52- 59 ,(1977) , 10.1109/TIT.1977.1055654
C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 international conference on communications. ,vol. 2, pp. 1064- 1070 ,(1993) , 10.1109/ICC.1993.397441
E.J. Candes, T. Tao, Decoding by linear programming IEEE Transactions on Information Theory. ,vol. 51, pp. 4203- 4215 ,(2005) , 10.1109/TIT.2005.858979
Emmanuel J. Candes, Terence Tao, Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? IEEE Transactions on Information Theory. ,vol. 52, pp. 5406- 5425 ,(2006) , 10.1109/TIT.2006.885507