Abstract
In this letter, a new sparsity-promoting penalty function is introduced for sensor selection problems in field reconstruction, which has the property of avoiding scenarios where the same sensors are successively selected. Using a reweighted ℓ1 relaxation of the ℓ0 norm, the sensor selection problem is reformulated as a convex quadratic program. In order to handle large-scale problems, we also present two fast algorithms: accelerated proximal gradient method and alternating direction method of multipliers. Numerical results are provided to demonstrate the effectiveness of our approaches.
Original language | English (US) |
---|---|
Article number | 6867304 |
Pages (from-to) | 1476-1480 |
Number of pages | 5 |
Journal | IEEE Signal Processing Letters |
Volume | 21 |
Issue number | 12 |
DOIs | |
State | Published - Dec 2014 |
Keywords
- Alternating direction method of multipliers
- convex relaxation
- field reconstruction
- proximal gradient method
- sensor selection
- sparsity
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering
- Applied Mathematics