Covariance eigenvector sparsity for compression and denoising

Ioannis D. Schizas, Georgios B. Giannakis

Research output: Contribution to journalArticle

21 Scopus citations

Abstract

Sparsity in the eigenvectors of signal covariance matrices is exploited in this paper for compression and denoising. Dimensionality reduction (DR) and quantization modules present in many practical compression schemes such as transform codecs, are designed to capitalize on this form of sparsity and achieve improved reconstruction performance compared to existing sparsity-agnostic codecs. Using training data that may be noisy a novel sparsity-aware linear DR scheme is developed to fully exploit sparsity in the covariance eigenvectors and form noise-resilient estimates of the principal covariance eigenbasis. Sparsity is effected via norm-one regularization, and the associated minimization problems are solved using computationally efficient coordinate descent iterations. The resulting eigenspace estimator is shown capable of identifying a subset of the unknown support of the eigenspace basis vectors even when the observation noise covariance matrix is unknown, as long as the noise power is sufficiently low. It is proved that the sparsity-aware estimator is asymptotically normal, and the probability to correctly identify the signal subspace basis support approaches one, as the number of training data grows large. Simulations using synthetic data and images, corroborate that the proposed algorithms achieve improved reconstruction quality relative to alternatives.

Original languageEnglish (US)
Article number6140983
Pages (from-to)2408-2421
Number of pages14
JournalIEEE Transactions on Signal Processing
Volume60
Issue number5
DOIs
StatePublished - May 1 2012

Keywords

  • Data compression
  • PCA
  • denoising
  • quantization
  • subspace estimation

Fingerprint Dive into the research topics of 'Covariance eigenvector sparsity for compression and denoising'. Together they form a unique fingerprint.

Cite this