From Sparse Signals to Sparse Residuals for Robust Sensing

DOI10.1109/TSP.2011.2141661MaRDI QIDQ4573062zbMATH OpenOpenAlexFDO

Authors Vassilis Kekatos, Georgios B. Giannakis

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1011.0450

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Abstract: One of the key challenges in sensor networks is the extraction of information by fusing data from a multitude of distinct, but possibly unreliable sensors. Recovering information from the maximum number of dependable sensors while specifying the unreliable ones is critical for robust sensing. This sensing task is formulated here as that of finding the maximum number of feasible subsystems of linear equations, and proved to be NP-hard. Useful links are established with compressive sampling, which aims at recovering vectors that are sparse. In contrast, the signals here are not sparse, but give rise to sparse residuals. Capitalizing on this form of sparsity, four sensing schemes with complementary strengths are developed. The first scheme is a convex relaxation of the original problem expressed as a second-order cone program (SOCP). It is shown that when the involved sensing matrices are Gaussian and the reliable measurements are sufficiently many, the SOCP can recover the optimal solution with overwhelming probability. The second scheme is obtained by replacing the initial objective function with a concave one. The third and fourth schemes are tailored for noisy sensor data. The noisy case is cast as a combinatorial problem that is subsequently surrogated by a (weighted) SOCP. Interestingly, the derived cost functions fall into the framework of robust multivariate linear regression, while an efficient block-coordinate descent algorithm is developed for their minimization. The robust sensing capabilities of all schemes are verified by simulated tests.

Recommendations

• Sparse and robust signal reconstruction
• Adaptive sensing for estimation of structured sparse signals
• Sparse Signal Processing
• Robust sparse signal reconstructions against basis mismatch and their applications
• Signal reconstruction in sensor arrays using sparse representations
• A robust reconstruction algorithm for sparse signals
• Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization
• Robust instance-optimal recovery of sparse signals at unknown noise levels
• Sparse Signal Estimation by Maximally Sparse Convex Optimization
• Sparse Signal Approximation via Nonseparable Regularization

Cited in

(1)

• Regularised estimation for ARMAX process with measurements subject to outliers

This page was built for publication: From Sparse Signals to Sparse Residuals for Robust Sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573062)