Convergence rates for the joint solution of inverse problems with compressed sensing data
From MaRDI portal
Publication:5058467
regularizationsparse recoveryinverse problemsconvergence ratecompressed sensing from indirect datajoint recovery
Numerical methods for inverse problems for boundary value problems involving PDEs (65N21) Inverse problems for PDEs (35R30) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15) Numerical methods for ill-posed problems for boundary value problems involving PDEs (65N20)
Abstract: Compressed sensing (CS) is a powerful tool for reducing the amount of data to be collected while maintaining high spatial resolution. Such techniques work well in practice and at the same time are supported by solid theory. Standard CS results assume measurements to be made directly on the targeted signal. In many practical applications, however, CS information can only be taken from indirect data related to the original signal by an additional forward operator. If inverting the forward operator is ill-posed, then existing CS theory is not applicable. In this paper, we address this issue and present two joint reconstruction approaches, namely relaxed co-regularization and strict co-regularization, for CS from indirect data. As main results, we derive error estimates for recovering and . In particular, we derive a linear convergence rate in the norm for the latter. To obtain these results, solutions are required to satisfy a source condition and the CS measurement operator is required to satisfy a restricted injectivity condition. We further show that these conditions are not only sufficient but even necessary to obtain linear convergence.
Recommendations
- Compressive sensing principles and iterative sparse recovery for inverse and ill-posed problems
- Sparsity and compressed sensing in inverse problems
- Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
- Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE
- An introduction to compressed sensing
Cites work
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- A novel compressed sensing scheme for photoacoustic tomography
- A simple proof of the restricted isometry property for random matrices
- Compressed sensing
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
- Convergence rates of convex variational regularization
- Elastic-net regularization: error estimates and active set methods
- Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
- On Sparse Representations in Arbitrary Redundant Bases
- Proximal splitting methods in signal processing
- Regularization and Variable Selection Via the Elastic Net
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse regularization with l q penalty term
- Stable signal recovery from incomplete and inaccurate measurements
- Variational Source Conditions, Quadratic Inverse Problems, Sparsity Promoting Regularization
- Variational methods in imaging
Cited in
(3)
This page was built for publication: Convergence rates for the joint solution of inverse problems with compressed sensing data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058467)