Recovering Graph-Structured Activations using Adaptive Compressive Measurements

Minimum cuts in near-linear time

David R Karger · 2000

Earlier work this paper cites.

An introduction to compressive sampling

Emmanuel J Candès and Michael B Wakin · 2008

Earlier work this paper cites.

Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting

Martin J Wainwright · 2009

Earlier work this paper cites.

Information theoretic bounds for compressed sensing

Shuchin Aeron, Venkatesh Saligrama, and Manqi Zhao · 2010

Earlier work this paper cites.

Model-based compressive sensing

Richard G Baraniuk, Volkan Cevher, Marco F Duarte, and Chinmay Hegde · 2010

Earlier work this paper cites.

On the fundamental limits of adaptive sensing

Original

Ery Arias-Castro, Emmanuel J Candes, and Mark Davenport · 2011

Cited alongside, same era.

Distilled sensing: Adaptive sampling for sparse detection and estimation

Jarvis Haupt, Rui M Castro, and Robert Nowak · 2011

Cited alongside, same era.

Efficient adaptive compressive sensing using sparse hierarchical learned dictionaries

Akshay Soni and Jarvis Haupt · 2011

Cited alongside, same era.

Recovering block-structured activations using compressive measurements

Original

Sivaraman Balakrishnan, Mladen Kolar, Alessandro Rinaldo, and Aarti Singh · 2012

Cited alongside, same era.

Compressive binary search

Mark A Davenport and Ery Arias-Castro · 2012

Cited alongside, same era.

Sequentially designed compressed sensing

Jarvis Haupt, Richard Baraniuk, Rui Castro, and Robert Nowak · 2012

Later among the works it cites.

Near-optimal adaptive compressed sensing

Matthew L Malloy and Robert D Nowak · 2012

Later among the works it cites.

Detecting activations over graphs using spanning tree wavelet bases

James Sharpnack, Akshay Krishnamurthy, and Aarti Singh · 2013

Closest in time.

On the fundamental limits of recovering tree sparse vectors from noisy linear measurements

Original

Akshay Soni and Jarvis Haupt · 2013

Closest in time.