17 December 2018 in IEEE Sensors Journal
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.
1 September 2017 in Journal of Computational Physics
1 May 2020 in Journal of Computational Physics
MKMary Catherine Kropinski
21 November 2022 in Journal of Computational Physics
3 March 2020 in Advances in Computational Mathematics
9 March 2018 in Journal of Scientific Computing