Separation of a subspace-sparse signal: Algorithms and conditions

Arvind Ganesh, Zihan Zhou, Yi Ma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

Abstract

In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for subspace-sparse signals. A subspace-sparse signal is sparse with respect to a set of subspaces, instead of atoms. By generalizing the notion of mutual incoherence to the set of subspaces, we show that all classical sufficient conditions remain exactly the same for these algorithms to work for subspace-sparse signals, in both noiseless and noisy cases. The sufficient conditions provided are easy to verify for large systems. We conduct simulations to compare the performance of the proposed algorithms.

Original languageEnglish (US)
Title of host publication2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009
Pages3141-3144
Number of pages4
DOIs
StatePublished - Sep 23 2009
Event2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009 - Taipei, Taiwan, Province of China
Duration: Apr 19 2009Apr 24 2009

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Conference

Conference2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009
CountryTaiwan, Province of China
CityTaipei
Period4/19/094/24/09

Fingerprint

Recovery
Atoms

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Ganesh, A., Zhou, Z., & Ma, Y. (2009). Separation of a subspace-sparse signal: Algorithms and conditions. In 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009 (pp. 3141-3144). [4960290] (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2009.4960290
Ganesh, Arvind ; Zhou, Zihan ; Ma, Yi. / Separation of a subspace-sparse signal : Algorithms and conditions. 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009. 2009. pp. 3141-3144 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).
@inproceedings{370e32a522f44297a505f1a3df87a3fa,
title = "Separation of a subspace-sparse signal: Algorithms and conditions",
abstract = "In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for subspace-sparse signals. A subspace-sparse signal is sparse with respect to a set of subspaces, instead of atoms. By generalizing the notion of mutual incoherence to the set of subspaces, we show that all classical sufficient conditions remain exactly the same for these algorithms to work for subspace-sparse signals, in both noiseless and noisy cases. The sufficient conditions provided are easy to verify for large systems. We conduct simulations to compare the performance of the proposed algorithms.",
author = "Arvind Ganesh and Zihan Zhou and Yi Ma",
year = "2009",
month = "9",
day = "23",
doi = "10.1109/ICASSP.2009.4960290",
language = "English (US)",
isbn = "9781424423545",
series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",
pages = "3141--3144",
booktitle = "2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009",

}

Ganesh, A, Zhou, Z & Ma, Y 2009, Separation of a subspace-sparse signal: Algorithms and conditions. in 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009., 4960290, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, pp. 3141-3144, 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009, Taipei, Taiwan, Province of China, 4/19/09. https://doi.org/10.1109/ICASSP.2009.4960290

Separation of a subspace-sparse signal : Algorithms and conditions. / Ganesh, Arvind; Zhou, Zihan; Ma, Yi.

2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009. 2009. p. 3141-3144 4960290 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Separation of a subspace-sparse signal

T2 - Algorithms and conditions

AU - Ganesh, Arvind

AU - Zhou, Zihan

AU - Ma, Yi

PY - 2009/9/23

Y1 - 2009/9/23

N2 - In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for subspace-sparse signals. A subspace-sparse signal is sparse with respect to a set of subspaces, instead of atoms. By generalizing the notion of mutual incoherence to the set of subspaces, we show that all classical sufficient conditions remain exactly the same for these algorithms to work for subspace-sparse signals, in both noiseless and noisy cases. The sufficient conditions provided are easy to verify for large systems. We conduct simulations to compare the performance of the proposed algorithms.

AB - In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for subspace-sparse signals. A subspace-sparse signal is sparse with respect to a set of subspaces, instead of atoms. By generalizing the notion of mutual incoherence to the set of subspaces, we show that all classical sufficient conditions remain exactly the same for these algorithms to work for subspace-sparse signals, in both noiseless and noisy cases. The sufficient conditions provided are easy to verify for large systems. We conduct simulations to compare the performance of the proposed algorithms.

UR - http://www.scopus.com/inward/record.url?scp=70349216425&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349216425&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2009.4960290

DO - 10.1109/ICASSP.2009.4960290

M3 - Conference contribution

AN - SCOPUS:70349216425

SN - 9781424423545

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 3141

EP - 3144

BT - 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009

ER -

Ganesh A, Zhou Z, Ma Y. Separation of a subspace-sparse signal: Algorithms and conditions. In 2009 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings, ICASSP 2009. 2009. p. 3141-3144. 4960290. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2009.4960290