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
T2 - 2013 47th Asilomar Conference on Signals, Systems and Computers
Y2 - 3 November 2013 through 6 November 2013
ER -