A Near-Optimal Restricted Isometry Condition of Multiple Orthogonal Least Squares

Junhan Kim, Byonghyo Shim

Research output: Contribution to journalArticle

Abstract

In this paper, we analyze the performance guarantee of multiple orthogonal least squares (MOLS) in recovering sparse signals. Specifically, we show that the MOLS algorithm ensures the accurate recovery of any K -sparse signal, provided that a sampling matrix satisfies the restricted isometry property (RIP) with \begin{equation∗} \delta -{LK-L+2} < \frac {\sqrt {L}}{\sqrt {K+2L-1}}\end{equation∗} where L is the number of indices chosen in each iteration. In particular, if L=1 , our result indicates that the conventional OLS algorithm exactly reconstructs any K -sparse vector under \delta -{K+1} < \frac {1}{\sqrt {K+1}} , which is consistent with the best existing result for OLS.

Original languageEnglish
Article number8674762
Pages (from-to)46822-46830
Number of pages9
JournalIEEE Access
Volume7
DOIs
Publication statusPublished - 2019 Jan 1

Fingerprint

Sampling
Recovery

Keywords

  • multiple OLS (MOLS)
  • orthogonal least squares (OLS)
  • restricted isometry property (RIP)
  • Sparse signal recovery

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

A Near-Optimal Restricted Isometry Condition of Multiple Orthogonal Least Squares. / Kim, Junhan; Shim, Byonghyo.

In: IEEE Access, Vol. 7, 8674762, 01.01.2019, p. 46822-46830.

Research output: Contribution to journalArticle

@article{aff26ee05f9549b68e32aecf8992b5ef,
title = "A Near-Optimal Restricted Isometry Condition of Multiple Orthogonal Least Squares",
abstract = "In this paper, we analyze the performance guarantee of multiple orthogonal least squares (MOLS) in recovering sparse signals. Specifically, we show that the MOLS algorithm ensures the accurate recovery of any K -sparse signal, provided that a sampling matrix satisfies the restricted isometry property (RIP) with \begin{equation∗} \delta -{LK-L+2} < \frac {\sqrt {L}}{\sqrt {K+2L-1}}\end{equation∗} where L is the number of indices chosen in each iteration. In particular, if L=1 , our result indicates that the conventional OLS algorithm exactly reconstructs any K -sparse vector under \delta -{K+1} < \frac {1}{\sqrt {K+1}} , which is consistent with the best existing result for OLS.",
keywords = "multiple OLS (MOLS), orthogonal least squares (OLS), restricted isometry property (RIP), Sparse signal recovery",
author = "Junhan Kim and Byonghyo Shim",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/ACCESS.2019.2907303",
language = "English",
volume = "7",
pages = "46822--46830",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A Near-Optimal Restricted Isometry Condition of Multiple Orthogonal Least Squares

AU - Kim, Junhan

AU - Shim, Byonghyo

PY - 2019/1/1

Y1 - 2019/1/1

N2 - In this paper, we analyze the performance guarantee of multiple orthogonal least squares (MOLS) in recovering sparse signals. Specifically, we show that the MOLS algorithm ensures the accurate recovery of any K -sparse signal, provided that a sampling matrix satisfies the restricted isometry property (RIP) with \begin{equation∗} \delta -{LK-L+2} < \frac {\sqrt {L}}{\sqrt {K+2L-1}}\end{equation∗} where L is the number of indices chosen in each iteration. In particular, if L=1 , our result indicates that the conventional OLS algorithm exactly reconstructs any K -sparse vector under \delta -{K+1} < \frac {1}{\sqrt {K+1}} , which is consistent with the best existing result for OLS.

AB - In this paper, we analyze the performance guarantee of multiple orthogonal least squares (MOLS) in recovering sparse signals. Specifically, we show that the MOLS algorithm ensures the accurate recovery of any K -sparse signal, provided that a sampling matrix satisfies the restricted isometry property (RIP) with \begin{equation∗} \delta -{LK-L+2} < \frac {\sqrt {L}}{\sqrt {K+2L-1}}\end{equation∗} where L is the number of indices chosen in each iteration. In particular, if L=1 , our result indicates that the conventional OLS algorithm exactly reconstructs any K -sparse vector under \delta -{K+1} < \frac {1}{\sqrt {K+1}} , which is consistent with the best existing result for OLS.

KW - multiple OLS (MOLS)

KW - orthogonal least squares (OLS)

KW - restricted isometry property (RIP)

KW - Sparse signal recovery

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

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

U2 - 10.1109/ACCESS.2019.2907303

DO - 10.1109/ACCESS.2019.2907303

M3 - Article

VL - 7

SP - 46822

EP - 46830

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8674762

ER -