New algorithms for verifying the null space conditions in compressed sensing

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

1 Citation (Scopus)

Abstract

The null space condition is a condition under which k-sparse signal can be recovered uniquely in compressed sensing (CS) problems. In this paper, new efficient algorithms are introduced to verify the null space condition for l1 minimization in compressed sensing. Suppose A is an (n - m) × n (m > 0) sensing matrix, we can verify whether the sensing matrix A satisfies the null space condition or not for k-sparse signals by computing αk = |zK|1/|z

Original languageEnglish (US)
Title of host publicationConference Record of the 47th Asilomar Conference on Signals, Systems and Computers
PublisherIEEE Computer Society
Pages1038-1042
Number of pages5
ISBN (Print)9781479923908
DOIs
StatePublished - Jan 1 2013
Event2013 47th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Nov 3 2013Nov 6 2013

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other2013 47th Asilomar Conference on Signals, Systems and Computers
CountryUnited States
CityPacific Grove, CA
Period11/3/1311/6/13

Fingerprint

Compressed sensing

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Cite this

Cho, M. M., & Xu, W. (2013). New algorithms for verifying the null space conditions in compressed sensing. In Conference Record of the 47th Asilomar Conference on Signals, Systems and Computers (pp. 1038-1042). [6810449] (Conference Record - Asilomar Conference on Signals, Systems and Computers). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2013.6810449
Cho, Myung (Michael) ; Xu, Weiyu. / New algorithms for verifying the null space conditions in compressed sensing. Conference Record of the 47th Asilomar Conference on Signals, Systems and Computers. IEEE Computer Society, 2013. pp. 1038-1042 (Conference Record - Asilomar Conference on Signals, Systems and Computers).
@inproceedings{b03f53c968244a219d4bead063355393,
title = "New algorithms for verifying the null space conditions in compressed sensing",
abstract = "The null space condition is a condition under which k-sparse signal can be recovered uniquely in compressed sensing (CS) problems. In this paper, new efficient algorithms are introduced to verify the null space condition for l1 minimization in compressed sensing. Suppose A is an (n - m) × n (m > 0) sensing matrix, we can verify whether the sensing matrix A satisfies the null space condition or not for k-sparse signals by computing αk = |zK|1/|z",
author = "Cho, {Myung (Michael)} and Weiyu Xu",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/ACSSC.2013.6810449",
language = "English (US)",
isbn = "9781479923908",
series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",
publisher = "IEEE Computer Society",
pages = "1038--1042",
booktitle = "Conference Record of the 47th Asilomar Conference on Signals, Systems and Computers",
address = "United States",

}

Cho, MM & Xu, W 2013, New algorithms for verifying the null space conditions in compressed sensing. in Conference Record of the 47th Asilomar Conference on Signals, Systems and Computers., 6810449, Conference Record - Asilomar Conference on Signals, Systems and Computers, IEEE Computer Society, pp. 1038-1042, 2013 47th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, United States, 11/3/13. https://doi.org/10.1109/ACSSC.2013.6810449

New algorithms for verifying the null space conditions in compressed sensing. / Cho, Myung (Michael); Xu, Weiyu.

Conference Record of the 47th Asilomar Conference on Signals, Systems and Computers. IEEE Computer Society, 2013. p. 1038-1042 6810449 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

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

TY - GEN

T1 - New algorithms for verifying the null space conditions in compressed sensing

AU - Cho, Myung (Michael)

AU - Xu, Weiyu

PY - 2013/1/1

Y1 - 2013/1/1

N2 - The null space condition is a condition under which k-sparse signal can be recovered uniquely in compressed sensing (CS) problems. In this paper, new efficient algorithms are introduced to verify the null space condition for l1 minimization in compressed sensing. Suppose A is an (n - m) × n (m > 0) sensing matrix, we can verify whether the sensing matrix A satisfies the null space condition or not for k-sparse signals by computing αk = |zK|1/|z

AB - The null space condition is a condition under which k-sparse signal can be recovered uniquely in compressed sensing (CS) problems. In this paper, new efficient algorithms are introduced to verify the null space condition for l1 minimization in compressed sensing. Suppose A is an (n - m) × n (m > 0) sensing matrix, we can verify whether the sensing matrix A satisfies the null space condition or not for k-sparse signals by computing αk = |zK|1/|z

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

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

U2 - 10.1109/ACSSC.2013.6810449

DO - 10.1109/ACSSC.2013.6810449

M3 - Conference contribution

AN - SCOPUS:84901284696

SN - 9781479923908

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 1038

EP - 1042

BT - Conference Record of the 47th Asilomar Conference on Signals, Systems and Computers

PB - IEEE Computer Society

ER -

Cho MM, Xu W. New algorithms for verifying the null space conditions in compressed sensing. In Conference Record of the 47th Asilomar Conference on Signals, Systems and Computers. IEEE Computer Society. 2013. p. 1038-1042. 6810449. (Conference Record - Asilomar Conference on Signals, Systems and Computers). https://doi.org/10.1109/ACSSC.2013.6810449