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

Computational polarimetric microwave imaging

We propose a polarimetric microwave imaging technique that exploits recent advances in computational imaging. We utilize a frequency-diverse cavity-backed metasurface, allowing us to demonstrate high-resolution polarimetric imaging using a single transceiver and frequency sweep over the operational microwave bandwidth. The frequency-diverse metasurface imager greatly simplifies the system architecture compared with active arrays and other conventional microwave imaging approaches. We further develop the theoretical framework for computational polarimetric imaging and validate the approach experimentally using a multi-modal leaky cavity. The scalar approximation for the interaction between the radiated waves and the target---often applied in microwave computational imaging schemes---is thus extended to retrieve the susceptibility tensors, and hence providing additional information about the targets. Computational polarimetry has relevance for existing systems in the field that extract polarimetric imagery, and particular for ground observation. A growing number of short-range microwave imaging applications can also notably benefit from computational polarimetry, particularly for imaging objects that are difficult to reconstruct when assuming scalar estimations.Comment: 17 pages, 15 figure

Speckle noise reduction in PolSAR images with binary partition tree

In some remote sensing applications such as PolSAR (Polarimetric Synthetic Aperture Radar), the use of Binary Partition Trees (BPTs) for Speckle Noise filtering schemes is currently gaining interest. In this thesis, a new approach using this representation is investigated: branch filtering. This approach consists in searching for each leaf its ancestors and selecting the one that best represents it, that is, the one that yields the lower error. A potentiality assessment is done to evaluate the margin of improvement that new techniques based on this approach may provide and describe the basic specifications of the algorithms based on it. After that, different new techniques are developed, analysed and compared against the State-of-the-Art. We point out the main strengths and weaknesses of each technique. Our main goal is to understand the behaviour of the filtered data along the BPT branch and interpret how this information can be used in the future for speckle noise reduction in PolSAR images. Finally some conclusions are drawn and some possible future lines of work are exposed and commented.En algunas aplicaciones de teledetección como Polarimetric SAR, el uso de Árboles de Decisión Binarios está ganando interés. En esta tésis se incorpora un nuevo método que usa esta representación: filtraje por ramas. Este método consiste en buscar para cada hoja sus antepasados y seleccionar el mejor nodo como el que de el menor error. Se lleva a cabo un análisis de potencialidad para evaluar el margen de mejora que nuevas técnicas basadas en este método podrían proporcionar y se describen los principios basicos de los algoritmos que se basan en él. Tras esto, se desenvolupan distintas técnicas y se comparan con las del estado del arte. De cada técnica, destacamos sus principales fortalezas y debilidades. Nuestro objetivo principal es entender el comportamiento de los datos filtrados a lo largo de la rama del BPT e interpretar como podemos usar esta información en un futuro para la reducción de ruido especular (speckle) en imágenes PolSAR. Por último, se exponen algunas conclusiones y se presentan y comentan algunas posibles líneas de trabajo futuras.En algunes aplicacions de teledetecció com Polarimetric SAR, l'ús d'Arbres de Particio Binària està guanyant interès. En aquesta tesi, s'investiga un nou mètode que utilitza aquesta representació: filtratge per branques. Aquest mètode consisteix en buscar per cada fulla els seus avantpassats i seleccionar el millor node, és a dir, el que doni un error menor. Es duu a terme un analisi de potencialitat per evaluar el marge de millora que noves tècniques basades en aquest mètode podrien aportar i es descriuen els principis bàsics dels algorismes que s'hi basen. Després, es desenvolupen diverses tècniques i es comparen amb les de l'estat de l'art. Destaquem les principals fortalesses i feblesses de cada tècnica. El nostre principal objectiu és entendre el comportament de les dades filtrades al llarg de la branca del BPT i interpretar com podem utilitzar aquesta informació en un futur per la reducció del soroll especular (speckle) en imatges PolSAR. Per últim s'exposen algunes conclusions i es proposen i comenten possibles noves línies de treball

Unsupervised classification of multilook polarimetric SAR data using spatially variant wishart mixture model with double constraints

This paper addresses the unsupervised classification problems for multilook Polarimetric synthetic aperture radar (PolSAR) images by proposing a patch-level spatially variant Wishart mixture model (SVWMM) with double constraints. We construct this model by jointly modeling the pixels in a patch (rather than an individual pixel) so as to effectively capture the local correlation in the PolSAR images. More importantly, a responsibility parameter is introduced to the proposed model, providing not only the possibility to represent the importance of different pixels within a patch but also the additional flexibility for incorporating the spatial information. As such, double constraints are further imposed by simultaneously utilizing the similarities of the neighboring pixels, respectively, defined on two different parameter spaces (i.e., the hyperparameter in the posterior distribution of mixing coefficients and the responsibility parameter). Furthermore, the variational inference algorithm is developed to achieve effective learning of the proposed SVWMM with the closed-form updates, facilitating the automatic determination of the cluster number. Experimental results on several PolSAR data sets from both airborne and spaceborne sensors demonstrate that the proposed method is effective and it enables better performances on unsupervised classification than the conventional methods

Adaptive MIMO Radar for Target Detection, Estimation, and Tracking

We develop and analyze signal processing algorithms to detect, estimate, and track targets using multiple-input multiple-output: MIMO) radar systems. MIMO radar systems have attracted much attention in the recent past due to the additional degrees of freedom they offer. They are commonly used in two different antenna configurations: widely-separated: distributed) and colocated. Distributed MIMO radar exploits spatial diversity by utilizing multiple uncorrelated looks at the target. Colocated MIMO radar systems offer performance improvement by exploiting waveform diversity. Each antenna has the freedom to transmit a waveform that is different from the waveforms of the other transmitters. First, we propose a radar system that combines the advantages of distributed MIMO radar and fully polarimetric radar. We develop the signal model for this system and analyze the performance of the optimal Neyman-Pearson detector by obtaining approximate expressions for the probabilities of detection and false alarm. Using these expressions, we adaptively design the transmit waveform polarizations that optimize the target detection performance. Conventional radar design approaches do not consider the goal of the target itself, which always tries to reduce its detectability. We propose to incorporate this knowledge about the goal of the target while solving the polarimetric MIMO radar design problem by formulating it as a game between the target and the radar design engineer. Unlike conventional methods, this game-theoretic design does not require target parameter estimation from large amounts of training data. Our approach is generic and can be applied to other radar design problems also. Next, we propose a distributed MIMO radar system that employs monopulse processing, and develop an algorithm for tracking a moving target using this system. We electronically generate two beams at each receiver and use them for computing the local estimates. Later, we efficiently combine the information present in these local estimates, using the instantaneous signal energies at each receiver to keep track of the target. Finally, we develop multiple-target estimation algorithms for both distributed and colocated MIMO radar by exploiting the inherent sparsity on the delay-Doppler plane. We propose a new performance metric that naturally fits into this multiple target scenario and develop an adaptive optimal energy allocation mechanism. We employ compressive sensing to perform accurate estimation from far fewer samples than the Nyquist rate. For colocated MIMO radar, we transmit frequency-hopping codes to exploit the frequency diversity. We derive an analytical expression for the block coherence measure of the dictionary matrix and design an optimal code matrix using this expression. Additionally, we also transmit ultra wideband noise waveforms that improve the system resolution and provide a low probability of intercept: LPI)

Unsupervised Classification of Polarimetric SAR Images via Riemannian Sparse Coding

Unsupervised classification plays an important role in understanding polarimetric synthetic aperture radar (PolSAR) images. One of the typical representations of PolSAR data is in the form of Hermitian positive definite (HPD) covariance matrices. Most algorithms for unsupervised classification using this representation either use statistical distribution models or adopt polarimetric target decompositions. In this paper, we propose an unsupervised classification method by introducing a sparsity-based similarity measure on HPD matrices. Specifically, we first use a novel Riemannian sparse coding scheme for representing each HPD covariance matrix as sparse linear combinations of other HPD matrices, where the sparse reconstruction loss is defined by the Riemannian geodesic distance between HPD matrices. The coefficient vectors generated by this step reflect the neighborhood structure of HPD matrices embedded in the Euclidean space and hence can be used to define a similarity measure. We apply the scheme for PolSAR data, in which we first oversegment the images into superpixels, followed by representing each superpixel by an HPD matrix. These HPD matrices are then sparse coded, and the resulting sparse coefficient vectors are then clustered by spectral clustering using the neighborhood matrix generated by our similarity measure. The experimental results on different fully PolSAR images demonstrate the superior performance of the proposed classification approach against the state-of-the-art approachesThis work was supported in part by the National Natural Science Foundation of China under Grant 61331016 and Grant 61271401 and in part by the National Key Basic Research and Development Program of China under Contract 2013CB733404. The work of A. Cherian was supported by the Australian Research Council Centre of Excellence for Robotic Vision under Project CE140100016.

DVB-S based passive polarimetric ISAR – methods and experimental validation

In this work, we focus on passive polarimetric ISAR for ship target imaging using DVB-S signals of opportunity. A first goal of the research is to investigate if, within the challenging passive environment, different scattering mechanisms, belonging to distinct parts of the imaged target, can be separated in the polarimetric domain. Furthermore, a second goal is at verifying if polarimetric diversity could enable the formation of ISAR products with enhanced quality with respect to the single channel case, particularly in terms of better reconstruction of the target shape. To this purpose, a dedicated trial has been conducted along the river Rhine in Germany by means of an experimental DVB-S based system developed at Fraunhofer FHR and considering a ferry as cooperative target. To avoid inaccuracies due to data-driven motion compensation procedures and to fairly interpret the polarimetric results, we processed the data by means of a known-motion back-projection algorithm obtaining ISAR images at each polarimetric channel. Then, different approaches in the polarimetric domain have been introduced. The first one is based on the well-known Pauli Decomposition. The others can be divided in two main groups: (i) techniques aimed at separating the different backscattering mechanisms, and (ii) image domain techniques to fuse the polarimetric information in a single ISAR image with enhanced quality. The different considered techniques have been applied to several data sets with distinct bistatic geometries. The obtained results clearly demonstrate the potentialities of polarimetric diversity that could be fruitfully exploited for classification purposes