
Efficient ℓ q regularisation algorithm with range–azimuth decoupled for SAR imaging
Author(s) -
Jiang C.L.,
Zhang B.C.,
Fang J.,
Zhe Z.,
Hong W.,
Wu Y.R.,
Xu Z.B.
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2013.1989
Subject(s) - computational complexity theory , synthetic aperture radar , algorithm , azimuth , compressed sensing , computer science , logarithm , radar imaging , decoupling (probability) , computer vision , mathematics , radar , mathematical analysis , telecommunications , geometry , control engineering , engineering
The synthetic aperture radar (SAR) imaging methods based on compressive sensing endure great computational complexity since they have to deal with a large measurement matrix when processing the raw data. An efficient ℓ q regularisation algorithm for SAR imaging is proposed, which uses a decoupling operator constructed by means of chirp scaling. It can reduce the computational complexity from the square order to the linear logarithm order compared with the conventional ℓ q regularisation‐based imaging algorithm while preserving the equivalent imaging quality. The proposed algorithm is efficient in the sense that it allows reconstruction of the sparse scenes with the sub‐sampling data.