Compressive sensing for 3D microwave imaging systems

Compressed sensing (CS) image reconstruction techniques are developed and experimentally implemented for wideband microwave synthetic aperture radar (SAR) imaging systems with applications to nondestructive testing and evaluation. These techniques significantly reduce the number of spatial measurement points and, consequently, the acquisition time by sampling at a level lower than the Nyquist-Shannon rate. Benefiting from a reduced number of samples, this work successfully implemented two scanning procedures: the nonuniform raster and the optimum path. Three CS reconstruction approaches are also proposed for the wideband microwave SAR-based imaging systems. The first approach reconstructs a full-set of raw data from undersampled measurements via L1-norm optimization and consequently applies 3D forward SAR on the reconstructed raw data. The second proposed approach employs forward SAR and reverse SAR (R-SAR) transforms in each L1-norm optimization iteration reconstructing images directly. This dissertation proposes a simple, elegant truncation repair method to combat the truncation error which is a critical obstacle to the convergence of the CS iterative algorithm. The third proposed CS reconstruction algorithm is the adaptive basis selection (ABS) compressed sensing. Rather than a fixed sparsifying basis, the proposed ABS method adaptively selects the best basis from a set of bases in each iteration of the L1-norm optimization according to a proposed decision metric that is derived from the sparsity of the image and the coherence between the measurement and sparsifying matrices. The results of several experiments indicate that the proposed algorithms recover 2D and 3D SAR images with only 20% of the spatial points and reduce the acquisition time by up to 66% of that of conventional methods while maintaining or improving the quality of the SAR images --Abstract, page iv

Non-Negative Group Sparsity with Subspace Note Modelling for Polyphonic Transcription

This work was supported by EPSRC Platform Grant EPSRC EP/K009559/1, EPSRC Grant EP/L027119/1, and EPSRC Grant EP/J010375/1

Compressed Sensing in Resource-Constrained Environments: From Sensing Mechanism Design to Recovery Algorithms

Compressed Sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for reconstruction. It is promising that CS can be utilized in environments where the signal acquisition process is extremely difficult or costly, e.g., a resource-constrained environment like the smartphone platform, or a band-limited environment like visual sensor network (VSNs). There are several challenges to perform sensing due to the characteristic of these platforms, including, for example, needing active user involvement, computational and storage limitations and lower transmission capabilities. This dissertation focuses on the study of CS in resource-constrained environments. First, we try to solve the problem on how to design sensing mechanisms that could better adapt to the resource-limited smartphone platform. We propose the compressed phone sensing (CPS) framework where two challenging issues are studied, the energy drainage issue due to continuous sensing which may impede the normal functionality of the smartphones and the requirement of active user inputs for data collection that may place a high burden on the user. Second, we propose a CS reconstruction algorithm to be used in VSNs for recovery of frames/images. An efficient algorithm, NonLocal Douglas-Rachford (NLDR), is developed. NLDR takes advantage of self-similarity in images using nonlocal means (NL) filtering. We further formulate the nonlocal estimation as the low-rank matrix approximation problem and solve the constrained optimization problem using Douglas-Rachford splitting method. Third, we extend the NLDR algorithm to surveillance video processing in VSNs and propose recursive Low-rank and Sparse estimation through Douglas-Rachford splitting (rLSDR) method for recovery of the video frame into a low-rank background component and sparse component that corresponds to the moving object. The spatial and temporal low-rank features of the video frame, e.g., the nonlocal similar patches within the single video frame and the low-rank background component residing in multiple frames, are successfully exploited