Theory and Design of a Highly Compressed Dropped-Channel Polarimetric Synthetic Aperture Radar

Compressed sensing (CS) is a recent mathematical technique that leverages the sparsity in certain sets of data to solve an underdetermined system and recover a full set of data from a sub-Nyquist set of measurements of the data. Given the size and sparsity of the data, radar has been a natural choice to apply compressed sensing to, typically in the fast-time and slow-time domains. Polarimetric synthetic aperture radar (PolSAR) generates a particularly large amount of data for a given scene; however, the data tends to be sparse. Recently a technique was developed to recover a dropped PolSAR channel by leveraging antenna crosstalk information and using compressed sensing. In this dissertation, we build upon the initial concept of the dropped-channel PolSAR CS in three ways. First, we determine a metric which relates the measurement matrix to the l2 recovery error. The new metric is necessary given the deterministic nature of the measurement matrix. We then determine a range of antenna crosstalk required to recover a dropped PolSAR channel. Second, we propose a new antenna design that incorporates the relatively high levels of crosstalk required by a dropped-channel PolSAR system. Finally, we integrate fast- and slow-time compression schemes into the dropped-channel model in order to leverage sparsity in additional PolSAR domains and overall increase the compression ratio. The completion of these research tasks has allowed a more accurate description of a PolSAR system that compresses in fast-time, slow-time, and polarization; termed herein as highly compressed PolSAR. The description of a highly compressed PolSAR system is a big step towards the development of prototype hardware in the future

Convex Model-Based Synthetic Aperture Radar Processing

The use of radar often conjures up images of small blobs on a screen. But current synthetic aperture radar (SAR) systems are able to generate near-optical quality images with amazing benefits compared to optical sensors. These SAR sensors work in all weather conditions, day or night, and provide many advanced capabilities to detect and identify targets of interest. These amazing abilities have made SAR sensors a work-horse in remote sensing, and military applications. SAR sensors are ranging instruments that operate in a 3D environment, but unfortunately the results and interpretation of SAR images have traditionally been done in 2D. Three-dimensional SAR images could provide improved target detection and identification along with improved scene interpretability. As technology has increased, particularly regarding our ability to solve difficult optimization problems, the 3D SAR reconstruction problem has gathered more interest. This dissertation provides the SAR and mathematical background required to pose a SAR 3D reconstruction problem. The problem is posed in a way that allows prior knowledge about the target of interest to be integrated into the optimization problem when known. The developed model is demonstrated on simulated data initially in order to illustrate critical concepts in the development. Then once comprehension is achieved the processing is applied to actual SAR data. The 3D results are contrasted against the current gold- standard. The results are shown as 3D images demonstrating the improvement regarding scene interpretability that this approach provides

Efficiently Reasoning with Interval Constraints in Forward Search Planning

In this paper we present techniques for reasoning natively with quantitative/qualitative interval constraints in statebased PDDL planners. While these are considered important in modeling and solving problems in timeline based planners; reasoning with these in PDDL planners has seen relatively little attention, yet is a crucial step towards making PDDL planners applicable in real-world scenarios, such as space missions. Our main contribution is to extend the planner OPTIC to reason natively with Allen interval constraints. We show that our approach outperforms both MTP, the only PDDL planner capable of handling similar constraints and a compilation to PDDL 2.1, by an order of magnitude. We go on to present initial results indicating that our approach is competitive with a timeline based planner on a Mars rover domain, showing the potential of PDDL planners in this setting

Integration and mining of malaria molecular, functional and pharmacological data: how far are we from a chemogenomic knowledge space?

The organization and mining of malaria genomic and post-genomic data is highly motivated by the necessity to predict and characterize new biological targets and new drugs. Biological targets are sought in a biological space designed from the genomic data from Plasmodium falciparum, but using also the millions of genomic data from other species. Drug candidates are sought in a chemical space containing the millions of small molecules stored in public and private chemolibraries. Data management should therefore be as reliable and versatile as possible. In this context, we examined five aspects of the organization and mining of malaria genomic and post-genomic data: 1) the comparison of protein sequences including compositionally atypical malaria sequences, 2) the high throughput reconstruction of molecular phylogenies, 3) the representation of biological processes particularly metabolic pathways, 4) the versatile methods to integrate genomic data, biological representations and functional profiling obtained from X-omic experiments after drug treatments and 5) the determination and prediction of protein structures and their molecular docking with drug candidate structures. Progresses toward a grid-enabled chemogenomic knowledge space are discussed.Comment: 43 pages, 4 figures, to appear in Malaria Journa

Aha? Is Creativity Possible in Legal Problem Solving and Teachable in Legal Education?

This article continues and expands on my earlier project of seeking to describe how legal negotiation should be understood conceptually and undertaken behaviorally to produce better solutions to legal problems. As structured problem solving requires interests, needs and objectives identification, so too must creative solution seeking have its structure and elements in order to be effectively taught. Because research and teaching about creativity and how we think has expanded greatly since modern legal negotiation theory has been developed, it is now especially appropriate to examine how we might harness this new learning to how we might examine and teach legal creativity in the context of legal negotiation and problem solving. This article explores both the cognitive and behavioral dimensions of legal creativity and offers suggestions for how it can be taught more effectively in legal education, both within the more narrow curricula of negotiation courses and more generally throughout legal education

Fusion of LIDAR with stereo camera data - an assessment

This thesis explores data fusion of LIDAR (laser range-finding) with stereo matching, with a particular emphasis on close-range industrial 3D imaging. Recently there has been interest in improving the robustness of stereo matching using data fusion with active range data. These range data have typically been acquired using time of flight cameras (ToFCs), however ToFCs offer poor spatial resolution and are noisy. Comparatively little work has been performed using LIDAR. It is argued that stereo and LIDAR are complementary and there are numerous advantages to integrating LIDAR into stereo systems. For instance, camera calibration is a necessary prerequisite for stereo 3D reconstruction, but the process is often tedious and requires precise calibration targets. It is shown that a visible-beam LIDAR enables automatic, accurate (sub-pixel) extrinsic and intrinsic camera calibration without any explicit targets. Two methods for using LIDAR to assist dense disparity maps from featureless scenes were investigated. The first involved using a LIDAR to provide high-confidence seed points for a region growing stereo matching algorithm. It is shown that these seed points allow dense matching in scenes which fail to match using stereo alone. Secondly, LIDAR was used to provide artificial texture in featureless image regions. Texture was generated by combining real or simulated images of every point the laser hits to form a pseudo-random pattern. Machine learning was used to determine the image regions that are most likely to be stereo- matched, reducing the number of LIDAR points required. Results are compared to competing techniques such as laser speckle, data projection and diffractive optical elements

Health + Efficiency House: A Take on the 50x50 Glass House

Under the guidance of Professor Edmond Saliklis and Professor Meredith Sattler, four Architectural Engineering students joined forces with three Architecture students from both Cal Poly and Vilnius Technical University in Lithuania. The portfolio exemplifies a complete reimagination of Mies van der Rohe and Myron Goldsmith\u27s 50x50 Glass House as if it were designed today in Palm Springs, CA. The work completed in this interdisciplinary studio includes historical context, abstract creation, architectural and structural design all relating back to the Glass House

Advanced signal processing solutions for ATR and spectrum sharing in distributed radar systems

Previously held under moratorium from 11 September 2017 until 16 February 2022This Thesis presents advanced signal processing solutions for Automatic Target Recognition (ATR) operations and for spectrum sharing in distributed radar systems. Two Synthetic Aperture Radar (SAR) ATR algorithms are described for full- and single-polarimetric images, and tested on the GOTCHA and the MSTAR datasets. The first one exploits the Krogager polarimetric decomposition in order to enhance peculiar scattering mechanisms from manmade targets, used in combination with the pseudo-Zernike image moments. The second algorithm employs the Krawtchouk image moments, that, being discrete defined, provide better representations of targets’ details. The proposed image moments based framework can be extended to the availability of several images from multiple sensors through the implementation of a simple fusion rule. A model-based micro-Doppler algorithm is developed for the identification of helicopters. The approach relies on the proposed sparse representation of the signal scattered from the helicopter’s rotor and received by the radar. Such a sparse representation is obtained through the application of a greedy sparse recovery framework, with the goal of estimating the number, the length and the rotation speed of the blades, parameters that are peculiar for each helicopter’s model. The algorithm is extended to deal with the identification of multiple helicopters flying in formation that cannot be resolved in another domain. Moreover, a fusion rule is presented to integrate the results of the identification performed from several sensors in a distributed radar system. Tests performed both on simulated signals and on real signals acquired from a scale model of a helicopter, confirm the validity of the algorithm. Finally, a waveform design framework for joint radar-communication systems is presented. The waveform is composed by quasi-orthogonal chirp sub-carriers generated through the Fractional Fourier Transform (FrFT), with the aim of preserving the radar performance of a typical Linear Frequency Modulated (LFM) pulse while embedding data to be sent to a cooperative system. Techniques aimed at optimise the design parameters and mitigate the Inter-Carrier Interference (ICI) caused by the quasiorthogonality of the chirp sub-carriers are also described. The FrFT based waveform is extensively tested and compared with Orthogonal Frequency Division Multiplexing (OFDM) and LFM waveforms, in order to assess both its radar and communication performance.This Thesis presents advanced signal processing solutions for Automatic Target Recognition (ATR) operations and for spectrum sharing in distributed radar systems. Two Synthetic Aperture Radar (SAR) ATR algorithms are described for full- and single-polarimetric images, and tested on the GOTCHA and the MSTAR datasets. The first one exploits the Krogager polarimetric decomposition in order to enhance peculiar scattering mechanisms from manmade targets, used in combination with the pseudo-Zernike image moments. The second algorithm employs the Krawtchouk image moments, that, being discrete defined, provide better representations of targets’ details. The proposed image moments based framework can be extended to the availability of several images from multiple sensors through the implementation of a simple fusion rule. A model-based micro-Doppler algorithm is developed for the identification of helicopters. The approach relies on the proposed sparse representation of the signal scattered from the helicopter’s rotor and received by the radar. Such a sparse representation is obtained through the application of a greedy sparse recovery framework, with the goal of estimating the number, the length and the rotation speed of the blades, parameters that are peculiar for each helicopter’s model. The algorithm is extended to deal with the identification of multiple helicopters flying in formation that cannot be resolved in another domain. Moreover, a fusion rule is presented to integrate the results of the identification performed from several sensors in a distributed radar system. Tests performed both on simulated signals and on real signals acquired from a scale model of a helicopter, confirm the validity of the algorithm. Finally, a waveform design framework for joint radar-communication systems is presented. The waveform is composed by quasi-orthogonal chirp sub-carriers generated through the Fractional Fourier Transform (FrFT), with the aim of preserving the radar performance of a typical Linear Frequency Modulated (LFM) pulse while embedding data to be sent to a cooperative system. Techniques aimed at optimise the design parameters and mitigate the Inter-Carrier Interference (ICI) caused by the quasiorthogonality of the chirp sub-carriers are also described. The FrFT based waveform is extensively tested and compared with Orthogonal Frequency Division Multiplexing (OFDM) and LFM waveforms, in order to assess both its radar and communication performance

What\u27s Left to Remedy Wage Theft? How Arbitration Mandates that Bar Class Actions Impact Low-Wage Workers

For low-wage workers who suffer “wage theft” – employers illegally withholding portions of their wages – the dollars missing from their paychecks violate existing law and significantly impact the well-being of individuals, families, and communities. Despite this dire societal problem, the Supreme Court continues “closing the courtroom doors” in two ways: allowing employers to force workers out of court and into private arbitration; and prohibiting aggregate claims. Such trends, in combination, silence wage theft, leaving many claims unheard while unscrupulous employers gain direct advantage. This Article explains how various procedural rulings have combined to prevent meaningful redress for wage theft. Because of high transaction costs and relatively low potential damages, low-wage workers are likely to recover their lost wages only if they band together with similarly-situated workers in an aggregate lawsuit. However, collective action is under attack: AT&T Mobility v. Concepcion, the latest Supreme Court case to approve of mandatory arbitration clauses, allowed a corporation to impose “agreements” mandating individual arbitration and barring class actions. This Article brings new insights into the widening blind spot the Supreme Court has for the impact procedural rules have on the substantive rights of low-wage workers. Moreover, it touches upon a greater trend in American jurisprudence of courts shutting out plaintiffs, especially those unlikely to afford legal representation. By drawing attention to the unjust effects of facially neutral rules on low-wage workers, this Article contributes to the national conversation on how Supreme Court precedent limiting judicial access affects society’s most vulnerable