Abstract
Detecting a ship target by over-the-horizon radar (OTHR) is seriously affected by sea clutter. This paper proposes a clutter suppression algorithm based on dictionary learning and subspace estimation (DLSE). First, the K-singular value decomposition (K-SVD) is used for dictionary learning and sparse representation of the sea clutter. Then, the orthogonal matching pursuit (OMP) is used to reconstruct the sea clutter component to suppress the outliers. Finally, the clutter covariance matrix is calculated using the reconstructed clutter spectrum, and the clutter subspace of the covariance matrix is estimated to achieve clutter suppression. In this paper, the K-SVD is improved to preserve the phase information of the complex signal. The sea clutter spectrum, after sparse representation and reconstruction, is not impacted by outliers in neighboring cells. Therefore, the clutter covariance matrix has a better estimate accuracy than existing subspace decomposition algorithm. The adaptive parameter estimate method also enhances the adaptability of the DLSE. The experimental results of real data demonstrate that the DLSE is as sophisticated as existing subspace decomposition algorithms while having a higher output signal-to-clutter-plus-noise ratio (SCNR) and peak-to-side lobe ratio (PSLR), improving about 2-5 dB. Results of outlier suppression attest to the robustness of the DLSE. Under various coherent integration times (CIT) and frequencies, the DLSE has the best clutter suppression performance among the comparison algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.