… k-sparse signals simpler we will use a high quality expander graph which is right-regular as
… expanders from any expander graph without disturbing its characteristics (lemma 2.3 in [4]. …

… compressed sensing literature are no longer applicable. In this paper, we develop a novel
sensing paradigm based on expander graphs … “Efficient and robust compressed sensing using …

… of expander graphs, the matrices we consider, and sampling theorems of some selected
compressed sensing … Calderbank, “Efficient and robust compressed sensing using high-quality …

… An expander graph we study is an unbalanced bipartite simple graph which has quite sparse
… It is a remarkable fact that such high-quality expanders exist although they are hard to …

… matrices for compressed sensing applied to this purpose. In particular, we propose to use
expander graph based … Efficient and robust compressed sensing using high-quality expander …

… compression is of key importance is compressed sensing [… can be constructed using
high-quality expanders. The formal … if A is an adjacency matrix of an expander graph, then the LP …

… that it is both optimal and robust to noise (Section 6). One … expander graphs in the context
of compressed sensing, we require a much smaller expansion coefficient in order to be effective…

… high quality Fabry–Perot sensors with highly uniform sensor properties. For non-contact
schemes, … Stable and robust recovery of sparse vectors requires the measurement matrix to well …

… matrices based on expander graphs have been shown to … problem by utilizing a high quality
CS reconstruction algorithm. … Calderbank, “Efficient and robust compressed sensing using …