Multiple Orthogonal Least Squares for Joint Sparse Recovery

Junhan Kim, Byonghyo Shim

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

3 Citations (Scopus)

Abstract

Joint sparse recovery aims to reconstruct multiple sparse signals having a common support using multiple measurement vectors (MMV). In this paper, we propose a robust joint sparse recovery algorithm, termed MMV multiple orthogonal least squares (MMV-MOLS). Owing to the novel identification rule that fully exploits the correlation between the measurement vectors, MMV-MOLS greatly improves the accuracy of the recovered signals over the conventional joint sparse recovery techniques. From the simulation results, we show that MMV-MOLS outperforms conventional joint sparse recovery algorithms, in both full row rank and rank deficient scenarios. In our analysis, we show that MMV-MOLS recovers any row K-sparse matrix accurately in the full row rank scenario with m = K + 1 measurements, which is, in fact, the minimum number of measurements to recover a row K-sparse matrix. In addition, we analyze the performance guarantee of the MMV-MOLS algorithm in the rank deficient scenario using the restricted isometry property (RIP).

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages61-65
Number of pages5
Volume2018-June
ISBN (Print)9781538647806
DOIs
Publication statusPublished - 2018 Aug 15
Externally publishedYes
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: 2018 Jun 172018 Jun 22

Other

Other2018 IEEE International Symposium on Information Theory, ISIT 2018
CountryUnited States
CityVail
Period18/6/1718/6/22

Fingerprint

Orthogonal Least Squares
Recovery
Sparse matrix
Scenarios
Performance Guarantee
Isometry

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Kim, J., & Shim, B. (2018). Multiple Orthogonal Least Squares for Joint Sparse Recovery. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (Vol. 2018-June, pp. 61-65). [8437788] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437788

Multiple Orthogonal Least Squares for Joint Sparse Recovery. / Kim, Junhan; Shim, Byonghyo.

2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. p. 61-65 8437788.

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

Kim, J & Shim, B 2018, Multiple Orthogonal Least Squares for Joint Sparse Recovery. in 2018 IEEE International Symposium on Information Theory, ISIT 2018. vol. 2018-June, 8437788, Institute of Electrical and Electronics Engineers Inc., pp. 61-65, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 18/6/17. https://doi.org/10.1109/ISIT.2018.8437788
Kim J, Shim B. Multiple Orthogonal Least Squares for Joint Sparse Recovery. In 2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June. Institute of Electrical and Electronics Engineers Inc. 2018. p. 61-65. 8437788 https://doi.org/10.1109/ISIT.2018.8437788
Kim, Junhan ; Shim, Byonghyo. / Multiple Orthogonal Least Squares for Joint Sparse Recovery. 2018 IEEE International Symposium on Information Theory, ISIT 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. pp. 61-65
@inproceedings{efd84cf575d541b095c4e1ac0c9bc5f0,
title = "Multiple Orthogonal Least Squares for Joint Sparse Recovery",
abstract = "Joint sparse recovery aims to reconstruct multiple sparse signals having a common support using multiple measurement vectors (MMV). In this paper, we propose a robust joint sparse recovery algorithm, termed MMV multiple orthogonal least squares (MMV-MOLS). Owing to the novel identification rule that fully exploits the correlation between the measurement vectors, MMV-MOLS greatly improves the accuracy of the recovered signals over the conventional joint sparse recovery techniques. From the simulation results, we show that MMV-MOLS outperforms conventional joint sparse recovery algorithms, in both full row rank and rank deficient scenarios. In our analysis, we show that MMV-MOLS recovers any row K-sparse matrix accurately in the full row rank scenario with m = K + 1 measurements, which is, in fact, the minimum number of measurements to recover a row K-sparse matrix. In addition, we analyze the performance guarantee of the MMV-MOLS algorithm in the rank deficient scenario using the restricted isometry property (RIP).",
author = "Junhan Kim and Byonghyo Shim",
year = "2018",
month = "8",
day = "15",
doi = "10.1109/ISIT.2018.8437788",
language = "English",
isbn = "9781538647806",
volume = "2018-June",
pages = "61--65",
booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Multiple Orthogonal Least Squares for Joint Sparse Recovery

AU - Kim, Junhan

AU - Shim, Byonghyo

PY - 2018/8/15

Y1 - 2018/8/15

N2 - Joint sparse recovery aims to reconstruct multiple sparse signals having a common support using multiple measurement vectors (MMV). In this paper, we propose a robust joint sparse recovery algorithm, termed MMV multiple orthogonal least squares (MMV-MOLS). Owing to the novel identification rule that fully exploits the correlation between the measurement vectors, MMV-MOLS greatly improves the accuracy of the recovered signals over the conventional joint sparse recovery techniques. From the simulation results, we show that MMV-MOLS outperforms conventional joint sparse recovery algorithms, in both full row rank and rank deficient scenarios. In our analysis, we show that MMV-MOLS recovers any row K-sparse matrix accurately in the full row rank scenario with m = K + 1 measurements, which is, in fact, the minimum number of measurements to recover a row K-sparse matrix. In addition, we analyze the performance guarantee of the MMV-MOLS algorithm in the rank deficient scenario using the restricted isometry property (RIP).

AB - Joint sparse recovery aims to reconstruct multiple sparse signals having a common support using multiple measurement vectors (MMV). In this paper, we propose a robust joint sparse recovery algorithm, termed MMV multiple orthogonal least squares (MMV-MOLS). Owing to the novel identification rule that fully exploits the correlation between the measurement vectors, MMV-MOLS greatly improves the accuracy of the recovered signals over the conventional joint sparse recovery techniques. From the simulation results, we show that MMV-MOLS outperforms conventional joint sparse recovery algorithms, in both full row rank and rank deficient scenarios. In our analysis, we show that MMV-MOLS recovers any row K-sparse matrix accurately in the full row rank scenario with m = K + 1 measurements, which is, in fact, the minimum number of measurements to recover a row K-sparse matrix. In addition, we analyze the performance guarantee of the MMV-MOLS algorithm in the rank deficient scenario using the restricted isometry property (RIP).

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

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

U2 - 10.1109/ISIT.2018.8437788

DO - 10.1109/ISIT.2018.8437788

M3 - Conference contribution

AN - SCOPUS:85052443429

SN - 9781538647806

VL - 2018-June

SP - 61

EP - 65

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -