An N 2 log N back-projection algorithm for SAR image formation

S. Xiao, Jr Munson, S. Basu, Yoram Bresler

Research output: Contribution to journalConference article

Abstract

We propose a fast algorithm for far-field SAR imaging based on a new fast back-projection algorithm developed for tomography. We also modify the algorithm for the near-field scenario. The fast back-projection algorithm for SAR has computational complexity O(N 2 logN). Compared to traditional FFT-based methods, our new algorithm has potential advantages: The new algorithm does not need frequency-domain interpolation, which becomes complex for the wide-angle case; the new approach is applicable to the near-field scenario, taking into account wavefront curvature; and the back-projection algorithm can be easily adapted to parallel computing architectures. For some scenarios of interest, the computational cost of the new backprojection approach is similar to or less than that for FFT-based algorithms.

Original languageEnglish (US)
Pages (from-to)3-7
Number of pages5
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
Volume1
StatePublished - Dec 1 2000
Event34th Asilomar Conference - Pacific Grove, CA, United States
Duration: Oct 29 2000Nov 1 2000

Fingerprint

Image processing
Fast Fourier transforms
Wavefronts
Parallel processing systems
Tomography
Computational complexity
Interpolation
Imaging techniques
Costs

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Cite this

An N 2 log N back-projection algorithm for SAR image formation . / Xiao, S.; Munson, Jr; Basu, S.; Bresler, Yoram.

In: Conference Record of the Asilomar Conference on Signals, Systems and Computers, Vol. 1, 01.12.2000, p. 3-7.

Research output: Contribution to journalConference article

@article{297be7009fe24fafaa7fdd78e58e1cd1,
title = "An N 2 log N back-projection algorithm for SAR image formation",
abstract = "We propose a fast algorithm for far-field SAR imaging based on a new fast back-projection algorithm developed for tomography. We also modify the algorithm for the near-field scenario. The fast back-projection algorithm for SAR has computational complexity O(N 2 logN). Compared to traditional FFT-based methods, our new algorithm has potential advantages: The new algorithm does not need frequency-domain interpolation, which becomes complex for the wide-angle case; the new approach is applicable to the near-field scenario, taking into account wavefront curvature; and the back-projection algorithm can be easily adapted to parallel computing architectures. For some scenarios of interest, the computational cost of the new backprojection approach is similar to or less than that for FFT-based algorithms.",
author = "S. Xiao and Jr Munson and S. Basu and Yoram Bresler",
year = "2000",
month = "12",
day = "1",
language = "English (US)",
volume = "1",
pages = "3--7",
journal = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",
issn = "1058-6393",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - An N 2 log N back-projection algorithm for SAR image formation

AU - Xiao, S.

AU - Munson, Jr

AU - Basu, S.

AU - Bresler, Yoram

PY - 2000/12/1

Y1 - 2000/12/1

N2 - We propose a fast algorithm for far-field SAR imaging based on a new fast back-projection algorithm developed for tomography. We also modify the algorithm for the near-field scenario. The fast back-projection algorithm for SAR has computational complexity O(N 2 logN). Compared to traditional FFT-based methods, our new algorithm has potential advantages: The new algorithm does not need frequency-domain interpolation, which becomes complex for the wide-angle case; the new approach is applicable to the near-field scenario, taking into account wavefront curvature; and the back-projection algorithm can be easily adapted to parallel computing architectures. For some scenarios of interest, the computational cost of the new backprojection approach is similar to or less than that for FFT-based algorithms.

AB - We propose a fast algorithm for far-field SAR imaging based on a new fast back-projection algorithm developed for tomography. We also modify the algorithm for the near-field scenario. The fast back-projection algorithm for SAR has computational complexity O(N 2 logN). Compared to traditional FFT-based methods, our new algorithm has potential advantages: The new algorithm does not need frequency-domain interpolation, which becomes complex for the wide-angle case; the new approach is applicable to the near-field scenario, taking into account wavefront curvature; and the back-projection algorithm can be easily adapted to parallel computing architectures. For some scenarios of interest, the computational cost of the new backprojection approach is similar to or less than that for FFT-based algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0034448656&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034448656&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0034448656

VL - 1

SP - 3

EP - 7

JO - Conference Record of the Asilomar Conference on Signals, Systems and Computers

JF - Conference Record of the Asilomar Conference on Signals, Systems and Computers

SN - 1058-6393

ER -