Optimum graph cuts for pruning binary partition trees of polarimetric SAR images

This paper investigates several optimum graph-cut techniques for pruning binary partition trees (BPTs) and their usefulness for the low-level processing of polarimetric synthetic aperture radar (PolSAR) images. BPTs group pixels to form homogeneous regions, which are hierarchically structured by inclusion in a binary tree. They provide multiple resolutions of description and easy access to subsets of regions. Once constructed, BPTs can be used for a large number of applications. Many of these applications consist in populating the tree with a specific feature and in applying a graph cut called pruning to extract a partition of the space. In this paper, different pruning examples involving the optimization of a global criterion are discussed and analyzed in the context of PolSAR images for segmentation. Through the objective evaluation of the resulting partitions by means of precision-and-recall-for-boundaries curves, the best pruning technique is identified, and the influence of the tree construction on the performances is assessed.Peer ReviewedPostprint (author's final draft

Learning a Dilated Residual Network for SAR Image Despeckling

In this paper, to break the limit of the traditional linear models for synthetic aperture radar (SAR) image despeckling, we propose a novel deep learning approach by learning a non-linear end-to-end mapping between the noisy and clean SAR images with a dilated residual network (SAR-DRN). SAR-DRN is based on dilated convolutions, which can both enlarge the receptive field and maintain the filter size and layer depth with a lightweight structure. In addition, skip connections and residual learning strategy are added to the despeckling model to maintain the image details and reduce the vanishing gradient problem. Compared with the traditional despeckling methods, the proposed method shows superior performance over the state-of-the-art methods on both quantitative and visual assessments, especially for strong speckle noise.Comment: 18 pages, 13 figures, 7 table

Accurate Despeckling and Estimation of Polarimetric Features by Means of a Spatial Decorrelation of the Noise in Complex PolSAR Data

In this work, we extended a procedure for the spatial decorrelation of fully-developed speckle, originally developed for single-polarization SAR data, to fully-polarimetric SAR data. The spatial correlation of the noise depends on the tapering window in the Fourier domain used by the SAR processor to avoid defocusing of targets caused by Gibbs effects. Since each polarimetric channel is focused independently of the others, the noise-whitening procedure can be performed applying the decorrelation stage to each channel separately. Equivalently, the noise-whitening stage is applied to each element of the scattering matrix before any multilooking operation, either coherent or not, is performed. In order to evaluate the impact of a spatial decorrelation of the noise on the performance of polarimetric despeckling filters, we make use of simulated PolSAR data, having user-defined polarimetric features. We optionally introduce a spatial correlation of the noise in the simulated complex data by means of a 2D separable Hamming window in the Fourier domain. Then, we remove such a correlation by using the whitening procedure and compare the accuracy of both despeckling and polarimetric features estimation for the three following cases: uncorrelated, correlated, and decorrelated images. Simulation results showed a steady improvement of performance scores, most notably the equivalent number of looks (ENL), which increased after decorrelation and closely attained the value of the uncorrelated case. Besides ENL, the benefits of the noise decorrelation hold also for polarimetric features, whose estimation accuracy is diminished by the correlation. Also, the trends of simulations were confirmed by qualitative results of experiments carried out on a true Radarsat-2 image

Potential of nonlocally filtered pursuit monostatic TanDEM-X data for coastline detection

This article investigates the potential of nonlocally filtered pursuit monostatic TanDEM-X data for coastline detection in comparison to conventional TanDEM-X data, i.e. image pairs acquired in repeat-pass or bistatic mode. For this task, an unsupervised coastline detection procedure based on scale-space representations and K-medians clustering as well as morphological image post-processing is proposed. Since this procedure exploits a clear discriminability of "dark" and "bright" appearances of water and land surfaces, respectively, in both SAR amplitude and coherence imagery, TanDEM-X InSAR data acquired in pursuit monostatic mode is expected to provide a promising benefit. In addition, we investigate the benefit introduced by a utilization of a non-local InSAR filter for amplitude denoising and coherence estimation instead of a conventional box-car filter. Experiments carried out on real TanDEM-X pursuit monostatic data confirm our expectations and illustrate the advantage of the employed data configuration over conventional TanDEM-X products for automatic coastline detection