Principles of Modern Radar - Volume 2 1891121537

5.8 References 203[116] Eldar, Y.C. and Mishali, M., “Robust Recovery of Signals from a Structured Union ofSubspaces,” IEEE Transactions on Information Theory, vol. 55, pp. 5302–5316, November2009.[117] Schniter, P., “Turbo Reconstruction of Structured Sparse Signals,” ICASSP, 2010.[118] Koetter, R., Singer, A., and Tuchler, M., “Turbo Equalization,” IEEE Signal ProcessingMagazine, vol. 21, pp. 67–80, January 2004.[119] Candès, E. and Recht, B., “Exact Matrix Completion via Convex Optimization,” Arxivpreprint arXiv:0805.44, 2008.[120] Candès, E., Li, X., Ma, Y., and Wright, J., “Robust Principal Component Analysis?:Recovering Low-Rank Matrices from Sparse Errors,” in Proceedings of the IEEE SensorArray and Multichannel Signal Processing Workshop, pp. 201–204, 2010.[121] Tao, M. and Yuan, X., “Recovering Low-Rank and Sparse Components of Matrices fromIncomplete and Noisy Observations,” SIAM Journal on Optimization, vol. 21, no. 1, pp.57–81, 2011.[122] Cao, G. and Bouman, C.A., “Covariance Estimation for High Dimensional Data VectorsUsing the Sparse Matrix Transform,” in Proceedings of Neural Information ProcessingSystems Conference, December 2008.[123] Malioutov, D., Cetin, M., and Willsky, A.S., “A Sparse Signal Reconstruction Perspectivefor Source Localization with Sensor Arrays,” IEEE Transactions on Signal Processing, vol.53, pp. 3010–3022, August 2005.[124] Chi, Y., Pezeshki, A., Scharf, L., and Calderbank, R., “Sensitivity to Basis Mismatch inCompressed Sensing,” in Proceedings of the IEEE International Acoustics Speech andSignal Processing Conference, pp. 3930–3933, 2010.[125] Zhu, H., Leus, G., and Giannakis, G., “Sparsity-Cognizant Total Least-Squares for PerturbedCompressive Sampling,” IEEE Transactions on Signal Processing, vol. 59, pp. 2002–2016,May 2011.[126] Herman, M.A. and Strohmer, T., “General Deviants: An Analysis of Perturbations inCompressed Sensing,” IEEE Journal of Selected Topics in Signal Processing, vol. 4, no. 2,pp. 342–349, 2010.[127] Rosenbaum, M. and Tsybakov, A., “Sparse Recovery under Matrix Uncertainty,” Annals ofStatistics, vol. 38, no. 5, pp. 2620–2651, 2010.[128] Parker, J.T., Cevher, V., and Schniter, P., “Compressive Sensing under Matrix Uncertainties:An Approximate Message Passing Approach,” in Proceedings of Asilomar Conference onSignals, Systems, and Computers, November 2011.[129] Tosic, I. and Frossard, P., “Dictionary Learning,” IEEE Signal Processing Magazine, vol.28, pp. 27–38, March 2011.[130] Goldstein, T. and Osher, S., “The Split Bregman Method for l 1 -Regularized Problems,”SIAM Journal on Imaging Sciences, vol. 2, p. 323, 2009.[131] Yin, W., Osher, S., Goldfarb, D., and Darbon, J., “Bregman Iterative Algorithms forl 1 -Minimization with Applications to Compressed Sensing,” SIAM Journal on ImagingSciences, vol. 1, no. 1, pp. 143–168, 2008.[132] Rice University, “Compressive Sensing Resources.” Available at http://dsp.rice.edu/cs.[133] Gurbuz, A.C., McClellan, J.H., and Scott Jr., R., “A Compressive Sensing Data Acquisitionand Imaging Method for Stepped Frequency GPRs,” IEEE Transactions on SignalProcessing, pp. 1–1, 2009.