New algorithms for verifying the null space conditions in compressed sensing

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

1 Scopus citations

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

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'New algorithms for verifying the null space conditions in compressed sensing'. Together they form a unique fingerprint.

Cite this