Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere

DOI10.1137/17M1147378zbMATH Open1401.90167OpenAlexW2804267292WikidataQ129736367 ScholiaQ129736367MaRDI QIDQ4689765FDOQ4689765

Authors: Xiaojun Chen, Robert S. Womersley 

Publication date: 17 October 2018

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/17m1147378

Recommendations

• Recovery of sparsest signals via \(\ell^q \)-minimization
• Exact recovery of Dirac ensembles from the projection onto spaces of spherical harmonics
• Phase retrieval for sparse signals
• On sparse reconstruction from Fourier and Gaussian measurements
• Stable Recovery of Sparse Signals Via Regularized Minimization

zbMATH Keywords

nonconvex minimizationsparse recoveryspherical designquasi-normre-weighted \(\ell_1\)spherical cubature

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical quadrature and cubature formulas (65D32) Nonconvex programming, global optimization (90C26)

Cites Work

• Sparse Optimization with Least-Squares Constraints
• Probing the Pareto frontier for basis pursuit solutions
• Title not available (Why is that?)
• Variational Analysis
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Decoding by Linear Programming
• Stable signal recovery from incomplete and inaccurate measurements
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Sparse Reconstruction by Separable Approximation
• Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
• A mathematical introduction to compressive sensing
• Uncertainty principles and ideal atomic decomposition
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Complexity of unconstrained \(L_2 - L_p\) minimization
• Iteratively reweighted least squares minimization for sparse recovery
• Title not available (Why is that?)
• Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
• A note on the complexity of \(L _{p }\) minimization
• Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Distributing many points on a sphere
• Spherical codes and designs
• Extremal systems of points and numerical integration on the sphere
• Well conditioned spherical designs for integration and interpolation on the two-sphere
• Sensitivity to Basis Mismatch in Compressed Sensing
• Super-Resolution on the Sphere Using Convex Optimization
• Computational existence proofs for spherical \(t\)-designs
• Exact recovery of Dirac ensembles from the projection onto spaces of spherical harmonics
• On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms
• Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
• Well-separated spherical designs
• Optimal asymptotic bounds for spherical designs
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
• Efficient spherical designs with good geometric properties
• Penalty methods for a class of non-Lipschitz optimization problems
• Sampling Sparse Signals on the Sphere: Algorithms and Applications
• Learning the Spherical Harmonic Features for 3-D Face Recognition
• Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets
• Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction
• 3D face recognition with sparse spherical representations

Cited In (13)

• Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere
• Spherical Framelets from Spherical Designs
• Weighted spectral filters for kernel interpolation on spheres: estimates of prediction accuracy for noisy data
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
• Sparse solutions of a class of constrained optimization problems
• Exact recovery of Dirac ensembles from the projection onto spaces of spherical harmonics
• Anisotropic diffusion in consensus-based optimization on the sphere
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation
• Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
• Sketching with Spherical Designs for Noisy Data Fitting on Spheres
• Spherical designs for approximations on spherical caps
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
• Numerical computation of triangular complex spherical designs with small mesh ratio

Uses Software

• CVX
• SPGL1
• Healpix

This page was built for publication: Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere

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