activity
20062023
most citedInformation theoretic bounds for Compressed Sensing

133 citations · 683 across the 44 of their papers we have counts for

collaborators
Showing cs.ITShow all

11 papers · 1 filter

cs.IT2021

Multiview Sensing With Unknown Permutations: An Optimal Transport Approach

Yanting Ma, Petros T. Boufounos, Hassan Mansour +1

In several applications, including imaging of deformable objects while in motion, simultaneous localization and mapping, and unlabeled sensing, we encounter the problem of recoveri…

cs.IT2016

On Deterministic Conditions for Subspace Clustering under Missing Data

Wenqi Wang, Shuchin Aeron, Vaneet Aggarwal

In this paper we present deterministic conditions for success of sparse subspace clustering (SSC) under missing data, when data is assumed to come from a Union of Subspaces (UoS) m…

cs.IT2016★ 2 cited

On deterministic conditions for subspace clustering under missing data

Wenqi Wang, Shuchin Aeron, Vaneet Aggarwal

In this paper we present deterministic analysis of sufficient conditions for sparse subspace clustering under missing data, when data is assumed to come from a Union of Subspaces (…

cs.IT2015

Multilinear Subspace Clustering

Eric Kernfeld, Nathan Majumder, Shuchin Aeron +1

In this paper we present a new model and an algorithm for unsupervised clustering of 2-D data such as images. We assume that the data comes from a union of multilinear subspaces (U…

cs.IT2015

Group-Invariant Subspace Clustering

Shuchin Aeron, Eric Kernfeld

In this paper we consider the problem of group invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. sub…

cs.IT2015

Information-theoretic Bounds on Matrix Completion under Union of Subspaces Model

Vaneet Aggarwal, Shuchin Aeron

In this short note we extend some of the recent results on matrix completion under the assumption that the columns of the matrix can be grouped (clustered) into subspaces (not nece…