activity
20072012
most citedInformation theoretic bounds for Compressed Sensing

133 citations · 243 across the 7 of their papers we have counts for

collaborators

7 papers

stat.ML2012★ 2 cited

Graph-based Learning with Unbalanced Clusters

Jing Qian, Venkatesh Saligrama, Manqi Zhao

Graph construction is a crucial step in spectral clustering (SC) and graph-based semi-supervised learning (SSL). Spectral methods applied on standard graphs such as full-RBF, -g…

stat.ML2011★ 2 cited

Graph Construction for Learning with Unbalanced Data

Jing Qian, Venkatesh Saligrama, Manqi Zhao

Unbalanced data arises in many learning tasks such as clustering of multi-class data, hierarchical divisive clustering and semisupervised learning. Graph-based approaches are popul…

cs.LG2009★ 80 cited

Anomaly Detection with Score functions based on Nearest Neighbor Graphs

Manqi Zhao, Venkatesh Saligrama

We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on score functions derived from nearest neighbor graphs on -point nominal…

cs.IT2009★ 3 cited

Compressed Blind De-convolution

V. Saligrama, M. Zhao

Suppose the signal x is realized by driving a k-sparse signal u through an arbitrary unknown stable discrete-linear time invariant system H. These types of processes arise naturall…

cs.IT2008★ 4 cited

Thresholded Basis Pursuit: An LP Algorithm for Achieving Optimal Support Recovery for Sparse and Approximately Sparse Signals from Noisy Random Measurements

V. Saligrama, M. Zhao

In this paper we present a linear programming solution for sign pattern recovery of a sparse signal from noisy random projections of the signal. We consider two types of noise mode…

cs.IT2008★ 133 cited

Information theoretic bounds for Compressed Sensing

Shuchin Aeron, Venkatesh Saligrama, Manqi Zhao

In this paper we derive information theoretic performance bounds to sensing and reconstruction of sparse phenomena from noisy projections. We consider two settings: output noise mo…