Terrain analysis using radar shape-from-shading

This paper develops a maximum a posteriori (MAP) probability estimation framework for shape-from-shading (SFS) from synthetic aperture radar (SAR) images. The aim is to use this method to reconstruct surface topography from a single radar image of relatively complex terrain. Our MAP framework makes explicit how the recovery of local surface orientation depends on the whereabouts of terrain edge features and the available radar reflectance information. To apply the resulting process to real world radar data, we require probabilistic models for the appearance of terrain features and the relationship between the orientation of surface normals and the radar reflectance. We show that the SAR data can be modeled using a Rayleigh-Bessel distribution and use this distribution to develop a maximum likelihood algorithm for detecting and labeling terrain edge features. Moreover, we show how robust statistics can be used to estimate the characteristic parameters of this distribution. We also develop an empirical model for the SAR reflectance function. Using the reflectance model, we perform Lambertian correction so that a conventional SFS algorithm can be applied to the radar data. The initial surface normal direction is constrained to point in the direction of the nearest ridge or ravine feature. Each surface normal must fall within a conical envelope whose axis is in the direction of the radar illuminant. The extent of the envelope depends on the corrected radar reflectance and the variance of the radar signal statistics. We explore various ways of smoothing the field of surface normals using robust statistics. Finally, we show how to reconstruct the terrain surface from the smoothed field of surface normal vectors. The proposed algorithm is applied to various SAR data sets containing relatively complex terrain structure

2D Phase Unwrapping via Graph Cuts

Phase imaging technologies such as interferometric synthetic aperture radar (InSAR), magnetic resonance imaging (MRI), or optical interferometry, are nowadays widespread and with an increasing usage. The so-called phase unwrapping, which consists in the in- ference of the absolute phase from the modulo-2π phase, is a critical step in many of their processing chains, yet still one of its most challenging problems. We introduce an en- ergy minimization based approach to 2D phase unwrapping. In this approach we address the problem by adopting a Bayesian point of view and a Markov random field (MRF) to model the phase. The maximum a posteriori estimation of the absolute phase gives rise to an integer optimization problem, for which we introduce a family of efficient algo- rithms based on existing graph cuts techniques. We term our approach and algorithms PUMA, for Phase Unwrapping MAx flow. As long as the prior potential of the MRF is convex, PUMA guarantees an exact global solution. In particular it solves exactly all the minimum L p norm (p ≥ 1) phase unwrapping problems, unifying in that sense, a set of existing independent algorithms. For non convex potentials we introduce a version of PUMA that, while yielding only approximate solutions, gives very useful phase unwrap- ping results. The main characteristic of the introduced solutions is the ability to blindly preserve discontinuities. Extending the previous versions of PUMA, we tackle denoising by exploiting a multi-precision idea, which allows us to use the same rationale both for phase unwrapping and denoising. Finally, the last presented version of PUMA uses a frequency diversity concept to unwrap phase images having large phase rates. A representative set of experiences illustrates the performance of PUMA

Piecewise parameterised Markov random fields for semi-local Hurst estimation

Semi-local Hurst estimation is considered by incorporating a Markov random field model to constrain a wavelet-based pointwise Hurst estimator. This results in an estimator which is able to exploit the spatial regularities of a piecewise parametric varying Hurst parameter. The pointwise estimates are jointly inferred along with the parametric form of the underlying Hurst function which characterises how the Hurst parameter varies deterministically over the spatial support of the data. Unlike recent Hurst regularistion methods, the proposed approach is flexible in that arbitrary parametric forms can be considered and is extensible in as much as the associated gradient descent algorithm can accommodate a broad class of distributional assumptions without any significant modifications. The potential benefits of the approach are illustrated with simulations of various first-order polynomial forms

Sublabel-Accurate Relaxation of Nonconvex Energies

We propose a novel spatially continuous framework for convex relaxations based on functional lifting. Our method can be interpreted as a sublabel-accurate solution to multilabel problems. We show that previously proposed functional lifting methods optimize an energy which is linear between two labels and hence require (often infinitely) many labels for a faithful approximation. In contrast, the proposed formulation is based on a piecewise convex approximation and therefore needs far fewer labels. In comparison to recent MRF-based approaches, our method is formulated in a spatially continuous setting and shows less grid bias. Moreover, in a local sense, our formulation is the tightest possible convex relaxation. It is easy to implement and allows an efficient primal-dual optimization on GPUs. We show the effectiveness of our approach on several computer vision problems

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

Mixture Regression for Sea Ice Segmentation

The classification of sea ice in SAR imagery is complicated by statistical nonstationarity. Incidence angle effects, heterogeneous ice conditions and other confounding variables contribute to spatial and temporal variability in the appearance of sea ice. I explore a family of models called mixture regressions which address this issue by endowing mixture distributions with class-dependent trends. I introduce mixture regression as a general technique for unsupervised clustering on nonstationary datasets and propose techniques to improve its robustness in the presence of noise and outliers. I then develop region-based mixture regression models for sea ice segmentation, focusing on the modeling of SAR backscatter intensities under the influence of incidence angle effects. Experiments are conducted on various extensions to the approach including the use of robust estimation to improve model convergence, the incorporation of Markov random fields for contextual smoothing, and the combination of mixture regression with supervised classifiers. Performance is evaluated for ice-water classification on a set of dual-polarized RADARSAT-2 images taken over the Beaufort Sea. Results show that mixture regression achieves accuracy of 92.8% in the unsupervised setting and 97.5% when integrated with a supervised convolutional neural network. This work improves on existing techniques for sea ice segmentation which enable operational ice mapping and environmental monitoring applications. The presented techniques may also be useful for the segmentation of nonstationary images obtained from other remote sensing techniques or in other domains such as medical imaging