Sensor selection via compressed sensing
From MaRDI portal
Abstract: We present a computationally-efficient method for recovering sparse signals from a series of noisy observations, known as the problem of compressed sensing (CS). CS theory requires solving a convex constrained minimization problem. We propose to transform this optimization problem into a convex feasibility problem (CFP), and solve it using subgradient projection methods, which are iterative, fast, robust and convergent schemes for solving CFPs. As opposed to some of the recently-introduced CS algorithms, such as Bayesian CS and gradient projections for sparse reconstruction, which become inefficient as the problem dimension and sparseness degree increase, the newly-proposed methods exhibit a marked robustness with respect to these factors. This renders the subgradient projection methods highly viable for large-scale compressible scenarios.
Recommendations
- Sensor Selection via Convex Optimization
- Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models
- Compressive sensing
- Compressive Sensing
- Compressed sensing
- Compressed sensing
- Sensors' optimal dimensionality compression matrix in estimation fusion
- On an optimization problem in sensor selection
- Compression-Based Compressed Sensing
- Distributed Sparsity-Aware Sensor Selection
Cited in
(7)- Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems
- Sparse sensor selection for distributed systems: an \(l_1\)-relaxation approach
- PBH tests for nonlinear systems
- Sensor selection for random field estimation in wireless sensor networks
- A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs
- A survey on compressed sensing approach to systems and control
- Sparse sensor placement optimization for classification
This page was built for publication: Sensor selection via compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350790)
