Matching Items (2)
Filtering by

Clear all filters

153915-Thumbnail Image.png

Observability methods in sensor scheduling

Description
Modern measurement schemes for linear dynamical systems are typically designed so that different sensors can be scheduled to be used at each time step. To determine which sensors to use, various metrics have been suggested. One possible such metric is the observability of the system. Observability is a binary condition…

Modern measurement schemes for linear dynamical systems are typically designed so that different sensors can be scheduled to be used at each time step. To determine which sensors to use, various metrics have been suggested. One possible such metric is the observability of the system. Observability is a binary condition determining whether a finite number of measurements suffice to recover the initial state. However to employ observability for sensor scheduling, the binary definition needs to be expanded so that one can measure how observable a system is with a particular measurement scheme, i.e. one needs a metric of observability. Most methods utilizing an observability metric are about sensor selection and not for sensor scheduling. In this dissertation we present a new approach to utilize the observability for sensor scheduling by employing the condition number of the observability matrix as the metric and using column subset selection to create an algorithm to choose which sensors to use at each time step. To this end we use a rank revealing QR factorization algorithm to select sensors. Several numerical experiments are used to demonstrate the performance of the proposed scheme.
ContributorsIlkturk, Utku (Author) / Gelb, Anne (Thesis advisor) / Platte, Rodrigo (Thesis advisor) / Cochran, Douglas (Committee member) / Renaut, Rosemary (Committee member) / Armbruster, Dieter (Committee member) / Arizona State University (Publisher)
Created2015
137504-Thumbnail Image.png

Edge Informed Fourier Reconstruction from Non-Uniform Spectral Data

Description
The reconstruction of piecewise smooth functions from non-uniform Fourier data arises in sensing applications such as magnetic resonance imaging (MRI). This thesis presents a new polynomial based resampling method (PRM) for 1-dimensional problems which uses edge information to recover the Fourier transform at its integer coefficients, thereby enabling the use…

The reconstruction of piecewise smooth functions from non-uniform Fourier data arises in sensing applications such as magnetic resonance imaging (MRI). This thesis presents a new polynomial based resampling method (PRM) for 1-dimensional problems which uses edge information to recover the Fourier transform at its integer coefficients, thereby enabling the use of the inverse fast Fourier transform algorithm. By minimizing the error of the PRM approximation at the sampled Fourier modes, the PRM can also be used to improve on initial edge location estimates. Numerical examples show that using the PRM to improve on initial edge location estimates and then taking of the PRM approximation of the integer frequency Fourier coefficients is a viable way to reconstruct the underlying function in one dimension. In particular, the PRM is shown to converge more quickly and to be more robust than current resampling techniques used in MRI, and is particularly amenable to highly irregular sampling patterns.
ContributorsGutierrez, Alexander Jay (Author) / Platte, Rodrigo (Thesis director) / Gelb, Anne (Committee member) / Viswanathan, Adityavikram (Committee member) / Barrett, The Honors College (Contributor) / School of International Letters and Cultures (Contributor) / School of Mathematical and Statistical Sciences (Contributor)
Created2013-05