The implicit convex feasibility problem and its application to adaptive image denoising

DOI10.4208/JCM.1606-M2016-0581MaRDI QIDQ5276763zbMATH OpenOpenAlexFDO

Authors Aviv Gibali, Frank Lenzen, Christoph Schnörr, Yair Censor

Publication date 14 July 2017

Published in Journal of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

image denoisingimplicit convex feasibilityprojection methodsproximity functionsplit feasibilityvariable sets

Mathematics Subject Classification ID

Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: The implicit convex feasibility problem attempts to find a point in the intersection of a finite family of convex sets, some of which are not explicitly determined but may vary. We develop simultaneous and sequential projection methods capable of handling such problems and demonstrate their applicability to image denoising in a specific medical imaging situation. By allowing the variable sets to undergo scaling, shifting and rotation, this work generalizes previous results wherein the implicit convex feasibility problem was used for cooperative wireless sensor network positioning where sets are balls and their centers were implicit.

Recommendations

• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
• A strongly convergent parallel projection algorithm for convex feasibility problem
• The hybrid extragradient implicit approach for convex feasibility problems
• On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery

Cited in

(6)

• The combination projection method for solving convex feasibility problems
• \(l_1\)-\(l_2\) regularization of split feasibility problems
• Distributed optimization for degenerate loss functions arising from over-parameterization
• On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
• A note on the moment problem for codimension greater than 1
• The construction of multidimensional membership functions and its application to feasibility problems

This page was built for publication: The implicit convex feasibility problem and its application to adaptive image denoising

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