Abstract

In recent years, various attempts have been undertaken to obtain three-dimensional (3-D) re∞ectivity of observed scene from synthetic aperture radar (SAR) technique. Linear array SAR (LASAR) has been demonstrated as a promising technique to achieve 3-D imaging of earth surface. The common methods used for LASAR imaging are usually based on matched fllter (MF) which obeys the traditional Nyquist sampling theory. However, due to limitation in the length of linear array and the \Rayleigh resolution, the standard MF- based methods sufier from low resolution and high sidelobes. Hence, high resolution imaging algorithms are desired. In LASAR images, dominating scatterers are always sparse compared with the total 3- D illuminated space cells. Combined with this prior knowledge of sparsity property, this paper presents a novel algorithm for LASAR imaging via compressed sensing (CS). The theory of CS indicates that sparse signal can be exactly reconstructed in high Signal-Noise- Ratio (SNR) level by solving a convex optimization problem with a very small number of samples. To overcome strong noise and clutter interference in LASAR raw echo, the new method flrstly achieves range focussing by a pulse compression technique, which can greatly improve SNR level of signal in both azimuth and cross- track directions. Then, the resolution enhancement images of sparse targets are reconstructed by L1 norm regularization. High resolution properties and point localization accuracies are tested and verifled by simulation and real experimental data. The results show that the CS method outperforms the conventional MF-based methods, even if very small random selected samples are used.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.