#### Filter Results:

#### Publication Year

2014

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

—This paper considers the spark of L × N subma-trices of the N × N Discrete Fourier Transform (DFT) matrix. Here a matrix has spark m if every collection of its m − 1 columns are linearly independent. The motivation comes from such applications of compressed sensing as MRI and synthetic aperture radar, where device physics dictates the measurements to be… (More)

We derive theoretical guarantees for the exact recovery of piecewise constant two-dimensional images from a minimal number of non-uniform Fourier samples using a convex matrix completion algorithm. We assume the discontinuities of the image are localized to the zero level-set of a bandlim-ited function, which induces certain linear dependencies in Fourier… (More)

We introduce a two step algorithm with theoretical guarantees to recover a jointly sparse and low-rank matrix from undersampled measurements of its columns. The algorithm first estimates the row subspace of the matrix using a set of common measurements of the columns. In the second step, the subspace aware recovery of the matrix is solved using a simple… (More)

—We consider the spark of submatrices of 2D-DFT matrices obtained by removing certain rows and relate it to the spark of associated 1D-DFT submatrices. A matrix has spark m if its smallest number of linearly dependent columns equals m. To recover an arbitrary k-sparse vector, the spark of an observation matrix must exceed 2k. We consider how to choose the… (More)

We consider the recovery of a low rank and jointly sparse matrix from under sampled measurements of its columns. This problem is highly relevant in the recovery of dynamic MRI data with high spatio-temporal resolution, where each column of the matrix corresponds to a frame in the image time series; the matrix is highly low-rank since the frames are highly… (More)

We provide a two-step approach to recover a jointly k-sparse matrix X, (at most k rows of X are nonzero), with rank r << k from its under sampled measurements. Unlike the classical recovery algorithms that use the same measurement matrix for every column of X, the proposed algorithm comprises two stages, in each of which the measurement is taken by a… (More)

We consider the recovery of a low rank and jointly sparse matrix from under sampled measurements of its columns. This problem is highly relevant in the recovery of dynamic MRI data with high spatio-temporal resolution, where each column of the matrix corresponds to a frame in the image time series; the matrix is highly low-rank since the frames are highly… (More)

- ‹
- 1
- ›