Proceedings Article10.1109/RADAR.2007.374203
Compressive Radar Imaging
Richard G. Baraniuk,Philippe Steeghs +1 more
- 17 Apr 2007
- pp 128-133
TL;DR: It is demonstrated that CS has the potential to make two significant improvements to radar systems: eliminating the need for the pulse compression matched filter at the receiver, and reducing the required receiver analog-to-digital conversion bandwidth so that it need operate only at the radar reflectivity's potentially low "information rate" rather than at its potentially high Nyquist rate.
read more
Abstract: We introduce a new approach to radar imaging based on the concept of compressive sensing (CS). In CS, a low-dimensional, nonadaptive, linear projection is used to acquire an efficient representation of a compressible signal directly using just a few measurements. The signal is then reconstructed by solving an inverse problem either through a linear program or a greedy pursuit. We demonstrate that CS has the potential to make two significant improvements to radar systems: (i) eliminating the need for the pulse compression matched filter at the receiver, and (ii) reducing the required receiver analog-to-digital conversion bandwidth so that it need operate only at the radar reflectivity's potentially low "information rate" rather than at its potentially high Nyquist rate. These ideas could enable the design of new, simplified radar systems, shifting the emphasis from expensive receiver hardware to smart signal recovery algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Split Bregman Method for L1-Regularized Problems
Tom Goldstein,Stanley Osher +1 more
TL;DR: This paper proposes a “split Bregman” method, which can solve a very broad class of L1-regularized problems, and applies this technique to the Rudin-Osher-Fatemi functional for image denoising and to a compressed sensing problem that arises in magnetic resonance imaging.
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
TL;DR: A new type of data acquisition system, called a random demodulator, that is constructed from robust, readily available components that supports the empirical observations, and a detailed theoretical analysis of the system's performance is provided.
Compressed Sensing Off the Grid
TL;DR: This paper investigates the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples and proposes an atomic norm minimization approach to exactly recover the unobserved samples and identify the unknown frequencies.
1.2K
High-Resolution Radar via Compressed Sensing
M.A. Herman,Thomas Strohmer +1 more
TL;DR: A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N times N grid and the techniques of compressed sensing are employed to reconstruct the target scene.
Sensitivity to Basis Mismatch in Compressed Sensing
TL;DR: This paper establishes achievable bounds for the l1 error of the best k -term approximation and derives bounds, with similar growth behavior, for the basis pursuit l1 recovery error, indicating that the sparse recovery may suffer large errors in the presence of basis mismatch.
References
•Book
A wavelet tour of signal processing
Stéphane Mallat
- 01 Jan 1998
TL;DR: An introduction to a Transient World and an Approximation Tour of Wavelet Packet and Local Cosine Bases.
20.3K
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
TL;DR: In this paper, the authors considered the model problem of reconstructing an object from incomplete frequency samples and showed that with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the lscr/sub 1/ minimization problem.
Atomic Decomposition by Basis Pursuit
TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
11.3K
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Joel A. Tropp,Anna C. Gilbert +1 more
TL;DR: It is demonstrated theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal.
Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case
Joel A. Tropp,Anna C. Gilbert +1 more
- 01 Aug 2007
TL;DR: In this paper, a greedy algorithm called Orthogonal Matching Pursuit (OMP) was proposed to recover a signal with m nonzero entries in dimension 1 given O(m n d) random linear measurements of that signal.