activity
20102015
most citedFast and Efficient Compressive Sensing using Structurally Random Matrices

402 citations · 513 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IT2015★ 67 cited

The recoverability limit for superresolution via sparsity

Laurent Demanet, Nam Nguyen

We consider the problem of robustly recovering a -sparse coefficient vector from the Fourier series that it generates, restricted to the interval . The difficulty of t…

cs.CV2014★ 4 cited

Collaborative Multi-sensor Classification via Sparsity-based Representation

Minh Dao, Nam H. Nguyen, Nasser M. Nasrabadi +1

In this paper, we propose a general collaborative sparse representation framework for multi-sensor classification, which takes into account the correlations as well as complementar…

math.NA2014★ 18 cited

Linear Convergence of Stochastic Iterative Greedy Algorithms with Sparse Constraints

Nam Nguyen, Deanna Needell, Tina Woolf

Motivated by recent work on stochastic gradient descent methods, we develop two stochastic variants of greedy algorithms for possibly non-convex optimization problems with sparsity…

math.ST2011

Robust Lasso with missing and grossly corrupted observations

Nam H. Nguyen, Trac D. Tran

This paper studies the problem of accurately recovering a sparse vector from highly corrupted linear measurements where is…

cs.IT2011★ 402 cited

Fast and Efficient Compressive Sensing using Structurally Random Matrices

Thong T. Do, Lu Gan, Nam H. Nguyen +1

This paper introduces a new framework of fast and efficient sensing matrices for practical compressive sensing, called Structurally Random Matrix (SRM). In the proposed framework,…

cs.IT2011★ 11 cited

Exact recoverability from dense corrupted observations via minimization

Nam H. Nguyen, Trac. D. Tran

This paper confirms a surprising phenomenon first observed by Wright \textit{et al.} \cite{WYGSM_Face_2009_J} \cite{WM_denseError_2010_J} under different setting: given highly…

math.NA2010★ 11 cited

Tensor sparsification via a bound on the spectral norm of random tensors

Nam H. Nguyen, Petros Drineas, Trac D. Tran

Given an order- tensor $\tensor A \in \R^{n \times n \times...\times n}$, we present a simple, element-wise sparsification algorithm that zeroes out all sufficiently small eleme…