We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Institute of Electrical and Electronics Engineers (IEEE)
Doi
Abstract
We consider the recovery of a nonnegative vector x from measurements y = Ax, where A ∈ {0, 1}[superscript m×n]. We establish that when A corresponds to the adjacency matrix of a bipartite graph with sufficient expansion, a simple message-passing algorithm produces an estimate x^ of x satisfying ∥x-x^∥[subscript 1] ≤ O(n/k) ∥x-x[superscript(k)]∥1, where x[superscript(k)] is the best k-sparse approximation of x. The algorithm performs O(n(log(n/k))[superscript 2] log (k)) computation in total, and the number of measurements required is m = O(k log(n/k)). In the special case when x is k-sparse, the algorithm recovers x exactly in time O(n log(n/k) log(k)). Ultimately, this work is a further step in the direction of more formally developing the broader role of message-passing algorithms in solving compressed sensing problems.National Science Foundation (U.S.). (Grant number CCF-0635191)Microsoft Research
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.