The linear sampling method (LSM) offers a qualitative image reconstruction approach, which is known as a viable alternative for obstacle support identification to the well-studied filtered backprojection (FBP), which depends on a linearized forward scattering model. Of practical interest is the imaging of obstacles from sparse aperture far-field data under a fixed single frequency mode of operation. Under this scenario, the Tikhonov regularization typically applied to LSM produces poor images that fail to capture the obstacle boundary. In this paper, we employ an alternative regularization strategy based on constraining the sparsity of the solution's spatial gradient. Two regularization approaches based on the spatial gradient are developed. A numerical comparison to the FBP demonstrates that the new method's ability to account for aspect-dependent scattering permits more accurate reconstruction of concave obstacles, whereas a comparison to Tikhonov-regularized LSM demonstrates that the proposed approach significantly improves obstacle recovery with sparse-aperture data.

Remote sensing with radar is typically an ill-posed linear inverse problem: a scene is to be inferred from limited measurements of scattered electric fields. Parsimonious models provide a compressed representation of the unknown scene and offer a means for regularizing the inversion task. The emerging field of compressed sensing combines nonlinear reconstruction algorithms and pseudorandom linear measurements to provide reconstruction guarantees for sparse solutions to linear inverse problems. This paper surveys the use of sparse reconstruction algorithms and randomized measurement strategies in radar processing. Although the two themes have a long history in radar literature, the accessible framework provided by compressed sensing illuminates the impact of joining these themes. Potential future directions are conjectured both for extension of theory motivated by practice and for modification of practice based on theoretical insights.