On the uniqueness of solutions for the basis pursuit in the continuum
From MaRDI portal
Publication:5044980
Abstract: This paper studies the continuous-domain inverse problem of recovering Radon measures on the one-dimensional torus from low-frequency Fourier coefficients, where Kc is the cutoff frequency. Our approach consists in minimizing the total-variation norm among all Radon measures that are consistent with the observations. We call this problem the basis pursuit in the continuum (BPC). We characterize the solution set of (BPC) in terms of uniqueness and describe its sparse solutions which are sums of few signed Dirac masses. The characterization is determined by the spectrum of a Toeplitz and Hermitian-symmetric matrix that solely depends on the observations. More precisely, we prove that (BPC) has a unique solution if and only if this matrix is neither positive definite nor negative definite. If it has both a positive and negative eigenvalue, then the unique solution is the sum of at most 2Kc Dirac masses, with at least one positive and one negative weight. If this matrix is positive (respectively negative) semi-definite and rank deficient, then the unique solution is composed of a number of Dirac masses equal to the rank of the matrix, all of which have nonnegative (respectively nonpositive) weights. Finally, in cases where (BPC) has multiple solutions, we demonstrate that there are infinitely many solutions composed of Kc+1 Dirac masses, with nonnegative (respectively nonpositive) weights if the matrix is positive (respectively negative) definite.
Recommendations
- On the uniqueness of solutions to continuity equations
- On uniqueness guarantees of solution in convex regularized linear inverse problems
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
- Unique continuation for solutions of \(p(x)\)-Laplacian equations
- scientific article; zbMATH DE number 825865
- On the uniqueness of continuous solutions of functional equations
- scientific article; zbMATH DE number 865589
- An alternative approach to the uniqueness of unconditional basis of \(\ell _p(c_{0})\) for \(0<p<1\)
- On the unique minimal monomial basis of Birkhoff interpolation problem
- Continuity of the null space basis and constrained optimization
Cites work
- scientific article; zbMATH DE number 2134205 (Why is no real title available?)
- scientific article; zbMATH DE number 3174732 (Why is no real title available?)
- scientific article; zbMATH DE number 3708924 (Why is no real title available?)
- scientific article; zbMATH DE number 40939 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3451330 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3271087 (Why is no real title available?)
- scientific article; zbMATH DE number 3336209 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A fast homotopy algorithm for gridless sparse recovery
- A mathematical introduction to compressive sensing
- A new approach to variable selection in least squares problems
- A semidefinite programming approach to the generalized problem of moments
- Atomic decomposition by basis pursuit
- Compressed sensing
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- Exact reconstruction using Beurling minimal extrapolation
- Exact support recovery for sparse spikes deconvolution
- Functional penalised basis pursuit on spheres
- Inverse problems in spaces of measures
- MultiDimensional Sparse Super-Resolution
- Nonlinear total variation based noise removal algorithms
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Prony methods for recovery of structured functions
- Representer Theorems for Sparsity-Promoting <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math> </inline-formula> Regularization
- Sampling signals with finite rate of innovation
- Signal Recovery by Proximal Forward-Backward Splitting
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse non-negative super-resolution -- simplified and stabilised
- Sparse optimization on measures with over-parameterized gradient descent
- Sparse regularization on thin grids. I: The \textsc{Lasso}.
- Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
- Sparsest piecewise-linear regression of one-dimensional data
- Spike detection from inaccurate samplings
- Spline solutions to L\(^1\) extremal problems in one and several variables
- Splines are universal solutions of linear inverse problems with generalized TV regularization
- Stable super-resolution of images: theoretical study
- Super-resolution from noisy data
- Super-resolution of point sources via convex programming
- TV-based reconstruction of periodic functions
- The Lasso problem and uniqueness
- The ML–EM algorithm in continuum: sparse measure solutions
- The alternating descent conditional gradient method for sparse inverse problems
- The generalized Lasso problem and uniqueness
- The shaping of the Riesz representation theorem: A chapter in the history of analysis
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Towards Generalized FRI Sampling With an Application to Source Resolution in Radioastronomy
- Towards a Mathematical Theory of Super‐resolution
- When does OMP achieve exact recovery with continuous dictionaries?
Cited in
(3)
This page was built for publication: On the uniqueness of solutions for the basis pursuit in the continuum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044980)
