Abstract
AbstractSensor selection is an NP-hard problem involving the selection of S out of N sensors such that optimal filtering performance is attained. We present a novel approach for sensor selection that utilizes a heuristic measure quantifying the incoherence of the vector space spanned by the sensors with respect to the system's principal directions. This approach facilitates the formulation of a convex relaxation problem that can be efficiently modeled and solved using compressed sensing (CS) algorithms. We subsequently develop a new CS algorithm based on subgradient projections. The new CS algorithm for sensor selection is shown to outperform existing methods in a number of applications.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
