Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
On Kalman Filtering With Nonlinear Equality Constraints
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Convex feasibility modeling and projection methods for sparse signal recovery
Journal of Computational and Applied Mathematics
Compressive system identification: Sequential methods and entropy bounds
Digital Signal Processing
Hi-index | 35.68 |
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimization problem. We propose solving this optimization problem by two algorithms that rely on a Kalman filter (KF) endowed with a pseudo-measurement (PM) equation. Compared to a recently-introduced KF-CS method, which involves the implementation of an auxiliary CS optimization algorithm (e.g., the Dantzig selector), our method can be straightforwardly implemented in a stand-alone manner, as it is exclusively based on the well-known KF formulation. In our first algorithm, the PM equation constrains the l1 norm of the estimated state. In this case, the augmented measurement equation becomes linear, so a regular KF can be used. In our second algorithm, we replace the norm by a quasi-norm lp, 0 ≤ p