Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints

DOI10.1137/0606668909zbMath1211.65066arXivmath/0608124OpenAlexW2049709948MaRDI QIDQ3624383

Holger Rauhut, Massimo Fornasier

Publication date: 30 April 2009

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

convergencenumerical experimentscurveletslinear inverse problemsjoint sparsitysubdifferential inclusiontwo-step algorithmcolor image reconstructionthresholded Landweber iterations

Mathematics Subject Classification ID

Numerical methods for integral equations (65R20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Fredholm integral equations (45B05) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (43)

Learning and sparse control of multiagent systems ⋮ Sparsity Based Methods for Overparameterized Variational Problems ⋮ A Survey of Compressed Sensing ⋮ An efficient projection method for nonlinear inverse problems with sparsity constraints ⋮ The application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem ⋮ Unnamed Item ⋮ On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals ⋮ Composite SAR imaging using sequential joint sparsity ⋮ Proximity algorithms for the L1/TV image denoising model ⋮ An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography ⋮ Sparse and switching infinite horizon optimal controls with mixed-norm penalizations ⋮ Finite element error analysis for measure-valued optimal control problems governed by a 1D wave equation with variable coefficients ⋮ Convergence rates and source conditions for Tikhonov regularization with sparsity constraints ⋮ Iterative thresholding algorithms ⋮ Adaptive iterative thresholding algorithms for magnetoencephalography (MEG) ⋮ Fast thresholding algorithms with feedbacks for sparse signal recovery ⋮ Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms ⋮ Coorbit theory, multi-\(\alpha \)-modulation frames, and the concept of joint sparsity for medical multichannel data analysis ⋮ Iterative thresholding meets free-discontinuity problems ⋮ An Iterative Algorithm with Joint Sparsity Constraints for Magnetic Tomography ⋮ Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness ⋮ PET-MRI Joint Reconstruction by Joint Sparsity Based Tight Frame Regularization ⋮ A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty ⋮ Sparse regression using mixed norms ⋮ Accelerated projected gradient method for linear inverse problems with sparsity constraints ⋮ Linear convergence of iterative soft-thresholding ⋮ Joint sparse optimization: lower-order regularization method and application in cell fate conversion ⋮ Data-driven tight frame for multi-channel images and its application to joint color-depth image reconstruction ⋮ Randomized Kaczmarz method for single particle X-ray image phase retrieval ⋮ Optimal Control of the Undamped Linear Wave Equation with Measure Valued Controls ⋮ Uniform recovery of fusion frame structured sparse signals ⋮ Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots ⋮ Elastic-net regularization in learning theory ⋮ Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system ⋮ Sparse stabilization and control of alignment models ⋮ Modern regularization methods for inverse problems ⋮ Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients ⋮ A simple Gaussian measurement bound for exact recovery of block-sparse signals ⋮ Quasi-linear Compressed Sensing ⋮ Information theory and recovery algorithms for data fusion in Earth observation ⋮ Nonuniform recovery of fusion frame structured sparse signals ⋮ Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity ⋮ Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm

This page was built for publication: Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints