Abstract

Selection of sparse sensors to recover the global signal field is a crucial task in many areas. Most of the existing algorithms tackle this problem by optimizing the surrogates of reconstruction criterion which relies on structural assumptions or low-dimensional models. In this paper, we propose a novel sensor placement method using signal reconstruction error as the cost function, sequentially minimize it with greedy procedures. Furthermore, we employ a recursive formula that leads to time and memory efficient evaluation of the criterion. We also develop a fast reconstruction-oriented local optimization technique, by deriving update formulae for computationally intensive items, which can be applied to improve the initial solutions of suboptimal algorithms in terms of reconstruction accuracy. We show the superiority of the proposed objective function under the same greedy selection procedure. Experiments on both numerical and real-world datasets demonstrate the advantages of our algorithm over the state-of-the-art methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.