Journal article icon

Journal article

A robust parallel algorithm for combinatorial compressed sensing

Abstract:

It was shown in [1] that a vector x ∈ R n with at most k < n nonzeros can be recovered from an expander sketch Ax in O(nnz(A) log k) operations via the Parallel-`0 decoding algorithm, where nnz(A) denotes the number of nonzero entries in A ∈ R m×n . In this paper we present the Robust-`0 decoding algorithm, which robustifies Parallel-`0 when the sketch Ax is corrupted by additive noise. This robustness is achieved by approximating the asymptotic posterior distribution of values in the sket...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1109/TSP.2018.2806359

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Mathematical Institute
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Mathematical Institute
Oxford college:
Exeter College
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Mathematical Institute
Role:
Author
More from this funder
Grant:
EPSRC grant EP/N510129/1
Publisher:
IEEE Publisher's website
Journal:
IEEE Transactions on Signal Processing Journal website
Volume:
66
Issue:
8
Pages:
2167-2177
Publication date:
2018-02-15
Acceptance date:
2018-01-30
DOI:
EISSN:
1941-0476
ISSN:
1053-587X
Pubs id:
pubs:825133
URN:
uri:6b928899-d09b-41dd-94cb-91d91e096a5d
UUID:
uuid:6b928899-d09b-41dd-94cb-91d91e096a5d
Local pid:
pubs:825133
Paper number:
8

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP