Domain decomposition methods for compressed sensing
From MaRDI portal
Decomposition methods (49M27) Convex functions and convex programs in convex geometry (52A41) Numerical optimization and variational techniques (65K10) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05) Computing methodologies for image processing (68U10) Convex programming (90C25)
Abstract: We present several domain decomposition algorithms for sequential and parallel minimization of functionals formed by a discrepancy term with respect to data and total variation constraints. The convergence properties of the algorithms are analyzed. We provide several numerical experiments, showing the successful application of the algorithms for the restoration 1D and 2D signals in interpolation/inpainting problems respectively, and in a compressed sensing problem, for recovering piecewise constant medical-type images from partial Fourier ensembles.
This page was built for publication: Domain decomposition methods for compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6212586)
