Near-Optimal Sensor Placement for Linear Inverse Problems

A classic problem is the estimation of a set of parameters from measurements collected by only a few sensors. The number of sensors is often limited by physical or economical constraints and their placement is of fundamental importance to obtain accurate estimates. Unfortunately, the selection of the optimal sensor locations is intrinsically combinatorial and the available approximation algorithms are not guaranteed to generate good solutions in all cases of interest. We propose FrameSense, a greedy algorithm for the selection of optimal sensor locations. The core cost function of the algorithm is the frame potential, a scalar property of matrices that measures the orthogonality of its rows. Notably, FrameSense is the first algorithm that is near-optimal in terms of mean square error, meaning that its solution is always guaranteed to be close to the optimal one. Moreover, we show with an extensive set of numerical experiments that FrameSense achieves state-of-the-art performance while having the lowest computational cost, when compared to other greedy methods.

[1]  David J. C. MacKay,et al.  Information-Based Objective Functions for Active Data Selection , 1992, Neural Computation.

[2]  James L. Massey,et al.  Optimum sequence multisets for synchronous code-division multiple-access channels , 1994, IEEE Trans. Inf. Theory.

[3]  Alaa F. Sheta,et al.  Optimizing the communication distance of an ad hoc wireless sensor networks by genetic algorithms , 2008, Artificial Intelligence Review.

[4]  Andreas Krause,et al.  Online distributed sensor selection , 2010, IPSN '10.

[5]  Seda Ogrenci Memik,et al.  Systematic temperature sensor allocation and placement for microprocessors , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[6]  Haris Vikalo,et al.  Greedy sensor selection: Leveraging submodularity , 2010, 49th IEEE Conference on Decision and Control (CDC).

[7]  Dustin G. Mixon,et al.  Frame completions for optimally robust reconstruction , 2011, Optical Engineering + Applications.

[8]  Tajana Simunic,et al.  Accurate Direct and Indirect On-Chip Temperature Sensing for Efficient Dynamic Thermal Management , 2010, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Vivek K. Goyal,et al.  Quantized Overcomplete Expansions in IRN: Analysis, Synthesis, and Algorithms , 1998, IEEE Trans. Inf. Theory.

[10]  Chris Bailey-Kellogg,et al.  Gaussian Processes for Active Data Mining of Spatial Aggregates , 2005, SDM.

[11]  Sina Jafarpour,et al.  Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices , 2012, Proceedings of the National Academy of Sciences.

[12]  W. G. Hunter,et al.  Experimental Design: Review and Comment , 1984 .

[13]  Sherief Reda,et al.  Thermal monitoring of real processors: Techniques for sensor allocation and full characterization , 2010, Design Automation Conference.

[14]  G. Pottie,et al.  Entropy-based sensor selection heuristic for target localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[15]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[16]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[17]  David Atienza,et al.  EigenMaps: Algorithms for optimal thermal maps extraction and sensor placement on multicore processors , 2012, DAC Design Automation Conference 2012.

[18]  M. Naeem,et al.  Cross-Entropy optimization for sensor selection problems , 2009, 2009 9th International Symposium on Communications and Information Technology.

[19]  Stephen P. Boyd,et al.  Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.

[20]  John J. Benedetto,et al.  Finite Normalized Tight Frames , 2003, Adv. Comput. Math..

[21]  Peter G. Casazza,et al.  A Physical Interpretation of Tight Frames , 2006 .

[22]  Michael Elad,et al.  From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images , 2009, SIAM Rev..

[23]  Thierry Blu,et al.  Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..

[24]  Sherief Reda,et al.  Improved Thermal Tracking for Processors Using Hard and Soft Sensor Allocation Techniques , 2011, IEEE Transactions on Computers.

[25]  Abhimanyu Das,et al.  Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection , 2011, ICML.

[26]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[27]  Mérouane Debbah,et al.  Signal Processing in Large Systems: A New Paradigm , 2011, IEEE Signal Processing Magazine.

[28]  Sherief Reda,et al.  Spectral techniques for high-resolution thermal characterization with limited sensor data , 2009, 2009 46th ACM/IEEE Design Automation Conference.

[29]  Richard G. Baraniuk,et al.  Random Projections of Smooth Manifolds , 2009, Found. Comput. Math..

[30]  J. Haueisen,et al.  Tabu Search Optimization of Magnetic Sensor Systems for Magnetocardiography , 2008, IEEE Transactions on Magnetics.

[31]  Abhimanyu Das,et al.  Algorithms for subset selection in linear regression , 2008, STOC.

[32]  J. Kovacevic,et al.  Life Beyond Bases: The Advent of Frames (Part I) , 2007, IEEE Signal Processing Magazine.

[33]  Rajesh Sharma.  SOME MORE INEQUALITIES FOR ARITHMETIC MEAN, HARMONIC MEAN AND VARIANCE , 2008 .

[34]  P. Chiu,et al.  A simulated annealing algorithm to support the sensor placement for target location , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[35]  J. Kovacevic,et al.  Life Beyond Bases: The Advent of Frames (Part II) , 2007, IEEE Signal Processing Magazine.