Sparsity-cognizant total least-squares for perturbed compressive sampling

Hao Zhu, Geert Leus, Georgios B Giannakis

Research output: Contribution to journalArticlepeer-review

336 Scopus citations


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.

Original languageEnglish (US)
Article number5706373
Pages (from-to)2002-2016
Number of pages15
JournalIEEE Transactions on Signal Processing
Issue number5
StatePublished - May 2011

Bibliographical note

Funding Information:
Manuscript received August 17, 2010; revised January 17, 2011; accepted January 20, 2011. Date of publication February 04, 2011; date of current version April 13, 2011. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Mark Coates. This work is supported by the NSF Grants CCF-0830480, CCF-1016605, ECCS-0824007, and ECCS-1002180; The work of G. Leus has been supported in part by the NWO-STW under the VICI program (project 10382). Part of this work was presented at the Eleventh IEEE International Workshop on Signal Processing Advances in Wireless Communications, Marrakech, Marocco, June 20–23, 2010.


  • Direction-of-arrival estimation
  • errors-in-variables models
  • sparsity
  • spectrum sensing
  • total least-squares


Dive into the research topics of 'Sparsity-cognizant total least-squares for perturbed compressive sampling'. Together they form a unique fingerprint.

Cite this