File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICASSP.2009.4960290
- Scopus: eid_2-s2.0-70349216425
- WOS: WOS:000268919201325
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Separation of a subspace-sparse signal: Algorithms and conditions
Title | Separation of a subspace-sparse signal: Algorithms and conditions |
---|---|
Authors | |
Keywords | Subspace base pursuit Subspace incoherence Subspace matching pursuit Subspace sparse |
Issue Date | 2009 |
Citation | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 2009, p. 3141-3144 How to Cite? |
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. ©2009 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/326787 |
ISSN | |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ganesh, Arvind | - |
dc.contributor.author | Zhou, Zihan | - |
dc.contributor.author | Ma, Yi | - |
dc.date.accessioned | 2023-03-31T05:26:30Z | - |
dc.date.available | 2023-03-31T05:26:30Z | - |
dc.date.issued | 2009 | - |
dc.identifier.citation | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 2009, p. 3141-3144 | - |
dc.identifier.issn | 1520-6149 | - |
dc.identifier.uri | http://hdl.handle.net/10722/326787 | - |
dc.description.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. ©2009 IEEE. | - |
dc.language | eng | - |
dc.relation.ispartof | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings | - |
dc.subject | Subspace base pursuit | - |
dc.subject | Subspace incoherence | - |
dc.subject | Subspace matching pursuit | - |
dc.subject | Subspace sparse | - |
dc.title | Separation of a subspace-sparse signal: Algorithms and conditions | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICASSP.2009.4960290 | - |
dc.identifier.scopus | eid_2-s2.0-70349216425 | - |
dc.identifier.spage | 3141 | - |
dc.identifier.epage | 3144 | - |
dc.identifier.isi | WOS:000268919201325 | - |