Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling
Top Cited Papers
- 4 February 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 59 (5), 2002-2016
- https://doi.org/10.1109/tsp.2011.2109956
Abstract
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data vector as well as in the regression matrix. However, existing TLS approaches do not account for sparsity possibly present in the unknown vector of regression coefficients. On the other hand, sparsity is the key attribute exploited by modern compressive sampling and variable selection approaches to linear regression, which include noise in the data, but do not account for perturbations in the regression matrix. The present paper fills this gap by formulating and solving (regularized) TLS optimization problems under sparsity constraints. Near-optimum and reduced-complexity suboptimum sparse (S-) TLS algorithms are developed to address the perturbed compressive sampling (and the related dictionary learning) challenge, when there is a mismatch between the true and adopted bases over which the unknown vector is sparse. The novel S-TLS schemes also allow for perturbations in the regression matrix of the least-absolute selection and shrinkage selection operator (Lasso), and endow TLS approaches with ability to cope with sparse, under-determined “errors-in-variables” models. Interesting generalizations can further exploit prior knowledge on the perturbations to obtain novel weighted and structured S-TLS solvers. Analysis and simulations demonstrate the practical impact of S-TLS in calibrating the mismatch effects of contemporary grid-based approaches to cognitive radio sensing, and robust direction-of-arrival estimation using antenna arrays.Keywords
This publication has 28 references indexed in Scilit:
- Weighted and structured sparse total least-squares for perturbed compressive samplingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Effects of basis-mismatch in compressive sampling of continuous sinusoidal signalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Sensitivity to basis mismatch in compressed sensingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- The Adaptive Lasso and Its Oracle PropertiesJournal of the American Statistical Association, 2006
- Application of total least squares (TLS) to the design of sparse signal representation dictionariesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle PropertiesJournal of the American Statistical Association, 2001
- Convergence of a Block Coordinate Descent Method for Nondifferentiable MinimizationJournal of Optimization Theory and Applications, 2001
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- The Total Least Squares ProblemPublished by Society for Industrial & Applied Mathematics (SIAM) ,1991
- On Nonlinear Fractional ProgrammingManagement Science, 1967