Robust Spectral Compressed Sensing via Structured Matrix Completion

DOI10.1109/TIT.2014.2343623zbMath1360.94064arXiv1304.8126OpenAlexW3106271742MaRDI QIDQ2986119

Yuxin Chen, Yuejie Chi

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.8126

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

A class of deterministic sensing matrices and their application in harmonic detection ⋮ Compressed Sensing, Sparse Inversion, and Model Mismatch ⋮ Off-the-Grid Recovery of Piecewise Constant Images from Few Fourier Samples ⋮ Nonconvex Low-Rank Tensor Completion from Noisy Data ⋮ Image restoration: structured low rank matrix framework for piecewise smooth functions and beyond ⋮ Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm ⋮ An upper bound on the minimum rank of a symmetric Toeplitz matrix completion problem ⋮ Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion ⋮ Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs ⋮ Matrix completion for matrices with low-rank displacement ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery ⋮ Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation ⋮ Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization ⋮ Exact matrix completion based on low rank Hankel structure in the Fourier domain ⋮ Stable separation and super-resolution of mixture models ⋮ Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion ⋮ Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm ⋮ Spectral Compressed Sensing via Projected Gradient Descent ⋮ Low-rank matrix completion in a general non-orthogonal basis ⋮ Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction ⋮ Fast Cadzow's algorithm and a gradient variant ⋮ Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data ⋮ A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion ⋮ Toeplitz matrix completion via a low-rank approximation algorithm ⋮ High resolution 3D imaging in MIMO radar with sparse array ⋮ A penalized method of alternating projections for weighted low-rank Hankel matrix optimization ⋮ Unnamed Item

This page was built for publication: Robust Spectral Compressed Sensing via Structured Matrix Completion