11.07.2015 Views

Principles of Modern Radar - Volume 2 1891121537

Principles of Modern Radar - Volume 2 1891121537

Principles of Modern Radar - Volume 2 1891121537

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

198 CHAPTER 5 <strong>Radar</strong> Applications <strong>of</strong> Sparse Reconstruction[14] Li, J. and Stoica, P., MIMO <strong>Radar</strong> Signal Processing, Wiley, New York, 2009.[15] Melvin, W., “A STAP Overview,” IEEE Aerospace and Electronic Systems Magazine,vol. 19, no. 1 (part 2), pp. 19–35, 2004.[16] Richards, M., Fundamentals <strong>of</strong> <strong>Radar</strong> Signal Processing, McGraw-Hill, New York, 2005.[17] Potter, L., Ertin, E., Parker, J., and Cetin, M., “Sparsity and Compressed Sensing in <strong>Radar</strong>Imaging,” Proceedings <strong>of</strong> the IEEE, vol. 98, pp. 1006–1020, June 2010.[18] Khwaja, A.S. and Ma, J., “Applications <strong>of</strong> Compressed Sensing for SAR Moving-TargetVelocity Estimation and Image Compression,” IEEE Transactions on Instrumentation andMeasurement, vol. 60, no. 8, pp. 2848–2860, 2011.[19] Candès, E. and Romberg, J., “Sparsity and Incoherence in Compressive Sampling,” InverseProblems, vol. 23, no. 3, pp. 969–985, 2007.[20] Golub, G. and Van Loan, C., Matrix Computations, Johns Hopkins University Press, 1996.[21] Candès, E.J. and Wakin, M.B., “An Introduction to Compressive Sampling,” IEEE SignalProcessing Magazine, vol. 25, pp. 21–30, March 2008.[22] Grant, M. and Boyd, S., “CVX: Matlab S<strong>of</strong>tware for Disciplined Convex Programming,Version 1.21,” August 2010. Available at http://cvxr.com/cvx.[23] Tropp, J.A., “Just Relax: Convex Programming Methods for Identifying Sparse Signals inNoise,” IEEE Transactions on Information Theory, vol. 52, pp. 1030–1051, March 2006.[24] Boyd, S. and Vandenberghe, L., Convex Optimization, Cambridge University Press,Cambridge, UK, 2004.[25] Taylor, H.L., Banks, S.C., and McCoy, J.F., “Deconvolution with the l1 norm,” Geophysics,vol. 44, no. 1, pp. 39–52, 1979.[26] Tikhonov, A.N. and Arsenin, V.Y., Solutions <strong>of</strong> Ill-Posed Problems, Winston, Washington,DC, 1977.[27] Hansen, P.C., Discrete Inverse Problems: Insight and Algorithms, SIAM, Philadelphia, 2010.[28] Hoerl, A.E. and Kennard, R.W., “Ridge Regression: Biased Estimation for NonorthogonalProblems,” Technometrics, vol. 12, pp. 55–67, February 1970.[29] Baraniuk, R.G., Cevher, V., and Wakin, M.B., “Low-Dimensional Models for DimensionalityReduction and Signal Recovery: A Geometric Perspective,” Proceedings <strong>of</strong> the IEEE,vol. 98, no. 6, pp. 959–971, 2010.[30] Parker, J.T. and Potter, L.C., “A Bayesian Perspective on Sparse Regularization for STAPPostprocessing,” IEEE International <strong>Radar</strong> Conference, May 2010.[31] Chartrand, R. and Staneva, V., “Restricted Isometry Properties and Nonconvex CompressiveSensing,” Inverse Problems, vol. 24, no. 3, p. 035020, 2008.[32] Kruskal, J., “Three-Way Arrays: Rank and Uniqueness <strong>of</strong> Trilinear Decompositions, withApplication to Arithmetic Complexity and Statistics,” Linear Algebra and Its Applications,vol. 18, no. 2, pp. 95–138, 1977.[33] Donoho, D. and Elad, M., “Optimally Sparse Representation in General (Nonorthogonal)Dictionaries via l 1 Minimization,” Proceedings <strong>of</strong> the National Academy <strong>of</strong> Sciences,vol. 100, no. 5, pp. 2197–2202, 2003.[34] Apostol, T.M., Mathematical Analysis, Addison-Wesley Publishing Company, Inc., 1974.[35] Candès, E., “The Restricted Isometry Property and Its Implications for Compressed Sensing,”Comptes rendus-Mathématique, vol. 346, nos. 9–10, pp. 589–592, 2008.[36] S. Foucart, “A Note on Guaranteed Sparse Recovery via l 1 Minimization,” Applied andComputational Harmonic Analysis, 2009.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!