.png){kind=icon}
.png){kind=icon}
Return
An Efficient Solution to the Factorized Geometrical Autofocus Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TGRS.2016.2550663.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper describes a new search strategy within the scope of factorized geometrical autofocus (FGA) and synthetic-aperture-radar processing. The FGA algorithm is a fast factorized back-projection formulation with six adjustable geometry parameters. By tuning the flight track step by step and maximizing focus quality by means of an object function, a sharp image is formed. We propose an efficient two-stage approach for the geometrical variation. The first stage is a low-order (few parameters) parallel search procedure involving small image areas. The second stage then combines the local hypotheses into one global autofocus solution, without the use of images. This method has been applied successfully on ultrawideband CARABAS II data. Errors due to a constant acceleration are superposed on the measured track prior to processing, giving a 6-D autofocus problem. Image results, including resolution, peak-to-sidelobe ratio and magnitude values for point-like targets, finally confirm the validity of the strategy. The results also verify the prediction that there are several satisfying autofocus solutions for the same radar data.
Keywords:
Autofocus
back-projection
synthetic aperture radar (SAR)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.6
Papers:
2.1W
Citations:
10.7W