Stable separation and super-resolution of mixture models

DOI10.1016/J.ACHA.2017.03.003zbMATH Open1442.94013arXiv1506.07347OpenAlexW2964314677MaRDI QIDQ1990966FDOQ1990966

Authors: Yuejie Chi, Yuan-Xin Li 

Publication date: 29 October 2018

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Abstract: We consider simultaneously identifying the membership and locations of point sources that are convolved with different band-limited point spread functions, from the observation of their superpositions. This problem arises in three-dimensional super-resolution single-molecule imaging, neural spike sorting, multi-user channel identification, among other applications. We propose a novel algorithm, based on convex programming, and establish its near-optimal performance guarantee for exact recovery in the noise-free setting by exploiting the spectral sparsity of the point source models as well as the incoherence between point spread functions. Furthermore, robustness of the recovery algorithm in the presence of bounded noise is also established. Numerical examples are provided to demonstrate the effectiveness of the proposed approach.

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

Recommendations

• Stable super-resolution of images: theoretical study
• Super-resolution of point sources via convex programming
• Super-resolution of positive sources: the discrete setup
• Super-resolution from noisy data
• Multivariate super-resolution without separation

zbMATH Keywords

parameter estimationmixture modelssuper-resolutionatomic norm minimization

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Inequalities; stochastic orderings (60E15) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Robust principal component analysis?
• Probability Inequalities for Sums of Bounded Random Variables
• User-friendly tail bounds for sums of random matrices
• Introduction to spectral analysis
• Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
• The convex geometry of linear inverse problems
• Near Minimax Line Spectral Estimation
• Super-resolution from noisy data
• Towards a Mathematical Theory of Super‐resolution
• Sensitivity to Basis Mismatch in Compressed Sensing
• Atomic Norm Denoising With Applications to Line Spectral Estimation
• Super-resolution of point sources via convex programming
• Compressed Sensing Off the Grid
• Parametric deconvolution of positive spike trains.
• Robust Spectral Compressed Sensing via Structured Matrix Completion
• Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
• On the detection of singularities of a periodic function
• A review of methods for spike sorting: the detection and classification of neural action potentials
• Inequalities of A. Markoff and S. Bernstein for polynomials and related functions
• Compressive Two-Dimensional Harmonic Retrieval via Atomic Norm Minimization
• Off-the-Grid Line Spectrum Denoising and Estimation With Multiple Measurement Vectors

Cited In (4)

• Supermix: sparse regularization for mixtures
• Multi-kernel unmixing and super-resolution using the modified matrix pencil method
• A note on spike localization for line spectrum estimation
• A unified method for super-resolution recovery and real exponential-sum separation

Uses Software

• CVX

This page was built for publication: Stable separation and super-resolution of mixture models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990966)