Factorized Geometrical Autofocus for Synthetic Aperture Radar Processing

This paper describes a factorized geometrical autofocus (FGA) algorithm, specifically suitable for ultrawideband synthetic aperture radar. The strategy is integrated in a fast factorized back-projection chain and relies on varying track parameters step by step to obtain a sharp image; focus measures are provided by an object function (intensity correlation). The FGA algorithm has been successfully applied on synthetic and real (Coherent All RAdio BAnd System II) data sets, i.e., with false track parameters introduced prior to processing, to set up constrained problems involving one geometrical quantity. Resolution (3 dB in azimuth and slant range) and peak-to-sidelobe ratio measurements in FGA images are comparable with reference results (within a few percent and tenths of a decibel), demonstrating the capacity to compensate for residual space variant range cell migration. The FGA algorithm is finally also benchmarked (visually) against the phase gradient algorithm to emphasize the advantage of a geometrical autofocus approach

Factorized Geometrical Autofocus for Synthetic Aperture Radar Processing

Synthetic Aperture Radar (SAR) imagery is a very useful resource for the civilian remote sensing community and for the military. This however presumes that images are focused. There are several possible sources for defocusing effects. For airborne SAR, motion measurement errors is the main cause. A defocused image may be compensated by way of autofocus, estimating and correcting erroneous phase components. Standard autofocus strategies are implemented as a separate stage after the image formation (stand-alone autofocus), neglecting the geometrical aspect. In addition, phase errors are usually assumed to be space invariant and confined to one dimension. The call for relaxed requirements on inertial measurement systems contradicts these criteria, as it may introduce space variant phase errors in two dimensions, i.e. residual space variant Range Cell Migration (RCM). This has motivated the development of a new autofocus approach. The technique, termed the Factorized Geometrical Autofocus (FGA) algorithm, is in principle a Fast Factorized Back-Projection (FFBP) realization with a number of adjustable (geometry) parameters for each factorization step. By altering the aperture in the time domain, it is possible to correct an arbitrary, inaccurate geometry. This in turn indicates that the FGA algorithm has the capacity to compensate for residual space variant RCM. In appended papers the performance of the algorithm is demonstrated for geometrically constrained autofocus problems. Results for simulated and real (Coherent All RAdio BAnd System II (CARABAS II)) Ultra WideBand (UWB) data sets are presented. Resolution and Peak to SideLobe Ratio (PSLR) values for (point/point-like) targets in FGA and reference images are similar within a few percents and tenths of a dB. As an example: the resolution of a trihedral reflector in a reference image and in an FGA image respectively, was measured to approximately 3.36 m/3.44 m in azimuth, and to 2.38 m/2.40 m in slant range; the PSLR was in addition measured to about 6.8 dB/6.6 dB. The advantage of a geometrical autofocus approach is clarified further by comparing the FGA algorithm to a standard strategy, in this case the Phase Gradient Algorithm (PGA)

An Efficient Solution to the Factorized Geometrical Autofocus Problem

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

Backprojection Autofocus for Synthetic Aperture Radar

In synthetic aperture radar (SAR), many adverse conditions may cause errors in the raw phase-history data. Autofocus methods are commonly used in SAR to mitigate the effects of these problems. Over the years, many types of autofocus have algorithms have been created, however, each has implicit assumptions restricting their use. The backprojection image formation algorithm places few restrictions on SAR imaging, thus it is desirable to have an autofocus algorithm that is similarly unconstrained. This paper presents a versatile autofocus method that is accordant with backprojection

A Generalized Phase Gradient Autofocus Algorithm

The phase gradient autofocus (PGA) algorithm has seen widespread use and success within the synthetic aperture radar (SAR) imaging community. However, its use and success has largely been limited to collection geometries where either the polar format algorithm (PFA) or range migration algorithm is suitable for SAR image formation. In this work, a generalized phase gradient autofocus (GPGA) algorithm is developed which is applicable with both the PFA and backprojection algorithm (BPA), thereby directly supporting a wide range of collection geometries and SAR imaging modalities. The GPGA algorithm preserves the four crucial signal processing steps comprising the PGA algorithm, while alleviating the constraint of using a single scatterer per range cut for phase error estimation which exists with the PGA algorithm. Moreover, the GPGA algorithm, whether using the PFA or BPA, yields an approximate maxi- mum marginal likelihood estimate (MMLE) of phase errors having marginalized over unknown complex-valued reflectivities of selected scatterers. Also, in this work a new approximate MMLE, termed the max-semidefinite relaxation (Max-SDR) phase estimator, is proposed for use with the GPGA algorithm. The Max-SDR phase estimator provides a phase error estimate with a worst-case approximation bound compared to the solution set of MMLEs (i.e., solution set to the non-deterministic polynomial- time hard (NP-hard) GPGA phase estimation problem). Moreover, in this work a specialized interior-point method is presented for more efficiently performing Max- SDR phase estimation by exploiting low-rank structure typically associated with the GPGA phase estimation problem. Lastly, simulation and experimental results produced by applying the GPGA algorithm with the PFA and BPA are presented

Autofocus and analysis of geometrical errors within the framework of fast factorized back-projection

This paper describes a Fast Factorized Back-Projection (FFBP) formulation that includes a fully integrated autofocus algorithm, i.e. the Factorized Geometrical Autofocus (FGA) algorithm. The base-two factorization is executed in a horizontal plane, using a Merging (M) and a Range History Preserving (RHP) transform. Six parameters are adopted for each sub-aperture pair, i.e. to establish the geometry stage-by-stage via triangles in 3-dimensional space. If the parameters are derived from navigation data, the algorithm is used as a conventional processing chain. If the parameters on the other hand are varied from a certain factorization step and forward, the algorithm is used as a joint image formation and autofocus strategy. By regulating the geometry at multiple resolution levels, challenging defocusing effects, e.g. residual space-variant Range Cell Migration (RCM), can be corrected. The new formulation also serves another important purpose, i.e. as a parameter characterization scheme. By using the FGA algorithm and its inverse, relations between two arbitrary geometries can be studied, in consequence, this makes it feasible to analyze how errors in navigation data, and topography, affect image focus. The versatility of the factorization procedure is demonstrated successfully on simulated Synthetic Aperture Radar (SAR) data. This is achieved by introducing different GPS/IMU errors and Focus Target Plane (FTP) deviations prior to processing. The characterization scheme is then employed to evaluate the sensitivity, to determine at what step the autofocus function should be activated, and to decide the number of necessary parameters at each step. Resulting FGA images are also compared to a reference image (processed without errors and autofocus) and to a defocused image (processed without autofocus), i.e. to validate the novel approach further

Autofocus and Back-Projection in Synthetic Aperture Radar Imaging.

Spotlight-mode Synthetic Aperture Radar (SAR) imaging has received considerable attention due to its ability to produce high-resolution images of scene reflectivity. One of the main challenges in successful image recovery is the problem of defocusing, which occurs due to inaccuracies in the estimated round-trip delays of the transmitted radar pulses. The problem is most widely studied for far-field imaging scenarios with a small range of look angles since the problem formulation can be significantly simplified under the assumptions of planar wavefronts and one-dimensional defocusing. In practice, however, these assumptions are frequently violated. MultiChannel Autofocus (MCA) is a subspace-based approach to the defocusing problem that was originally proposed for far-field imaging, with a small range of look angles. A key motivation behind MCA is the observation that there exists a low-return region within the recovered image, due to the weak illumination near the edges of the antenna footprint. The strength of the MCA formulation is that it can be easily extended to more realistic scenarios with polar-format data, spherical wavefronts, and arbitrary terrain, due to its flexible linear-algebraic framework. The main aim of this thesis is to devise a more broadly effective autofocus approach by adopting MCA to the aforementioned scenarios. By forming the solution space in a domain where the defocusing effect is truly one-dimensional, we show that drastically improved restorations can be obtained for applications with small to fairly wide ranges of look angles. When the terrain topography is known, we utilize the versatile backprojection-based imaging methods in the model formulations for MCA to accurately account for the underlying geometry. The proposed extended MCA shows reductions in RMSE of up to 50% when the underlying terrain is highly elevated. We also analyze the effects of the filtering step, the amount of wave curvature, the shape of the terrain, and the flight path of the radar, on the reconstructed image via backprojection. Finally, we discuss the selection of low-return constraints and the importance of using terrain elevation within MCA formulation.PHDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/135868/1/zzon_1.pd

Interferometric Synthetic Aperture Sonar Signal Processing for Autonomous Underwater Vehicles Operating Shallow Water

The goal of the research was to develop best practices for image signal processing method for InSAS systems for bathymetric height determination. Improvements over existing techniques comes from the fusion of Chirp-Scaling a phase preserving beamforming techniques to form a SAS image, an interferometric Vernier method to unwrap the phase; and confirming the direction of arrival with the MUltiple SIgnal Channel (MUSIC) estimation technique. The fusion of Chirp-Scaling, Vernier, and MUSIC lead to the stability in the bathymetric height measurement, and improvements in resolution. This method is computationally faster, and used less memory then existing techniques