The Implicit Convex Feasibility Problem and Its Application to Adaptive Image Denoising

DOI10.4208/jcm.1606-m2016-0581zbMath1374.90305arXiv1606.05848OpenAlexW2963474383MaRDI QIDQ5276763

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

projection methodsimage denoisingproximity functionsplit feasibilityvariable setsimplicit convex feasibility

Mathematics Subject Classification ID

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

Related Items (4)

The combination projection method for solving convex feasibility problems ⋮ \(l_1\)-\(l_2\) regularization of split feasibility problems ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ Distributed optimization for degenerate loss functions arising from over-parameterization

This page was built for publication: The Implicit Convex Feasibility Problem and Its Application to Adaptive Image Denoising