Adaptive compressed sensing recovery utilizing the property of signal's autocorrelations

IEEE Transactions on Image Processing

Volumn 21, Issue 5, 2012, Pages 2369-2378

  Fu, Changjun ^a   Ji, Xiangyang ^a   Dai, Qionghai ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Autocorrelations; compressed sensing (CS); matrix completion; random projections; spare representation

Indexed keywords

AUTO-REGRESSIVE; COMPRESSED SENSING; LOW RANK; MATRIX COMPLETION; OPTIMAL BASIS; ORIGINAL SIGNAL; PERIODIC SIGNAL; RANDOM PROJECTIONS; RECONSTRUCTION ALGORITHMS; RECONSTRUCTION QUALITY; RECOVERED SIGNALS; SECOND ORDERS; SPARE REPRESENTATION; STATIONARY PROCESS; STATISTICAL PROPERTIES;

ALGORITHMS; AUTOCORRELATION; RECOVERY;

SIGNAL RECONSTRUCTION;

ALGORITHM; ARTICLE; COMPUTER ASSISTED DIAGNOSIS; IMAGE ENHANCEMENT; INFORMATION PROCESSING; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; SIGNAL PROCESSING;

ALGORITHMS; DATA COMPRESSION; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY; SIGNAL PROCESSING, COMPUTER-ASSISTED;

EID: 84860132286     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2011.2177989     Document Type: Article

References (34)

1. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
2. E. J. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
3. E. J. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
4. E. J. Candes and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
5. E. J. Candes, M. B. Wakin, and S. P. Boyd, "Enhancing sparsity by reweighted l1 minimization," J. Fourier Anal. Appl., vol. 14, no. 5/6, pp. 877-905, Dec. 2008.
6. H. Mohimani, M. Babaie-Zadeh, and C. Jutten, "A fast approach for overcomplete sparse decomposition based on smoothed norm," IEEE Trans. Signal Process., vol. 57, no. 1, pp. 289-301, Jan. 2009.
7. W. Guo and W. Yin, "Compressed sensing via iterative support detection," SIAM J. Imaging Sci., vol. 3, no. 3, pp. 462-491, Aug. 2010.
8. S. Ji, Y. Xue, and L. Carin, "Bayesian compressive sensing," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2346-2356, Jun. 2008.
9. M. F. Duarte, M. B.Wakin, and R. G. Baraniuk,"Wavelet-domain compressive signal reconstruction using a hidden Markov tree model," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Las Vegas, NV, 2008, pp. 5137-5140.
10. L. He and L. Carin, "Exploiting structure in wavelet-based Bayesian compressive sensing," IEEE Trans. Signal Process., vol. 57, no. 9, pp. 3488-3497, Sep. 2009.
11. R. G. Baraniuk, V. Cevher,M. F. Duarte, and C. Hegde, "Model-based compressive sensing," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1982-2001, Apr. 2010.
12. S. Mallat, A Wavelet Tour of Signal Processing. New York: Academic, 1999.
13. N. Kingsbury, "Complex wavelets for shift invariant analysis and filtering of signals," Appl. Comput. Harmon. Anal., vol. 10, no. 3, pp. 234-253, May 2001.
14. M. N. Do and M. Vetterli, "The contourlet transform: An efficient directional multiresolution image representation," IEEE Trans. Image Process., vol. 14, no. 12, pp. 2091-2106, Dec. 2005.
15. M. Aharon, M. Elad, and A. Bruckstein, "K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4311-4322, Nov. 2006.
16. X. Wu, X. Zhang, and J. Wang, "Model-guided adaptive recovery of compressive sensing," in Proc. Data Compression Conf., Snowbird, UT, 2009, pp. 123-132.
17. E. J. Candes and Y. Plan, "Accurate low-rank matrix recovery from a small number of linear measurements," in Proc. 47th Annu. Allerton Conf. Commun., Control, Comput., 2009, pp. 1223-1230.
18. E. J. Candes and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, no. 6, pp. 717-772, Apr. 2009.
19. E. J. Candes and Y. Plan, "Matrix completion with noise," Proc. IEEE, vol. 98, no. 6, pp. 925-936, Jun. 2010.
20. E. J. Candes and M. B. Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 21-30, Mar. 2008.
21. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
22. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4655-4666, Dec. 2007.
23. I. Daubechies, M. Defrise, and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, Nov. 2004.
24. M. Fornasier and H. Rauhut, "Iterative thresholding algorithms," Appl. Comput. Harmon. Anal., vol. 25, no. 2, pp. 187-208, Sep. 2008.
25. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imaging Sci., vol. 2, no. 1, pp. 183-202, Mar. 2009.
26. D. L. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing," Proc. Nat. Acad. Sci. U.S.A., vol. 106, no. 45, pp. 18 914-18 919, Jul. 2009.
27. M. Fazel, "Matrix rank minimization with applications," Ph.D. dissertation, Elect. Eng. Dept., Stanford Univ., Stanford, CA, 2002.
28. R. B. Ash and M. F. Gardner, Topics in Stochastic Processes. New York: Academic, 1975.
29. A. M. Ahmed and D. D. Day, Orthogonal Transforms for Digital Signal Processing. New York: Springer-Verlag, 1975.
30. P. J. Davis, Circulant Matrices. New York: Chelsea, 1994.
31. K. C. Toh and S. Yun, "An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems," Pacific J. Optim., vol. 6, no. 3, pp. 615-640, Sep. 2010.
32. D. Goldfarb and M. Shiqian, "Convergence of fixed-point continuation algorithms for matrix rank minimization," Found. Comput. Math., vol. 11, no. 2, pp. 183-210, Feb. 2011.
33. S. Ma, D. Goldfarb, and L. Chen, "Fixed point and Bregman iterative methods for matrix rank minimization," Math. Program., vol. 11, no. 2, pp. 183-210, Sep. 2011.
34. L. Gan, T. T. Do, and T. D. Tran, "Fast compressive imaging using scrambled block Hadamard ensemble," in Proc. Eur. Signal Process. Conf., Lausanne, Switzerland, 2008.