Emily Clark

Emily Clark

Auto-generated profile, based on publicly available information

Emily Clark

Department of Physics at the University of Washington, Seattle, WA, 98195-1560 USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 December 2018 in IEEE Sensors Journal
Verified
Journal Article
Open access
ECEmily Clark
Emily Clark
TATravis Askham
Travis Askham
SBSteven L. Brunton
Steven L. Brunton
NKNathan Kutz
Nathan Kutz
The problem of optimally placing sensors under a cost constraint arises naturally in the design of industrial and commercial products, as well as in scientific experiments. We consider a relaxation of the full optimization formulation of this problem and then extend a well-established greedy algorithm for the optimal sensor placement problem without cost constraints. We demonstrate the effectiveness of this algorithm on data sets related to facial recognition, climate science, and fluid mechanics. This algorithm is scalable and often identifies sparse sensors with near-optimal reconstruction performance, while dramatically reducing the overall cost of the sensors. We find that the costerror landscape varies by application, with intuitive connections to the underlying physics. Additionally, we include experiments for various pre-processing techniques and find that a popular technique based on the singular value decomposition is often suboptimal.

30 July 2020 in IEEE Sensors Journal
Verified
Journal Article
Closed access
ECEmily Clark
Emily Clark
SBSteven L. Brunton
Steven L. Brunton
NKNathan Kutz
Nathan Kutz
We develop greedy algorithms to approximate the optimal solution to the multi-fidelity sensor selection problem, which is a cost constrained optimization problem prescribing the placement and number of cheap (low signal-to-noise) and expensive (high signal-to-noise) sensors in an environment or state space. Specifically, we evaluate the composition of cheap and expensive sensors, along with their placement, required to achieve accurate reconstruction of a high-dimensional state. We use the column-pivoted QR decomposition to obtain preliminary sensor positions. How many of each type of sensor to use is highly dependent upon the sensor noise levels, sensor costs, overall cost budget, and the singular value spectrum of the data measured. Such nuances allow us to provide sensor selection recommendations based on computational results for asymptotic regions of parameter space. We also present a systematic exploration of the effects of the number of modes and sensors on reconstruction error when using one type of sensor. Our extensive exploration of multi-fidelity sensor composition as a function of data characteristics is the first of its kind to provide guidelines towards optimal multi-fidelity sensor selection.

25 May 2020 in IEEE Sensors Journal
Verified
Journal Article
Closed access
ECEmily Clark
Emily Clark
NKNathan Kutz
Nathan Kutz
SBSteven L. Brunton
Steven L. Brunton
We consider cost-constrained sparse sensor selection for full-state reconstruction, applying a well-known greedy algorithm to dynamical systems for which the usual singular value decomposition (SVD) basis may not be available or preferred. We apply the cost-modified, column-pivoted QR decomposition to a physically relevant basis—the pivots correspond to sensor locations, and these locations are penalized with a heterogeneous cost function. In considering different bases, we are able to account for the dynamics of the particular system, yielding sensor arrays that are nearly Pareto optimal in sensor cost and performance in the chosen basis. This flexibility extends our framework to include actuation and dynamic estimation, and to select sensors without training data. We provide three examples from the physical and engineering sciences and evaluate sensor selection in three dynamically relevant bases: truncated balanced modes for control systems, dynamic mode decomposition (DMD) modes, and a basis of analytic modes. We find that these bases all yield effective sensor arrays and reconstructions for their respective systems. When possible, we compare to results using an SVD basis and evaluate tradeoffs between methods.

1 January 2021 in Journal of Manufacturing Systems
Verified
Journal Article
Open access
ECEmily Clark
Emily Clark
AVAngelie Vincent
Angelie Vincent
NKNathan Kutz
Nathan Kutz
SBSteven L. Brunton
Steven L. Brunton

7 May 2020 in arXiv
Verified
Preprint
Open access
PDF file
ECEmily Clark
Emily Clark
SBSteven L. Brunton
Steven L. Brunton
NKNathan Kutz
Nathan Kutz
We develop greedy algorithms to approximate the optimal solution to the multi-fidelity sensor selection problem, which is a cost constrained optimization problem prescribing the placement and number of cheap (low signal-to-noise) and expensive (high signal-to-noise) sensors in an environment or state space. Specifically, we evaluate the composition of cheap and expensive sensors, along with their placement, required to achieve accurate reconstruction of a high-dimensional state. We use the column-pivoted QR decomposition to obtain preliminary sensor positions. How many of each type of sensor to use is highly dependent upon the sensor noise levels, sensor costs, overall cost budget, and the singular value spectrum of the data measured. Such nuances allow us to provide sensor selection recommendations based on computational results for asymptotic regions of parameter space. We also present a systematic exploration of the effects of the number of modes and sensors on reconstruction error when using one type of sensor. Our extensive exploration of multi-fidelity sensor composition as a function of data characteristics is the first of its kind to provide guidelines towards optimal multi-fidelity sensor selection.

9 May 2018 in arXiv
Verified
Preprint
Open access
PDF file
ECEmily Clark
Emily Clark
TATravis Askham
Travis Askham
SBSteven L. Brunton
Steven L. Brunton
NKNathan Kutz
Nathan Kutz
The problem of optimally placing sensors under a cost constraint arises naturally in the design of industrial and commercial products, as well as in scientific experiments. We consider a relaxation of the full optimization formulation of this problem and then extend a well-established QR-based greedy algorithm for the optimal sensor placement problem without cost constraints. We demonstrate the effectiveness of this algorithm on data sets related to facial recognition, climate science, and fluid mechanics. This algorithm is scalable and often identifies sparse sensors with near optimal reconstruction performance, while dramatically reducing the overall cost of the sensors. We find that the cost-error landscape varies by application, with intuitive connections to the underlying physics. Additionally, we include experiments for various pre-processing techniques and find that a popular technique based on the singular value decomposition is often sub-optimal.