An algorithm based on the compressed sensing for near range two dimensional imaging

Bailing Ren*, Shiyong Li, Houjun Sun

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Planar array two dimensional (2D) imaging is an important technology. It saves scanning time, but needs a large number of antenna elements. In order to save the cost, we hope to use less antennas to get the same (or better) image results. In this paper, we use sparse planar array and reconstruct the image by the two dimensional fast smoothed L0 (2D-SL0) algorithm. Paraxial Green function is used as sensing matrix. Comparisons of the algorithms based on 2D-SL0 algorithm and the matched filter processing (MFP) are demonstrated by means of numerical simulations. It is obvious that the imaging results by the 2D-SL0 algorithm is much clearer. And the focusing performance of the algorithm based on the 2D-SL0 algorithm is very well, even when we use the sparse antenna array.

Original languageEnglish
Title of host publication2012 Asia-Pacific Microwave Conference, APMC 2012 - Proceedings
Pages1307-1309
Number of pages3
DOIs
Publication statusPublished - 2012
Event2012 Asia-Pacific Microwave Conference, APMC 2012 - Kaohsiung, Taiwan, Province of China
Duration: 4 Dec 20127 Dec 2012

Publication series

NameAsia-Pacific Microwave Conference Proceedings, APMC

Conference

Conference2012 Asia-Pacific Microwave Conference, APMC 2012
Country/TerritoryTaiwan, Province of China
CityKaohsiung
Period4/12/127/12/12

Keywords

  • Compressed sensing
  • Smoothed L0
  • matched filter processing
  • paraxial Green function
  • security detection
  • sparse objects
  • two dimensional imaging

Fingerprint

Dive into the research topics of 'An algorithm based on the compressed sensing for near range two dimensional imaging'. Together they form a unique fingerprint.

Cite this