DeepAI AI Chat
Log In Sign Up

A Tight Converse to the Spectral Resolution Limit via Convex Programming

01/15/2018
by   Maxime Ferreira Da Costa, et al.
Imperial College London
0

It is now well understood that convex programming can be used to estimate the frequency components of a spectrally sparse signal from m uniform temporal measurements. It is conjectured that a phase transition on the success of the total-variation regularization occurs when the distance between the spectral components of the signal to estimate crosses 1/m. We prove the necessity part of this conjecture by demonstrating that this regularization can fail whenever the spectral distance of the signal of interest is asymptotically equal to 1/m.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/26/2020

Resolution Limit for Line Spectral Estimation: Theory and Algorithm

Line spectral estimation is a classical signal processing problem aimed ...
09/15/2015

Precise Phase Transition of Total Variation Minimization

Characterizing the phase transitions of convex optimizations in recoveri...
09/02/2019

A Tight Uniform Continuity Bound for Equivocation

We prove a tight uniform continuity bound for the conditional Shannon en...
10/09/2012

Level Set Estimation from Compressive Measurements using Box Constrained Total Variation Regularization

Estimating the level set of a signal from measurements is a task that ar...
01/03/2018

Phase Transition of Convex Programs for Linear Inverse Problems with Multiple Prior Constraints

A sharp phase transition emerges in convex programs when solving the lin...
03/08/2018

Sample Complexity of Total Variation Minimization

This work considers the use of Total variation (TV) minimization in the ...
10/03/2019

On the Stable Resolution Limit of Total Variation Regularization for Spike Deconvolution

The stability of spike deconvolution, which aims at recovering point sou...