This work studies the problem of reconstructing a signal from measurements obtained by a sensing system, where the measurement model that characterizes the sensing system may be linear or nonlinear.
We first consider linear measurement models. In particular, we study the popular low-complexity iterative linear inverse algorithm, approximate message passing (AMP), in a probabilistic setting, meaning that the signal is assumed to be generated from some probability distribution, though the distribution may be unknown to the algorithm. The existing rigorous performance analysis of AMP only allows using a separable or block-wise separable estimation function at each iteration of AMP, and therefore cannot capture sophisticated dependency structures in the signal. This work studies the case when the signal has a Markov random field (MRF) prior, which is commonly used in image applications. We provide rigorous performance analysis of AMP with a class of non-separable sliding-window estimation functions, which is suitable to capture local dependencies in an MRF prior.
In addition, we design AMP-based algorithms with non-separable estimation functions for hyperspectral imaging and universal compressed sensing (imaging), and compare our algorithms to state-of-the-art algorithms with extensive numerical examples. For fast computation in largescale problems, we study a multiprocessor implementation of AMP and provide its performance analysis. Additionally, we propose a two-part reconstruction scheme where Part 1 detects zero-valued entries in the signal using a simple and fast algorithm, and Part 2 solves for the remaining entries using a high-fidelity algorithm. Such two-part scheme naturally leads to a trade-off analysis of speed and reconstruction quality.
Finally, we study diffractive imaging, where the electric permittivity distribution of an object is reconstructed from scattered wave measurements. When the object is strongly scattering, a nonlinear measurement model is needed to characterize the relationship between the permittivity and the scattered wave. We propose an inverse method for nonlinear diffractive imaging. Our method is based on a nonconvex optimization formulation. The nonconvex solver used in the proposed method is our new variant of the popular convex solver, fast iterative shrinkage/ thresholding algorithm (FISTA). We provide a fast and memory-efficient implementation of our new FISTA variant and prove that it reliably converges for our nonconvex optimization problem. Hence, our new FISTA variance may be of interest on its own as a general nonconvex solver. In addition, we systematically compare our method to state-of-the-art methods on simulated as well as experimentally measured data in both 2D and 3D (vectorial field) settings.
|School:||North Carolina State University|
|School Location:||United States -- North Carolina|
|Source:||DAI-B 79/07(E), Dissertation Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be