A fast and accurate basis pursuit denoising algorithm with application to super-resolving tomographic SAR

Yilei Shi, Xiao Xiang Zhu, Wotao Yin, Richard Bamler

Research output: Contribution to journalArticlepeer-review

33 Scopus citations

Abstract

L1 regularization is used for finding sparse solutions to an underdetermined linear system. As sparse signals are widely expected in remote sensing, this type of regularization scheme and its extensions have been widely employed in many remote sensing problems, such as image fusion, target detection, image super-resolution, and others, and have led to promising results. However, solving such sparse reconstruction problems is computationally expensive and has limitations in its practical use. In this paper, we proposed a novel efficient algorithm for solving the complex-valued L1 regularized least squares problem. Taking the high-dimensional tomographic synthetic aperture radar (TomoSAR) as a practical example, we carried out extensive experiments, both with the simulation data and the real data, to demonstrate that the proposed approach can retain the accuracy of the second-order methods while dramatically speeding up the processing by one or two orders. Although we have chosen TomoSAR as the example, the proposed method can be generally applied to any spectral estimation problems.

Original languageEnglish
Article number8412239
Pages (from-to)6148-6158
Number of pages11
JournalIEEE Transactions on Geoscience and Remote Sensing
Volume56
Issue number10
DOIs
StatePublished - Oct 2018

Keywords

  • Basis pursuit denoising (BPDN)
  • L regularization
  • TomoSAR
  • proximal gradient (PG)
  • second-order cone programming (SOCP)

Fingerprint

Dive into the research topics of 'A fast and accurate basis pursuit denoising algorithm with application to super-resolving tomographic SAR'. Together they form a unique fingerprint.

Cite this